ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1048. Superlong Sums

It is 2 easy!
Posted by kcm1700 20 May 2004 13:49
isn`t it?

Edited by author 20.05.2004 13:49
Re: It is 2 easy!
Posted by Dulat_KBTU 6 Feb 2006 09:06
YES it is But How to do it
kcm1700 wrote 20 May 2004 13:49
isn`t it?

Edited by author 20.05.2004 13:49
Re: It is 2 easy!
Posted by Ayhan Aliyev [BOTL] 6 Feb 2006 11:24
it seems easy but not too easy
Re: It is 2 easy!
Posted by Lotl_kamran 12 Feb 2006 21:46
Hi i wanto say that why my program gives error:
here is my program:
var
   k,n,x,y,z:longint;
   a:array[1..100000] of longint;
   b:array[1..100000] of longint;
   c:array[1..100000] of longint;
begin
readln(n);
for k:=1 to n do
readln(x,y);
  a[k]:=x;
  b[k]:=y;
for k:=1 to n do
begin
c[k]:=((a[k]+b[k])+((a[k+1]+b[k+1]) div 10 ))mod 10;
write(c[k]);
end;
end.
Re: It is 2 easy!
Posted by Ayhan Aliyev [BOTL] 12 Feb 2006 22:46
Your algo is wrong for this task

sehvdi ozde kokunnen.
Re: It is 2 easy!
Posted by Linus 16 Aug 2006 01:31
You forgot to write begin...end operators after entering values (for k:=1 to n do begin read(x, y) ...)

Else your algoritm seems me not correct. :)