Auto comment: topic has been updated by yashgulani (previous revision, new revision, compare).

Auto comment: topic has been updated by yashgulani (previous revision, new revision, compare).

I am getting wrong on 4rth test case of F problem Please help if anyone knows the problem here is my code for the same

http://mirror.codeforces.com/contest/1066/submission/44486589

Thanks in advance

In D problem even the custom invocation is showing possible but the test case 18 is giving Impossibe for my code Please check out this solution http://mirror.codeforces.com/contest/1009/submission/40348587

Same Code gets submitted after ccontest http://mirror.codeforces.com/contest/1009/submission/40350442

OOps figured out n*(n-1) crossed int limit

And with this update i lost my motivation to get into div1

Thanks bro!!

This was one of the best and most interesting contests on codeforces that i have given. So much of hacks and good difficulty distribution i should say ,awesome GreenGrape

CHanging 1LL << 60 to (ll)1<<60 solution is getting accepted yyy??

Auto comment: topic has been updated by yashgulani (previous revision, new revision, compare).

then u can solve with hashing .... it will not cause tle

It doesn't matter if you take k as float or int, if you typecast the expressions involved in comparison to float..