Pascal 输入n个数的数组,找出最小数和子序列

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

var a:array[1..5,1..5] of integer;    i,j,max,ij,x,y:integer;begi

eginreadln(n);fori:=1tondoread(a[i]);k:=1;fori:=1ton-1doifa[k]再问：说明部分也写一下再答：beginreadln(n);{读入一共多少个数

vari,n,m,max,min:longint;beginreadln(n);max:=-maxlongint;min:=maxlonint;//初始化fori:=1tondobeginreadln

intdata[20]={0};intmin=0;inti=0;printf("请输入10个整数");for(i=0;i

PrivateSubCommand1_Click()Dima(1To20)AsIntegerDimiAsInteger,t1AsInteger,t2AsIntegerFori=1To20a(i)=In

#include#includeintmain(){intn;printf("inputn:");scanf("%d",&n);int*a,*b,*c,i;a=(int*)malloc(sizeof(

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

varn,min,max,g,i:integer;beginread(n);min:=-maxint;max:=maxint;fori:=1tondobeginread(g);ifmin>gthenm

vari,n,m1,m2,m3:integer;beginread(n);fori:=1tondobeginread(m3);if(i=1)or(m1>m3)thenm1:=m3;if(i=1)or(

核心代码readln(n);whilen0dobeginifn=1thenwriteln(0)elsebeginforj:=2tondoifprime(j)theninc(ans);writeln(a

到底是求组合数目?还是所有组合?迭代啊、inta[20];intn;intcnt=0;intb[20];voidfunc(intidx,intdepth){if(depth==n){handle(b)

varm,n,i,j,t,k:longint;a:array[1..1000,1..1000]oflongint;beginreadln(m,n);fori:=1tomdoforj:=1tondore

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

#include#includevoidmain(){inti,num;int*p,*head;scanf("%d",&num);if(num>1&&num再问：能否来个简单的？好多符号还没学啊再答：

参考程序：Programcount;Vara,b,c,n,m,i:integer;BeginRead(n);a:=0;b:=0;c:=0;Fori:=1TonDoBeginRead(m);IfmMod

varn,i,a,max,min:longint;beginreadln(n);//共有n个数read(a);max:=a;min:=a;fori:=2tondobeginread(a);ifa>ma

#include#defineN9voidfun(inta[N],intp,intn){inti,j,b[N];for(i=n-p,j=0;i

你没说数据范围.如果s比较小的话,用这个程序就行了：programexample;varx,i,n,s:byte;a:array[1..256]ofbyte;s:array[0..9]ofbyte;p

#includevoidmain(){intn,min,a[100],i,t,e;while(scanf("%d",&n)!=EOF&&n