|
+8
The Key Error makes sense. Thanks! |
|
0
from total permutations, subtract number of wrong permutations |
|
0
Sorry,Didn't know that. But then we had to share code among team members. So.. |
|
0
Can't you make out from his profile(submission history and coding style) who copied whose ? It's pretty clear I guess |
|
0
I sent my code to team mate for testing. :/ |
|
0
Also people look at his previous codes and my previous codes. You will find thye difference, that gooner clearly copied. The codes he submitted are all of my style of coding. :( Also see his submissions for F. each one entirely different from the any other. gooner's_submissions |
|
0
Guys just have a look at gooners submission history, It's not difficult to make out who copied whose I guess. http://codeforces.me/submissions/gooner |
|
0
Can easily be seen gooner has too many skips in his submission http://codeforces.me/submissions/gooner. Admins kindly look into it. |
|
0
Oh shit, This guy got hold of our Ideone public code.What to do now ? |
|
0
Yes we made submissions from one computer only. |
|
-6
No. Was already in a team. Had that been the case it wouldn't have got Accepted in the first place. Also the WAs and TLEs have been skipped :/ |
|
0
read about SCC |
|
0
Div2 B: solved in O(num of digits in n). Did Zlobober way. simple short code. Visualized it as a binary tree. in n, left to right, for each 4 go right and left for 7. |
|
0
ur code is missing lexicographical ordering |
|
0
depends.. global variables are zero initialized as they are static. whereas local variables dont have any default values |
|
0
map<long long, int> m[26]; m[i] stores <sum, num of prefixes ending with char 'i'> |
|
0
I'm trying to solve prob.A with dsu, also used path compression. Even though all test cases must use same amount of mem for my code, got MLE for 22nd case although n=100 http://ideone.com/MUWaHY |