大家都来刷天梯

1201 最小数和最大数
var
n,i,x:longint;
max,min:int64;
begin
max:=-maxlongint; min:=maxlongint;
readln(n);
for i:=1 to n do
begin
read(x);
if x>max then max:=x;
if x<min then min:=x;
end;
writeln(min,' ',max);
end.

1202 求和
var m,n,i:int64;
a:array[1..100] of int64;
begin
readln(n);
for i:=1 to n do read(a[i]);
for i:=1 to n do m:=m+a[i];
writeln(m);
end.

1203 判断浮点数是否相等
var
a,b:double;
begin
readln(a,b);
if abs(a-b)<=1e-8 then writeln('yes')
else writeln('no');
end.

1206 保留两位小数
var a:real;
begin
readln(a);
writeln(a:0:2);
end.

2235 机票打折
var a,c,d,e,f,g:integer;
b:real;
begin
read(a,b);
c:=round(a*(b/10));
if c<1000 then
begin
d:=c mod 10;
e:=c mod 100 div 10;
f:=c div 100;
if d<5 then write(f*100+e*10) else write(f*100+(e+1)*10);
end;
if c>1000 then
begin
d:=c mod 10;
e:=c mod 100 div 10;
f:=c mod 1000 div 100;
g:=c div 1000;
if d<5 then write(g*1000+f*100+e*10) else write(g*1000+f*100+(e+1)*10);
end;
end.

1204 寻找子串位置
var
a,b,d:ansistring;
c,e,i:longint;
begin
readln(d);
for i:=1 to length(d) do
if d[i]=' ' then begin
a:=copy(d,1,i);
break;
end;
for e:=i to length(d) do
if d[e+1]<>' ' then begin
b:=copy(d,e+1,length(d));
break;
end;
c:=pos(b,a);
write(c);
end.

1205 单词翻转
var a:array[1..1000]of string;
b:string;
i,c,k:integer;
begin
read(b);
k:=0;
while pos(' ',b)>0 do
begin
c:=pos(' ',b);
a[k+1]:=copy(b,1,c-1);
k:=k+1;
delete(b,1,c);
end;
write(b);
for i:=k downto 1 do write(' ',a[i]);
end.

1075 明明的随机数
var a:array[1..100] of integer;
b:array[1..1000] of integer;
s,i,n:integer;
begin
readln(n);
for i:=1 to n do read(a[i]);
readln;
for i:=1 to n do b[a[i]]:=1;
s:=0;
for i:=1 to 1000 do if b[i]=1 then inc(s);
writeln(s);
for i:=1 to 1000 do if b[i]=1 then write(i,' ');
writeln;
end.

1076 排序
var
n,i:longint;
a:array[1..100000] of longint;
procedure qsort(l,r:longint);
var i,j,mid,temp:longint;
begin
i:=l; j:=r; mid:=a[(l+r) div 2];
repeat
while a[i]<mid do inc(i);
while a[j]>mid do dec(j);
if not(i>j) then
begin
temp:=a[i]; a[i]:=a[j]; a[j]:=temp;
inc(i); dec(j);
end;
until i>j;
if i<r then qsort(i,r);
if j>l then qsort(l,j);
end;
begin
readln(n);
for i:=1 to n do read(a[i]);
qsort(1,n);
for i:=1 to n-1 do write(a[i],' '); writeln(a[n]);
end.

删前留名好了