UVa OJ Board

Is here anyone who solved the problem? I am not understanding the statements clearly. Can anyone help me describing the problem with respect to 3rd input output, plz?

Getting WA! Tried some inputs.... It works fine.... :-( #include <stdio.h> int main() { long long int n, m, i, j, a, c, s, s2, k; while (scanf("%lld %lld", &n, &m) == 2) { if (n == 0 && m == 0) break; k = m; a = n - m; if (a < m) { c = a; a = m; m = c; } a = a + 1, s = 1, s2 = 1; while (a <= n) { s ...

Oja! Thank you.... I got AC using ^ But I fund no error in my code. It does the exact thing. My codes count the sum ignoring carry bit. I think my code has faced data type problem. I stored summation in a variable. If both numbers are big enough then my summing variable will have to handle twice of ...

Oja! Thank you.... I got AC using ^ But I fund no error in my code. It does the exact thing. My codes count the sum ignoring carry bit. I think my code has faced data type problem. I stored summatiare on in a variable. If both numbers are big enough then my summing variable will have to handle twice...

Is there anyone? I need help....

I used long long int to catch the range. Checked maximum bits of the largest number and the sum. Decided to print normally addition value if no carry bit. if there is any, i printed the value subtracting the place value for last Digit. I got WA. Help me with critical inputs or any hints to debug my ...

I am tired of TLE for this problem.... First I tried it manual then I tried it with sieve method..... But yet I am having TLE.... Help me to with any clues plz.....
http://ideone.com/uTTQz8

it is said that "each of the two given integers is not less than 1"..... but in sample input there is given 0 as one of the integers..... is there anything i understood wrong???

I am getting TLE for the problem. Can anyone help.me to make it work faster please? #include <stdio.h> #include <math.h> int prime(int n) { int i, a = 1; for (i = 2; i <= sqrt(n); i++) if (n % i == 0) { a = 0; break; } if (n < 2) a = 0; if (a == 1) return 1; else return 0; } int main() { int t, n, m...

Thanks!!! I GOT AC I don't know how to thank you....

Oops! I left some points unchanged.
I am simply tempered with this problem. Can you check it again please? Here is my new codes.
http://ideone.com/M842Yl

It's still WA. . . .
http://ideone.com/nOw2Pd

4
1 3 2 -2
Here, 1-3=2, 3-2=1, 2-(-2)=4
2,1,4=> 1,2,4
Ain't that jolly?
3
4 1 3
Here too, 4-1=3, 1-3=2
3,2=>2,3
Ain't that jolly too?
Please, brief me the task. May be i didn't understand it properly. . . .

i got WA. . . . Can you help me to correct it?
http://ideone.com/FJcIim

Thanks! I got AC. . .