pascal 读取整数

想了想...1--varn,m:integer;functionf(n,m:integer):longint;vari,s:longint;{因为总和可能很大所以用longint}beginfori:

vara:array[1..1000]ofinteger;n,i,j,k:integer;beginreadln(n);j:=1;fori:=1tondobeginread(a[i]);ifa[i]

varn:longint;beginreadln(n);ifnmod7=0thenwriteln('yes'){除以7取余,是否等于0,等于则输出yes,否则输出no}elsewriteln('no'

pascalpascalpascal!

vari,c:integer;beginc:=0;fori:=1to1000doifimod15=0thenc:=c+i;writeln(c);end.

functionisOk(n:integer):boolean;vari:integer;beginresult:=pos('5',inttostr(n))>0;end;functionmyFunc(

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

用辗转相除不就行了!

varn,s:longint;beginread(n);s:=0;whilen0dobegins:=s+nmod10;n:=ndiv10;end;writeln(s);end.自创!

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

importjava.util.Scanner;publicclasstest{publicstaticvoidmain(String[]args){Scannerinput=newScanner(S

programDoingData;varn:longint;sum:longint;n1:real;n2:longint;n3:real;a:array[0..1000]oflongint;f:arr

楼主你好!这很简单哦.vara,b,x:longint;functionmax(a,b:longint):longint;beginifa>bthenexit(a);exit(b);end;begin

vari,n,r:longint;s:single;beginreadln(n);fori:=1tondobeginreadln(r);writeln(r*r*3.1415926:0:2);end;e

{而这10个数：106991041201071123310297100　按一定顺序排列后得到：120112107106104102100999733　正中间有两个数：104102,中位数就是这两个数的

vari,j,n,m:longint;procedureprint(c:char;a:integer);vari:longint;beginfori:=1toadowrite(c);end;begin

1.过滤这100个数将这100个数中出现了多少个不重复的数字放入一个数组2.循环这个数组,循环取出里面的数,计算出此数在原数组中也就是之前生成的100个数中出现多少次你就这么实现吧,很简单两层的for

for(intx=0;xinta=input.nextInt();\x09\x09while(a!=0){\x09\x09num[i]=a;\x09\x09i++;\x09\x09a=input.ne

vars,n,a:longint;begins:=0;whilea0dobeginn:=amod10;s:=s+n;a:=adiv10;end;writeln(s);end.

//写入的不是ASCII码所以打开a.txt是乱码#include#include#includevoidmain(){FILE*fp1,*fp2;if((fp1=fopen("a.txt","w