SPOJ求解

来源:百度知道 编辑:UC知道 时间:2024/06/07 20:42:09
challenge 270,Digits of PI.求程序!
http://www.spoj.pl/problems/PIVAL/
分数高的可以追分!

label ext,ext2;
const
dn=6890;
var
i,ip,c:integer;
k:longint;
a,b,sum:array[1..dn] of integer;

procedure oupt;
var i:integer;
k:longint;

procedure testk;
begin
end;

begin
k:=0;
write(sum[1],'.');
for i:=2 to dn do
begin
write(sum[i] div 1000); k:=k+1; testk;
write(sum[i] div 100 mod 10); k:=k+1; testk;
write(sum[i] div 10 mod 10 ); k:=k+1; testk;
write(sum[i] mod 10); k:=k+1; testk;
end;
end;

procedure m_div(k:longint);
var
i:integer;
r1,c:longint;
begin
c:=0;
for i:=ip to dn do
begin
r1:=c*10000+a[i];
a[i]:=r1 div k;
c:=r1 mod k;
end;
end;
procedure m_div2(k:longint);
var
i:integer;
r1,c:longint;
begin
c:=0;
{ for