s:string;
n,i:integer;
n1:array[1..100000] of word;
begin
readln(s);
for i:=1 to length(s) do
n1[i]:=ord(s[i])-48;
n:=length(s);
while n>2 do
begin
for i:=1 to n-1 do
begin
n1[i]:=n1[i]+n1[i+1];
if n1[i]>=10 then n1[i]:=n1[i] mod 10;
end;
dec(n);
end;
if (n1[1]=0)and(n1[2]=0) then writeln(100)
else writeln(n1[1],n1[2]);
end.
为什么我错的地方输出都是28....
只过了3个点
d,a:array[1..1000] of longint;
procedure qsort(head,tail:longint);
var x,i,j:longint;
begin
x:=d[head];
i:=head;
j:=tail;
while i<j do
begin
while(i<j)and(d[j]>=x)do j:=j-1; d[i]:=d[j];
while(i<j)and(d[i]<=x)do i:=i+1; d[j]:=d[i];
end;
d[i]:=x;
if head<i-1 then qsort(head,i+1);
if i+1<tail then qsort(i+1,tail);
end;
begin
readln(n);
for i:=1 to n do read(d[i]);
qsort(1,n);
i:=1;
while i<=n do
begin
i:=i+1;
while d[i]=d[i-1] do begin
for j:=1 to n do begin
d[j-1]:=d[j];
d[j]:=0
end;
n:=n-1;
end;
end;
writeln(n);
for i:=1 to n-1 do write(d[i],' ');
write(d[n]);
end.
d,a:array[1..1000] of longint;
procedure qsort(head,tail:longint);
var x,i,j:longint;
begin
x:=d[head];
i:=head;
j:=tail;
while i<j do
begin
while(i<j)and(d[j]>=x)do j:=j-1; d[i]:=d[j];
while(i<j)and(d[i]<=x)do i:=i+1; d[j]:=d[i];
end;
d[i]:=x;
if head<i-1 then qsort(head,i+1);
if i+1<tail then qsort(i+1,tail);
end;
begin
readln(n);
for i:=1 to n do read(d[i]);
qsort(1,n);
i:=1;
while i<=n do
begin
i:=i+1;
while d[i]=d[i-1] do begin
for j:=1 to n do begin
d[j-1]:=d[j];
d[j]:=0
end;
n:=n-1;
end;
end;
writeln(n);
for i:=1 to n-1 do write(d[i],' ');
write(d[n]);
end.