UVa OJ Board

Thanks for your answers. Indeed, I meant the problem #11213 (Flipull). And actually I expected the submission times should be different... So, is it correct to say, that if the submission is old, it would be 3/10 faster on the new judge? And regarding old time limits. I am still confused about stati...

I have similar problem with 11218 ("Flipull"). Time limit is 3 seconds, but if you see on statistics -- all existing solutions take more than 3 seconds.
This is very confusing. How to know whether the time limit is OK and there are no problems related to outdated data?

thank you!
My mistake was to modelise the problem with a undirected graph, i changed it to directed and got accepted.

Hi :) I have the ame problem : WA. I use Min-Cost Max-Flow approach. While looking for a negativ cycle with Baellman-Ford algo I take care of the presision errors : [cpp] #define EPS 1e-6 ... if (x->dist[from]+cost+EPS< x->dist[to]) { ... [/cpp] When printing answer I do the same : [cpp] min_cost = ...

Thank you! Your data was very helpfull, I found the bug and got accespted.
It was a some particular interference with previously calculated values...

Can anybody check these input/output. please? Input: 100 8 1.344 0.852 0.269 1.472 3.170 1.329 0.579 2.847 3 0.196 0.009 0.735 7 0.030 3.821 1.368 1.545 5.434 0.934 0.105 3 0.467 0.889 0.461 7 0.744 1.173 1.035 0.354 0.300 1.102 0.708 6 1.419 5.220 1.208 0.714 1.741 8.151 7 0.453 2.879 1.834 3.639 1...

I am wondering about my WA. Can anybody give me the answer for this test case (just for know if the mine is wrong or not) : Some others cases?...

Yes, finaly i realized that my big_int class is too slow in converting the binary numbers into decimals. Must think about fast multiplication algorithm (like Karatsuba) for fast coverting...

Are there any sticky inputs? Because I am tired of Rintime Errors... I tried all possible inputs (b,n) on my machine : no errors (4<=b<=128 && 0<=n<=100) [cpp] int main(void) { int b, n; big_int l[200]; while (1) { cin >> b >> n; if (!b && !n) break; if (n<=0) { cout << "0" << endl; continue; } if (...

I try to solve the "Fibonacci" problem, but i receive a TLE. I think my solution is well optimized and very fast. So i suppose that it may be a problem of input/output, something is wrong... Are you any suggestion about it? [cpp] char b[5001]; big_int f[5001]; big_int a[2][2]; big_int **c; big_int *...

I just change Ed to e and got AC.

In others terms, it must be a letters from 'a' to 'z' in the words that you invent?
And what about the length of these words?

I've just got accepted this problem and I tell you :

"The test data is really very tricky!"

thanks a lot for help, I have got accepted finally - my programme had an error that was not reproduced in my tests, so it was dificult to fix it.

yes, it's a basic idea, but you must also verify if the polygons has the same orientations. It means that you have to consider the angles from 0 to 180 deg as from 180 to 360 if the orientation is different.

my output for 0.123456789... is 10287037/83325000 but I still have a "Wrong Answer" from judge. I have lightly modified my code and now it gives differents answers for some outputs. For example I take this input : 0.74998... 0.53317... 0 and two outputs my program can produce are : 18731/24975 6598/...