OJ Board

I thought I've tried that one - printing a new line after each problem - but it didn't work. But then, after seeing your post, I try printing a new line again, and it worked!

Thanks, Rocky.

Can anyone help me? I get PE. I've tried handling the output if the input is n = 1.

Here's my code:
Thanks.

Ok, thanx. I didn't notice the range of the output..

Ok, thanx, but if 0 < N < 2^31, isn't it enough if I use long int?

Got it! Thanx a lot, Jan

I've made it the same, I guess, but still get WA with this code: Can anyone tell me where the mistake is?
Thanx.

I still don't get it. I've tried all possible corrections, but none get AC.
I suppose that both the sum & difference must be either even or odd. I still get WA.
e.g.:

1. 15 12 (Odd & Even)
x + y = 15
x - y = 12
------------- +
x = (15 - 12) / 2
(doesn't fulfil)

2. 14 11 (Even & Odd)
x + y ...

I found out that the last code I posted was already correct. Since I read the topic from the other posts saying the testcase will ouput , I thought my code was wrong. I just realize that it's not a valid input.
Thanx, Jan and Joy.

I've tried using: Ur code gives the output: Expected output:

Still don't get it. After changing the %ld with %lu (unsigned long), for the input:

1
429496295


I get:

11 2893333982


And, using long long (%lld, right?), I get:

15 1266996621


Shouldn't it be:

3 12574247521

??

Here's the new code:

Deleted after AC


Anything wrong with the ...

Ok, thanx. I'll post in the same thread next time

I don't catch it, if the data will yield a palindrome that is not greater than 4,294,967,295, shouldn't it be enough with unsigned long??

And, if s is used to store the string of the unsigned long, 11 should be enough, isn't it?

Btw, I've tried using long long and changing s to s[110], but the ...

I still get WA with this code:
Can anyone help?
Thanx.