pascal高精度问题

发布网友 发布时间：2023-04-07 06:21

我来回答

共2个回答

热心网友 时间：2024-10-05 12:40

我是乐于助人的，不像楼上那位只看钱财
1.
type data=array [1..1000,0..1000] of longint;
var
a:data;
i,j,n:longint;
procere cf;
begin
for i:=2 to n do
begin
for j:=1 to 999 do
begin
a[i,j]:=a[i-1,j]*i+a[i,j];
a[i,j+1]:=a[i,j] div 10+a[i,j+1];
a[i,j]:=a[i,j] mod 10;
end;
a[i,1000]:=a[i,999] div 10+a[i,3];
end;
end;
procere print;
begin;
i:=1000;
while (a[n,i]=0) and (i>1) do dec(i);
for j:=i downto 1 do
write(a[n,j]);
end;
begin
readln(n);
a[1,1]:=1;
cf;
print;
end.

2.
var
a,c:array[1..200] of 0..9;
x,b,i,j,lena:longint;
n1,n2:string;
begin
readln(n1);
readln(n2);
lena:=length(n1);
for i:=1 to lena do val(n1[i],a[i]);
val(n2,b);
for i:=1 to lena do
begin
c[i]:=(x*10+a[i]) div b;
x:=(x*10+a[i]) mod b;
end;
j:=1;
while (c[j]=0) and (j<lena) do inc(j);
for i:=j to lena do write(c[i]);
writeln;
end.

3.
type data=array [1..1000,0..1000] of longint;
var
a:data;
i,j,n:longint;
procere cf;
begin
for i:=2 to n do
begin
a[i,1]:=a[i-1,1]+i;
for j:=2 to 999 do
begin
a[i,j]:=a[i-1,j]+a[i,j];
a[i,j+1]:=a[i,j] div 10+a[i,j+1];
a[i,j]:=a[i,j] mod 10;
end;
a[i,1000]:=a[i,999] div 10+a[i,3];
end;
end;
procere print;
begin;
i:=1000;
while (a[n,i]=0) and (i>1) do dec(i);
for j:=i downto 1 do
write(a[n,j]);
end;
begin
readln(n);
a[1,1]:=1;
cf;
print;
end.

4.
type data=array [1..1000,0..1000] of longint;
var
a:data;
i,j,n:longint;
procere cf;
begin
for i:=2 to n do
begin
for j:=1 to 2 do
begin
a[i,j]:=a[i-1,j]*i+a[i,j];
a[i,j+1]:=a[i,j] div 10+a[i,j+1];
a[i,j]:=a[i,j] mod 10;
end;
a[i,3]:=a[i,2] div 10+a[i,3];
end;
end;
procere lj;
begin
for i:=1 to n-1 do
for j:=1 to 2 do
begin
a[n,j]:=a[i,j]+a[n,j];
a[n,j+1]:=a[n,j] div 10+a[n,j+1];
a[n,j]:=a[n,j] mod 10;
end;
end;
procere print;
begin;
i:=2;
while (a[n,i]=0) and (i>1) do dec(i);
for j:=i downto 1 do
write(a[n,j]);
end;
begin
readln(n);
a[1,1]:=1;
cf;
lj;
print;
end.

不错吧(*^__^*) 嘻嘻
望楼主采纳

热心网友 时间：2024-10-05 12:41

本来正在做任务，看见也可以顺便做一下，谁料一句话竟然4个问题还不带分的，做完这4题这个晚上都给你干活了。伤不起啊！