1.program Programl; var a,x,y,okl,ok2:integer; begin a :=100: x:=l0; y:=20; okl:=5: ok2:=0; if ((x>y) or ((y<>20) and (okl=0)) and (ok2<>0)) then a:=1 else if ((okl<>0) and (ok2=、0)) then a:=-1 else a:=0; writeln(a); end.
输出:
2.program Program2; var a,t:string; i,j:integer; begin a:=`morning`; j:= l;
for i:=2 to 7 do if (a[j]<a[i])then j:= i; j:= j-1; for i:=1 to j do write (a[i]); end.
输出:
3.program Program3; Var a,b,c,d,sum:longint; begin read (a,b,c,d); a:=a mod 23: b:=b mod 28; c:=c mod 33; sum:=a*5544+b* 14421+c*1288-d; sum:=sum+21252; sum:=sum mod 21252; if (sum=0)then sum:=21252; writeln(sum); end.
输入:283 102 23 320 输出:
4.program program4; var a: array[0..5] of integer; sum,n,max,i,j,k:integer; cover:array[0..22000]of boolean; begin read (a[5],a[4],a[3],a[2],a[1],a[0]); if ((a[5]=0) and (a[3]=0) and (a[1]=0)) then begin a[5]:=a[4];a[4]:=a[2]; a[3]:=a[0]; a[2]:=0 a[0]:=0; end: for i:=0 to 5 do if (a[i]>10) then a[i]:=10+(a[i] mod 2); sum:=0: for i:=0 to 5 do sum:=sum+a[i]*(6-i); if ((sum mod 2) <>0) then begin writeln(`Can``t be divided.`); Exit; End; sum:=sum div 2; max:=0; cover[0]:=True; for i:=1 to sum*2 do cover[i]:=False; for i:=0 to 5 do begin j:=0; while (j<a[i])do begin for k:=max downto 0 do begin if (cover[k]) then cover[k+6-i]:=True;end; max:=max+6-i: j:=j+1; end; end; if (cover[sum]) then writeln (`Can be divided.`) else writeln(`can``t be divided.`); end.
program Program41; var a,b,c,m:real; begin read (a,b,c); m:=b*b -4*a*c; if ( ① )then begin write ( ② :0:3); write( ` , ` ); write ((-1*b-sqrt(m))/(2*a):0: ③ ); end else if ( ④ )then write( ⑤ ) else begin write (`No solution`); end end.
program Programl; var m:integer; function solve (m:integer):integer; vat i,t,d:integer; flag:boolean; begin if (m=1)then so1ve:= ① else begin d:=2*m+1; t:= 2; i:= 1; flag:=False; repeat if (t=1)then begin solve:= ② flag:=True; end else if ( ③ )then begin solve:=i*m-1; flag:=True; end else t:= ④ ; i:=i+1; until flag; end end; begin read (m); if ((m>0) and (m<1000)) then writeln ( ⑤ ); end.