说明:为了便于对应,没有把前面的数字消掉。
2 program aa(input,output);
var n,len,m,i,j:integer;
a,b,c:array[0..9] of integer;
3 begin
4 len:=0;
for i:=0 to 9 do begin a[i]:=0; b[i]:=0; end;
b[1]:=1;
5 readln(n);
6 m=n;
7 while(m>0) begin len:=len+1;c[len]:=m mod 10;m:=m div 10;end;
8 for i:=2 to 9 do b[i]:=b[i-1]*10;
9 m=n;
10 for i:=len downto 1 do
11 begin
12 for j:=0 to 9 do a[j]:=a[j]+b[i-1]*(i-1)*c[i];
13 for j:=0 to c[i]-1 do a[j]:=a[j]+b[i];
14 a[c[i]]:=a[c[i]]+m mod b[i]+1;
15 end;
16 for i:=1 to len do a[0]:=a[0]-b[i];
17 for i:=0 to 9 do
18 write(a[i]); writeln;
19
20 end.
56456
四大四大