Problem: http://codeforces.net/contest/677/problem/B ↵
The user is doing ↵
rem = a[i]; ↵
while(rem) {if (rem >= k) rem -= k; } ↵
See the image for his code: ↵
http://codeforces.net/predownloaded/0a/2d/0a2d8f1ff5bca1d364d6224513611c725c9a0df2.png ↵
If I set k = 1, and rem = 10^9 Clearly it will timeout, but I was given an unsuccessful hacking attempt. Why?↵
↵
Test case I gave: ↵
1 1000000000 1 ↵
1000000000 ↵
Result-> Unsuccessful ↵
↵
I thought compiler would be doing some optimizations. So turned k to 2. Still it gave unsuccessful hacking attempt.↵
IInd Test case I gave: ↵
1 1000000000 2 ↵
1000000000 ↵
Result-> Unsuccessful ↵
↵
UPD -> His code got TLE after the final system checks. -_- http://codeforces.net/contest/677/submission/18191327↵
↵
This is a great way to suffer a loss of 200 points.
The user is doing ↵
rem = a[i]; ↵
while(rem) {if (rem >= k) rem -= k; } ↵
See the image for his code: ↵
http://codeforces.net/predownloaded/0a/2d/0a2d8f1ff5bca1d364d6224513611c725c9a0df2.png ↵
If I set k = 1, and rem = 10^9 Clearly it will timeout, but I was given an unsuccessful hacking attempt. Why?↵
↵
Test case I gave: ↵
1 1000000000 1 ↵
1000000000 ↵
Result-> Unsuccessful ↵
↵
I thought compiler would be doing some optimizations. So turned k to 2. Still it gave unsuccessful hacking attempt.↵
IInd Test case I gave: ↵
1 1000000000 2 ↵
1000000000 ↵
Result-> Unsuccessful ↵
↵
UPD -> His code got TLE after the final system checks. -_- http://codeforces.net/contest/677/submission/18191327↵
↵
This is a great way to suffer a loss of 200 points.
