状态题目:奇怪的贸易
题目编号:81-奇怪的贸易 [查看该题]
状态: Unaccepted
测评机: Xeost[5]
得分: 10分
提交日期: 2008-8-7 11:47:00
有效耗时: 62毫秒
测试结果1: 通过本测试点|有效耗时62:ms
测试结果2: 测试结果错误.错误结果为:0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000116300778
正确结果应为:0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000038771006442
测试结果3: 测试结果错误.错误结果为:0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002461849776
正确结果应为:0000000000000000000000000000000000000160781461962132685172195729145257837508176166826917181901297840
测试结果4: 测试结果错误.错误结果为:0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000005451757502
正确结果应为:6963214594661149433992115371580477867131084224865128024624550345104782730033721159499979447113824190
测试结果5: 测试结果错误.错误结果为:00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000-1809666836
正确结果应为:3811257440017411198903455442811394348202454899337554467290714948577254574628589030983482094611770604
测试结果6: 选手程序运行超过时限
测试结果7: 选手程序运行超过时限
测试结果8: 选手程序运行超过时限
测试结果9: 选手程序运行超过时限
测试结果10: 选手程序运行超过时限
提交代码:
var
z:real;
s:string;
x,n,i,j:longint;
a,m:array[0..100000]of longint;
begin
readln(x,n);
readln(a[0]);
for i:=1 to n do
readln(a[i]);
for i:=1 to n do
m[i]:=x;
for i:=1 to n do
begin
for j:=1 to i-1 do
m[i]:=m[i]*x;
z:=z+m[i]*a[i];
end;
z:=z+a[0];
str(z:0:0,s);
for i:=1 to 100-length(s) do
write(’0’);
write(z:0:0);
end.