OJ Board

I've got WA too :( Please help me!! #include <cstdio> #include <iostream> #include <algorithm> #include <string> #include <map> #define Fe(it,v) for(__typeof__ ((v).begin()) it=v.begin();it!=(v).end();++it ) using namespace std; int main() { int casos; scanf("%d",&casos); while(casos--...

Hi for all

I think that December 22nd would be ok! Btw, I want to eat a lot of turkey in Christmas.

Best regards

Concrete Mathematics by Graham,Knuth and Patashnik

Thx a lot Adrian and Observer !!!!!!!!!! I've finally got AC It was an integer overflow error

Thx again and keep posting.

Thx for your reply Adrian. I've fixed a little mistake in my code :D However, I still get WA :cry: Could you or someone else give me the outputs for these inputs? Input 123 1423 57 234 6723 546 733 785143 98743 12 2 43 16 852 7653 34 42 98 564 111 9999999 23 10000001 1000000000 1000 10000 871 2387 6...

Uhmmmmmmm I got a different output for
Now my question is WHY? I guess i'm using a right approach. Could anyone give me any critical I/O?

Regards

Please help me, I'm stuck in this problem

Hi for all. I got WA in this problem :cry: . Could someone confirm this I/O or sharing with me another one? Input 1 1 3423 345223 564 1231 873 123 856 43 99 11 100000000 198437 87584 28323 9999913 762 1000000000 1000000000 0 0 9826 32 9567 823 -1 -1 Output 0.00 339.91 5.83 9.85 13.34 7.00 5221.20 23...

Hi folks. Could someone give me any critical I/O? I got several WA in this problem I guess is a precision error. Btw, this is my code(i'm using Newton-Raphson Method) #include <stdio.h> #include <math.h> int main() { int r,casos; double error,p0,p1,eps=1e-6,f,df,k,p,pi=3.14159; scanf("%i",...

Thx a lot mamun. I got AC.

Keep posting

According to the statement: "Input is terminated by a case where the value of m, n and p (-1000 ≤ m, n, p ≤ 1000) is zero."

So what happened if m=0 or n=0 or p=0?

Thx in advance

Thx a lot for sharing your great ideas !! :P I've just changed the initial value of min for 10000000 instead of 10000 and my output format(including the epsilon). And ........ finally I got AC :D. Thx for helping me to finishing with this horrible nightmare :wink: Keep posting. PS Sorry for your los...

Hi nymo thx for your reply . I got the same output with my WA code . So i'm posting it:
Please help me. This problem is driving me mad

Thx in advance

asif_rahman0 wrote:my algo is:

1) find power of 2^(0<i<20)that is smaller than the given number
2) then calculate power of 2^(i-1)
3) then minus this number from given value (eg. n=19 value=19-16=3
so 3*2=6 result is 6)

Hi, what happened when n-2^(i-1)=0??

Hope it helps

asif_rahman0 wrote:my algo is:

1) find power of 2^(0<i<20)that is smaller than the given number
2) then calculate power of 2^(i-1)
3) then minus this number from given value (eg. n=19 value=19-16=3
so 3*2=6 result is 6)

Hi, what happened when n-2^(i-1)=0??

Hope it helps