讨论 - 1 - RQNOJ

余可2代 2011-04-20 21:06:00

点我顶贴收藏删除

1

#1 张湛二代@2011-04-20 21:02:00

回复删除

1

program sji;

var n,m,r,i,p,sum,x,pok:longint; begin

readln(n,r);

p:=maxlongint; sum:=0;

for i:=1 to n do

begin

read(x);

if x<p then p:=x;

inc(sum,x);

end;

readln;

while sum mod p > 0 do dec(p);

writeln((sum div p) - n,' ',p);

if p>r then write('T') else write('F');

readln;

end.

#2 岑洲杰@2011-04-20 21:06:00

回复删除

var a:array [0..1000] of boolean;

x,i,count,n:longint;

begin

readln(n);

fillchar(a,sizeof(a),#0);

for i:=1 to n do

begin

read(x);

if not a[x] then begin a[x]:=true; inc(count); end;

end;

writeln(count);

for i:=1 to 1000 do

if a[i] then write(i,' ');

writeln;//klklklklklklklklklklklklklklklllllllllllllllllllllllllllllllllllllllllllfgfgfg

end.

#3 岑洲杰@2011-04-20 21:06:00

回复删除

var a:array [0..1000] of boolean;

x,i,count,n:longint;

begin

readln(n);

fillchar(a,sizeof(a),#0);

for i:=1 to n do

begin

read(x);

if not a[x] then begin a[x]:=true; inc(count); end;

end;

writeln(count);

for i:=1 to 1000 do

if a[i] then write(i,' ');

writeln;//klklklklklklklklklklklklklklklllllllllllllllllllllllllllllllllllllllllllfgfgfg

end.