pascal数的统计

一楼的程序有问题,我的程序如下1vari,j:int64;begini:=1;repeatj:=i;repeatif((jmod101)and(jmod100))thenbreak;j:=jdiv10

functiongcd(a,b:longint):longint;beginif(b=0)thenexit(a)elseexit(gcd(b,amodb));end;functionlcm(a,b:l

programSta;varch:char;T,i:longint;beginread(ch);repeatcasechof'':;'.':break;elsebeginT:=T+1;while(ch

vari,k,n1,n2:integer;beginn1:=0;n2:=0;fori:=1to20dobeginreadln(k);ifk>0thenn1:=n1+1elseifk

varch:char;s,j,i:integer;beginread(ch);whilech'.'dobeginif(ch>='A')and(ch='A')and(ch

programstat;varinf,outf:text;ss:string[10];next:array[1..10]ofinteger;s:ansistring;i,j,k,l,m,n,num,l

枚举即可vari,n,ans:longint;s:string;beginreadln(n);fori:=1tondobeginifimod30thencontinue;str(i,s);ifpos(

var:a,b,c:longint;s:string;beginreadln(a);c:=0;forb:=9toadobeginstr(b,s);ifpos('0',s)0thenc:=c+1;end

vara,n,i:longint;beginfori:=1to10dobeginread(a);ifa>0thenn:=n+1;end;write(n);end.

这是noip的一道水题,用快排就可以了,代码如下：programtongjishuzi;vara:array[1..200000]ofint64;t,n:longint;procedureqsort(

类型：搜索本题动态规划无从下手,也无数学公式可寻,看来只能搜索（组合的生成算法）,其实1

programProject1;varm,n,x,i:Integer;beginReadln(m,n);x:=0;fori:=mtondoifimod3=0thenInc(x);Writeln(x);

vari,n:longint;functionys(x:longint):longint;vari:longint;beginys:=0;fori:=1toxdiv2doifxmodi=0thenys

var s:string;    i,j,t:integer;begin  readln(s);  for&n

varb:array[1..3]ofboolean;ss:array[1..50]ofstring;s:string;i,j,k,p:integer;f:boolean;beginf:=true;fo

varm,i,max,j,t:longint;a:Array[0..10000]oflongint;f:array[1..10000]oflongint;beginreadln(m);fori:=1t

varn,a,b,i,i1,i2:integer;beginreadln(a,b);fori:=atobdobegini2:=1;fori1:=2totrunc(sqrt(i))doifimodi1=

这题用数学方法,笔算就行.思路：把10000000看做二进制数,就是128,因此一共有128-1+1=128个证明：我们先把前几个只含有数字1和0的数列出来： 1  &n

varch:char;i:integer;a:array[1..255]ofinteger;beginread(ch);whilenoteofdobeginif(ch>='a')and(ch='A')

vari,s,n:longint;a:array[1..200000]oflongint;procedures1(l,r:longint);vart,mid,i,j:longint;begini:=l