Hello Codeforces!
flamestorm, mesanu and I want to invite you to Codeforces Round 964 (Div. 4).
It starts on 06.08.2024 17:35 (Московское время).
The format of the event will be identical to Div. 3 rounds:
- 5-8 tasks;
- ICPC rules with a penalty of 10 minutes for an incorrect submission;
- 12-hour phase of open hacks after the end of the round (hacks do not give additional points)
- after the end of the open hacking phase, all solutions will be tested on the updated set of tests, and the ratings recalculated
- by default, only "trusted" participants are shown in the results table (but the rating will be recalculated for all with initial ratings less than 1400 or you are an unrated participant/newcomer).
Additionally, there might be problems that are interactive, so please read the guide of interactive problems before the contest.
We urge participants whose rating is 1400+ not to register new accounts for the purpose of narcissism but to take part unofficially. Please do not spoil the contest for the official participants.
Only trusted participants of the fourth division will be included in the official standings table. This is a forced measure for combating unsporting behaviour. To qualify as a trusted participant of the fourth division, you must:
- take part in at least five rated rounds (and solve at least one problem in each of them),
- do not have a point of 1400 or higher in the rating.
Regardless of whether you are a trusted participant of the fourth division or not, if your rating is less than 1400 (or you are a newcomer/unrated), then the round will be rated for you.
Many thanks to the testers: Dominater069, Qualified, Vladosiya, qwexd, Gheal, cry, haochenkang.
We suggest reading all of the problems and hope you will find them interesting!
Good Luck!
UPD: Editorial is out!
nice round
Let's see how many 1400+ rated coders will make a new account.
hosh1zora is an alt acc of Caylex, pls ban him.
Caylex — For You
this will be a great round
as a tester, i didn't set anything
hey, im new (2nd contest) so kindly help me out, i solved 4 out of 8 questions, my rating didnt increase yet. Does it take time or is there some other problem. My rating is 380 currently(less than 1400).
As it is explained in the announcement, after the round there is 12 hours long hacking phase, where participants can hack each other's solutions. After that, all solutions will be checked one more time, so rating changes will be visible in about 16-18 hours.
it has been more than 24 hours now, still the rating has not reflected on my account yet. What about you guys?
After the contest there is 12 hours of hacking. After hacking there is system testing (currently been running for > 12 hours now).
Seems like system testing should finish in the next 1-2 hours, after that they need to calculate rating updates. So rating should be updated in the next 12-24 hours.
Participating unofficially :D Have fun yall
first time i participate in a round unofficially, good luck everyone
I understand that feeling! :3 Good luck, m8! Don't listen to haters.
purpose of narcissism, lol
Specialist earning their respect (^_^)b
Masters in almost every round.
Hope to reach expert after this
Top 50 finish it is
What a confidence. Good luck then.
My first round, wooh hooh!!
Btw this is 1400 point round, so can I earn max of 4200 point in 3 games and surpass tourist ?! /j
That's not how it works
That’s not how it works man
Seems like it won't be rated round for you... You need a history of 5 rated rounds already. Paradoxical, but that's how cf works. Compete in 5 div 2 rounds or smth, but first — good luck on this one!
Read the bold line, it is rated for him. There is no sense in making contests (especially Div 4, meant for newbies) unrated becuase they have not participated in any rated contests xD
Got it. That's actually good to know!!! Since I have friends that have 0 to 3 rated rounds in their history...
It is rated for him, the point is that his performance in this round will not affect rating of the other Div. 4 contenders since he won't be on the official placement. This is made for smurfs in newreg accounts to not ruin fair Div.4 contenders' rating
Hope to reach 955 rating after this.
newrate=min(newrate,955);
hope to reach 669 after this
GL everyone, hoping to reach Expert after next contest
no you wont, I bet
I feel like he will (look at his ratings)
He'd need 202 points to make it to Expert :) (stop downvoting justnemat he's just made a mistake)
welp, not expert yet but close enough i guess
Thank you for everyone's effort to hold this contest. Let's go!!
I will be playing Titled tuesday tomorrow, Sorry, I won't be able to participate this time. flamestorm mesanu
what are you doing here ? go prepare for candidates 2026
div. 4 >>>>
Is there any DIv.5 on codefroces ?
After this Div4 round, participate in an upcoming div1 round!
fine?
My second contest... HUrrrrraayyyyyyyyy!!!!!
Good Luck Everyone! (Hoping to reach newbie after this)
is it rated?
only rated for tourist
if your rating is less than 1400 (or you are a newcomer/unrated), then the round will be rated for you.
Hope to reach candidate grandmaster after this contest.
Good luck
how many point i will get if solve all problem ?
if everyone solves all, probably a negative delta
hope to reach pupil in this contest!
hope to reach Specialist in this contest!
hope to solve all problems in this contest!
good luck!
Hope I don't need to leave codeforces after this contest.
I hope, this will be the last rated div4 for me
This will hopefully be my last rated Div4:)
As a tester, this round is very nice :)
what do you mean nice?
Problems are nice!
Maybe the authors are also nice.
No greetings to MikeMirzayanov?
-1000 social credit
-1000 aura
-rep from Mike
I will solve all under an hour!
i visited your profile.. you never solved all problems... speed is only your handle, lmao :)
is it rated for me?
I suppose not
Why not?
Interactive at Div.4? o.O
Is this the first time in Div.4 to have an interactive? If so, I would be really curious to see what it'd turn out.
It is not the first, here is an example: https://mirror.codeforces.com/contest/1807/problem/E
Woah, I actually solved it and didn't even remember. Cool then :D
Hope it's my last div4
Good luck!!
This is the first contest blog I have seen with no thanks to Mike.
if a 1400+ rated, participates with new account
HE IS GAY.
Hope to be Specialist after this contest.
I solve all the problems!
Congratulations bro. Bro will now become specialist!
hope I can participating unofficially next div4 round
interactive problem for newbies and pupils. I think if newbies or pupils who can solve interactive problems, mostly the cheated or it's alt acc
you want to say , in div 4 it only comes a binary search or two pointers and nothing more advanced , because it only rated for pupils and newbies?
Good Luck and Have Fun!
For the ones new to cpp and may not know much about interactive problems and flushing->
You dont have to flush the output when you are using "endl", just dont define endl as "/n" like many(including me do).
"\n" ?
ya my bad, i just use endl so dont remember if it is back or forward slash F
As a non-tester and non-participant, I would like to test future rounds (I never tested any round yet).
As a pariticipant, LaLeii orz
As a participant, DangKhoizzzz orz
chikien2009 hello
hello
Da fuq, i think i cant solve all problem because of interactive problem, i hate this
Queueforces
Queueforces
Inqueueforces
Testing system is so overloaded that my solution exceeded compilation time: 274812981
lol
Yeah, something happened, we will find such submissions and rejudge them
Queueforces..
For ABCD, I spend much more time stuck in 502, 504, 405, etc. than solving problems
Why is cloudflare necessary (Genuinely asking)?
To prevent DDOS Attack. But It defeats the purpose if it actually blocks/delays real user submission.
My first ever AK!! Very nice problems :) especially G2
u obliterated the whole round :)
B>G1
got WA 2 times on B kek
Problem E!
Bro how to do B
check for all 4 ways
bruh thats what i did
submission:274947222
you didn't handle the case where 1 round win and and 1 round draw
https://mirror.codeforces.com/contest/1999/submission/274813505
why this fail?
if(a>c && b>=d)ans++;it can also happen that $$$a = c \ and \ b \ \gt \ d$$$
similarly for other case's
(a,b) and (c,d) | (b,a) and (c,d) | (a,b) and (d,c) | (b,a) and (d,c)...check for all 4 combos if answer comes and print accordingly
Div. 3/4 interactive = $$$O(logN)$$$ with binary or ternary search, classic
At least it can be easily stress tested, which is good
easiest round imo where "hardest" task is low blue.
got the formula for problem F, failed to solve the modulo thing... sadge
Why is Problem G two parts? Is there really a solution for G1 that will not pass for G2?
binary search on a and always take b = 999
I think that they probably intended Binary Search for Subtask 1 and Ternary Search for 2, since log2(1000-2) is about 10, while log3(1000-2) is about 6.
But the ternary search solution would of course also pass for subtask 1.
yeah because log(999) is around 9 with base 2 which satisfies binary search condition for g1
I defaulted to binary search on G1, because I never had to implement ternary search(up until today w/G2).
shitty round for python users
why though? I'm doing python just fine
the pypy compiler gave tle on the same solution where python3.8 worked fine
I just checked out your D, and it's actually your fault that you got TLE.
You keep appending to construct a long string (e.g.
ans+=s[i]), which is slow. Python's string is immutable, which means it will always take $$$O(n)$$$ time to construct a string (where $$$n$$$ is the length of the string). Your code needs $$$O(n^2)$$$ time to run due to this, which is obviously not okay.It's interesting that Python runs faster on this code, though. I guess that it has some optimization (like skipping construction when there's only one reference). But whatever optimization Python has, you should avoid appending a string.
yeah,thanks a lot
but what alternatives should i go for when i have a task like this?
String concatenation is a pretty basic technique -- try to google "build string in python" for in-depth tutorials. In sum, put string fragments into a list and do
''.join(list_of_fragments).Can someone tell why this is throwing compilation error ?
same solution passes now
I got the same issue, the checker says: "Can't compile file: Compilation process timed out.", so I guess the server was just so overloaded that it can't even compile the file lol.
I still don't understand how to solve B. I literally checked every possible case by hand. I don't know what's the right way to feel about this but I am furious.
Maybe u didn't consider when u win 1 round and tie the other (that happened to me)
No I did that, I did everything. I literally considered every possible way the numbers can be arranged relatively on a number line and this WA.
In your code in the if(bl==br) block, u ignore totally al, that part seems wrong to me.
that part was a last ditch attempt at doing whatever to get AC, the code I actually wrote must be my second last WA submission for B.
btw the case when al == bl && ar > br that u insta print 2 is wrong, cause u can have br ==bl and that makes the answer to be 4
Hmm now I get it, I though about this problem of bl and br being equal at the last moment, and as you can see I did something about it in the last moment in my last WA submission for B. But maybe due to crunch of time I left some cases.
Thanks I lot, now I feel good. I saw jiangly's solution anyway. To see what he did is to first observe that there is symmetry in the order of checking winning games. Say we flip a random card from Suneet and Slavic, then the other ones are fixed to be picked on the second round, moreover Those other two cards if picked first would produce the same final score. With this observation we can fix picking a1 first, then whatever I pick from b, I check whether my points are greater than the opponent. we do a1 with b1 and a1 with b2, get the result and multiply the answer with 2, because the case of a2 will conclude in symmetric final results.
Also, changed the line you pointed out and it's working. 274963920
Why didn't authors announce the 10 mins extend earlier???
I was about to get E right, then I saw 30 seconds left and gave up. Later on I came back and saw the announcement that the round had been extended for 10 mins.
Trolled in B and with the infinity queue took 40 min to fix the error xDn't
For D, I got WA on test case 1, but it worked just fine in my local compiler and online compilers
Lost multiple submissions, also each submission took too long to compile. Had to change same logic in python and it got accepted.
Couldn't find the reason, can you guys spot it? https://mirror.codeforces.com/contest/1999/submission/274845944
It looks like there's a small mistake on your for loop statement:
The
j--should be changed toj++. Decreasing $$$j$$$ in the condition will result in an infinite loop or unexpected behavior since $$$j$$$ will never reachs.size(). Correcting this toj++should resolve the issue and give you Accepted.Why this code is giving TLE in problem E.1999E - Triple Operations
there is no restriction on l and r. So your code could iterate for 2e5 times for each testcase if all testcases have l=1 and r=2e5.
Is this really the reason? I have a similar submission that passes but loops through l -> r:
274871369
You are correct. I tried to hack your solution but looks like your solution is could also have been tle had you used unnecessary local variables inside loop, instead of directly reading values from SOL array like you are doing now.
You are looping from a to b for every test case. Imagine if there is 10000 test cases, each has a=1 and b=200000. Then you will TLE.
there is no limit over the sum of l or r over all tests. Therefore, iterating from l to r is not viable for big number of tests. Try with prefixsum
mathforces
Can someone explain how this is TLE:
https://mirror.codeforces.com/contest/1999/submission/274946145
let n be 2*10^5, where l and r are <=n
the while loop is log3n and the for loop is constant operations in O(N) time as well
You are looping from l to r for every test case. Imagine if there is 10000 test cases, each has a=1 and b=200000. Then you will TLE.
ur complexity is t*n_max, which will give TLE
Tanked 5 TLEs on E because I calculated the prefix array in the solve() function :( Also couldn't figure out why I got WA for G2 test 2
How did so many people solved D?
E was just algebra and prefix sums
I solved E greedy no algebra involved
yeah just precompute the logs, that's what tricked me to tle
D is completely based on a pretty common idea, that finding string as a substring in another string is successful iff it's successful greedily.
Hmm, quite easy div4, compare to the last 2 recent div4 rounds.
DuongNeverAlone orz. I've failed problem F since I don't know how to handle the modulo formula stuff. Else it's gonna be a blast for sure compared to recent div4 rounds
i used modular inverse and binominal coeff formula
Hi can you tell me what is wrong with my code in problem F it's run time error at first I wrote my own ncr and fast power but after stuck with the run time eror I copied one from the internet but still run time error there is a big mistake but I can't see it https://mirror.codeforces.com/contest/1999/submission/274946181 it would have been my first time to solve till F
You missed the new line after printing LOL.
still there is run time error the last case is giving different answer every time I compile it
The fact array is 200003 in length, but you iterate to 200009
ll fact[200003];i<200009also you are not printing new line in each test case
I just fixed them and got WA on test 3
what if K > N you didn't handle that
For modular issue (especially modular inverse), it has been one year since I implemented those things last time. After using the Modular class (actually I copy from tourist, but with some modifications), I could handle those modular operations with ease. I recommend to take a look at it.
sure, I think I will also copy python class from better players in the contest. Have to take the hit for the experience tho. (But not sure if this will be marked as plagiarism)
especially Div4G. But it does serve as a good intro to interactives.
Best of luck everyone
The waiting queue is fucking long
Any specific reason behind these very long wait queues in div3/4 contests? In my case today one submission took >15 minutes to resolve?
Too much participants, that's it.
Just got an observation for E:
[1, 3) -> all elements require 1 operations to become 0
[3, 9) -> all elements require 2 operations to become 0
[9, 27) -> all elements require 3 operations to become 0
[27, 81) -> all elements require 4 operations to become 0
[81, 81 * 3) -> all elements require 5 operations to become 0
and so on.
I think this could be optimal.
Yes u can see my solution I solve it using this observation
Please explain why this doesn't work in problem B (says expected 4, found 0 on 101st test case): https://mirror.codeforces.com/contest/1999/submission/274897075
you're only considering when u win the 2 rounds, but it also can happen that u win 1 round and tie the other, u must include if(a>c && b==d)ans++ , and the others combinations of that.
you can draw in one round and win in the second. which makes you win overall
why i got wa in 2nd test case.. 101st "wrong answer 101st numbers differ — expected: '4', found: '2'"
here's my solution: My B solution
can anyone explain, please???
mayb its because you are not considering the a==c and b==d and a==d and b==c etc. these cases
in these cases Suneet loses the round , right? but only considers those cases in which suneet wins i.e; (a>c && b>d),(a>d && b>c),(b>d && a>c),(b>c && a>d)
interactive problems are SHIT
I think they are fun :)
Struggled solving F for over an hour with multiple submissions failing at testcase 16+ because of mod (made me sad especially after I seeing that G was just ternary search :( Otherways very nice contest
on paper this gives best answer but why it fails on test cases ? `
** **~~~~~int fun(ll x){int count = 0;while(x){count++;x = x/3;}return count;}`** **void solve() {** **ll l, r;** **cin >> l >> r;** **ll ans = 0;** **ans += fun(3*l);** **for(int i = l+1; i <= r; i++){** **ans += fun(i);** **}** **cout << ans << endl;** **}```` ~~~~~The only problem with the logic is when you increas ans by fun(3*l) instead of 2 * fun(l). For example if l = 9 we would want to reduce the 9 to 0 first. To do that we would have fun(9) = 3 operations but simultaneously another number would be multiplied by 3 two times. And to reduce it to its original value we would again need fun(9) = 3 operations. That's why ans has to be 2 * fun(l).
Also your code will hit TLE since you always recalculate fun(x). Instead of that you could precompute all of the needed values. I did it like this:
oh thanksss man
how this solution have passed flamestorm
I am getting
Idleness limit exceeded, How can this be fixed?274961116
? a b — in response, we will measure the side lengths of an (a * b) rectangle
I think you implemented the binary search wrong, so that it doesn't halt. instead of setting l/r to x you need to set it to l+1 or r-1 and also instead of checking wether r-l > 1, you need to check wether l is smaller or equal to r.
Let me know if this works!
Remove this line
#define endl "\n"Ah no, actually your query is wrong, you need to cout 2 values
lowkey B is the hardest problem here.
How some brute force solutions passes in problem E ?
Was a good round!
Just virtual'd this contest, nice query limit at G2! It's so strict that even a minor suboptimal tactic resulted in a wrong answer, and for educational purposes I really endorsed it!
div5??hhhh
I haven't participated since the last year, and I was hoping to got this round rated... :( Isn't there any way to have this as a rated one. At the morning I was a contestant and now it seems to be a practice round. I don't know how many points do I deserve
System testing is running,in a few hours rating will be updated
well, system testing is taking forever and probably won't be done for a few more hours. So ratings probably updated tomorrow
G1 and G2 were quite interesting learned about Ternary search.
Waited 27mins in queue for G1 just to get compile error :)
Hi Everyone
For Problem E ( E. Triple Operations) , I precomputed all the values using log_base_3 , but somehow it's giving incorrect result for 243 and 59049 , to pass the test cases i had to hard code the result , can anyone please help me here , why it's giving incorrect result.
For log values calculation i realized that precision values depend on the gcc compiler weird
Here is my submission — https://mirror.codeforces.com/contest/1999/submission/274923066
Check this and this comment.
As far as we're concerned, we only care about the integer floor of the log, and the numbers to get logarithm from isn't too huge, so we could actually bruteforce the log3 by continuously dividing the number by 3 until it reaches 0. TL;DR try to avoid floating point arithmetic as much as possible to escape precision issues.
I use continuously dividing method and get TLE
Precalculate your logs and call them when needed.
It was one of the best round I ever seen. Thank you !
Help!!! All of my race records have disappeared!!!! WHY!???
System testing is in progress, be patient.
This might be the longest system testing ever,will go on for more than 10+ hrs.
good contest:)
How much longer do we need to wait for ratings update? And how do y'all get to know when system testings are going on?
go to the main contest page, where the problems are listed and on the right it will show the system testing progress.
looks like it will take another 1-2 hours, ratings will probably take 12-24 hours after that.
I have one question ?
Are all Interactive Problems are Solved By Binary Search or Ternary Search
No
No
Nice round! I've become Specialist after this contest!
The appearance of this blog is to appeal the CF official sentence for my 1999F code。
Attention!
Your solution 274818573 for the problem 1999F significantly coincides with solutions daoqi/274818573, Haz_Begonia/274828630. Such a coincidence is a clear rules violation. Note that unintentional leakage is also a violation. For example, do not use ideone.com with the default settings (public access to your code). If you have conclusive evidence that a coincidence has occurred due to the use of a common source published before the competition, write a comment to post about the round with all the details. More information can be found at http://mirror.codeforces.com/blog/entry/8790. Such violation of the rules may be the reason for blocking your account or other penalties. In case of repeated violations, your account may be blocked.
【Codeforces Round 964 (Div. 4)AK实录】
https://www.bilibili.com/video/BV17iameiEN8?vd_source=958d8670804c24a04935dc3755fc300aBecause I happened to be recording this game, you can see that the code for my F was written by myself。
Appeal against the incorrect skipped verdict of my Problem D submission
Greetings!
I want to appeal against the cheating verdict received for my submission of problem D of this round. I received the skipped verdict for this submission. I haven't copied this code from any public source, and I have completely written it. The logic for this code is pretty simple greedy approach and I believe that's the reason of the coincidental match with others solutions. I promise you to take a look at the rest of my submissions for this contest, combined with the submission. linked above will prove my innocence. Below are a few submissions, with whom my submission is claimed to coincide: anekdot/274758762, DevNorms/274768558, kvasilek/274772612, el_lobia/274776109, krizsu/274779701, long_off_long_off_sky/274781618, romtec/274784433, drgrenkenstein/274785579, Sino_2009/274792605, neheka9385/274792761, .Miraitowa./274794390,
MikeMirzayanov
MikeMirzayanov This comment is an appeal against the plagiarism verdict on my 274805223 for problem 1999D - Slavic's Exam.
I want to make it clear that I wrote the code entirely by myself and didn’t copy it from anywhere or use any external code.
The solution code is pretty short—only 10-15 lines (in the solve fucntion)—and the logic is straightforward. I used some trivial/common variable names, which might explain the similarity with other submissions. But honestly, it’s just a coincidence.
Please take a look at my other submissions in this contest too. 274850363, 274783573, 274754028, 274713747. I think you’ll see a consistent approach and the same use of debug template in all of the submissions. Even in this particular submission I have used multiple debug statements in the solution which proves my innocence. If I had copied the code, there was no need for me to go through the debug process while solving the problem, this shows my code is original.
This is the first time I’ve had this issue, and I’m confident it’s just a misunderstanding. I appreciate you looking into it.
.
Hey!
I got plaged in this round at problem D. I don't know how. I use to give Claude AI my codes to rewrite it and make it not readable but keep the logic same. I use to do this after my solution was hacked by someone a while ago. My friend suggested to make the code less readable. But I can't be plaged for that. Since the code for this problem was very short it matched with some other guy. But please look closely at this code.
MY UPLOADED CODE is (that was rewritten by claude) — this
MY ORIGINAL CODE is — this
I was asked to post comment here to help me with my plag. Can someone please help me with this?
.
I am writing this comment to appeal for a wrongful accusation of cheating on me. I got an email last night that my solution 274819760 for 1999D - Slavic's Exam matches many other users'(whom I don't even know).
I assure you that all of my code was written in VS Code. I don't use any online compilers. This is the first time I'm getting this type of warning. I suppose my solution got flagged because of replacing the '?' with any lowercase letter, most people will first think of 'a' or 'z'. Also, the logic of this code is pretty trivial and straightforward, so there is a high chance that many other contestants used similar logic. The similarities are purely coincidental. The other submissions that I was accused of copying from were also not very similar to my code. I also wrote a redundant recursion function and a bunch of other redundant lines of code which were not needed that I forgot to remove while I was looking for an approach to solve the problem and debugging which proves my innocence.
I request you to look into my case and do not penalize me for any mistake of which I am not guilty of. I’m happy to provide any additional information that might help clarify the situation. Thank you for your understanding.
Here's the mail which I got:
Attention! Your solution 274819760 for the problem 1999D significantly coincides with solutions anekdot/274758762, DevNorms/274768558, kvasilek/274772612, el_lobia/274776109, krizsu/274779701, long_off_long_off_sky/274781618, romtec/274784433, drgrenkenstein/274785579, Sino_2009/274792605, neheka9385/274792761, .Miraitowa./274794390, chaluubilla/274795246, resplendent_galaxy/274796918, siddarth.maram/274797027, ADS-BOT/274797061, harshitayadavv/274798028, stardustlove/274798402, cc_2024/274801399, misha.barantsev/274802880, Pranit_narayan/274803039, Way.To.Cp.01/274803501, Light_1419/274805223, omtripathi7096/274805428, ishan_jain_023/274810463, Eyad_Hazem/274813099, Freedom_/274813350, secretxcoder/274814473, manaswi28/274816693, pheonix299/274816762, sury666/274819760, Sanchit_g25/274820432, Puneeth254/274823101, nitesh0017/274823175, Ayus_code/274823296, akhilAgrawal/274823401, aarushi620/274824144, zuperduper/274824283, gt99/274826746, himeshgoyal08/274826896, RahulS2003/274827060, LuckyYu/274827395, shre6745/274828043, Tanishqdublish/274828498, kunalb7625/274829562, vg1005/274832540, Goat_Atta/274833702, One_piece_is_real_26/274833977, mohamedhaggag9225/274834426, PranavKS/274834532, perspective_/274836235, sat_sak/274836580, 123456abcd/274836694, avacado7/274836952, subho86/274837436, Introl/274837793, singhankitkumar439/274839534, kxprem29/274841429, ahmed-07/274841757, Prakash1323/274841813, valiant_cp/274843326, rkcrj100/274845821, codewizard_17/274845941, Sanan_Sadichov/274846391, bpcper/274847343, iiiaaabbuuu/274847421, recipr0cal/274847738, MasterHecker/274848006, Dawn_Coder/274849687, Zainic/274850279, Low_Rating/274850441, prnvnrp/274852567, aditya16213/274855292, cat-ion/274857406, Adityakgpian01/274857684, Tea314/274858892, noobin/274859801, valak_5701/274860253, CKC/274860874, Deepak-singh/274861140, Nabhendu_Jana/274861304, Big_Cock_King22/274861478, bedosafan957/274861612, ankit.pandey99p/274861789, aya_B/274861829, koustav_2004/274862652, Manual_Ibrahim/274862666, kisaniyavishwas/274862668, offx.kshitij/274862770, Brainystorm35/274862812, Koushik07/274862940, aniket_deore/274863060, omnavneet/274863196, viteshreddy.l22/274863243, shadow_monarch_10/274864119, medha.bhutani/274864145, 22_Youssef_19/274864256, yeohhanyi/274864474, mixcreed/274865250, Arpit_Mishra23/274865444, escanor12/274865668, shovonisnewbie/274866006, rito_99/274866087, pitomghosh27/274866302, necromancer369/274866413, arshia89/274866854, solankinilam42/274866974, Aurko2003097/274867122, devsourav085/274867690, Jashanpreet1096/274867917, Mohamed_Galal72/274868119, unknown007585/274868146, tiwaridevesh444/274868235, chaserxJ/274868344, RJ1412/274868382, AyushPchavan/274868387, fsocity/274868391, chirag3102/274868841, Prashant_Pal_http/274868931, Rohit420/274868962, Aadhavan27/274868991, iftekhar98.kaif/274869191, 7ODA163/274869417, Abdalrahman-khairy/274869460, DarkPaul/274869745, nirantchaudhary/274870165, kshant21/274870437, abhishekbiyani08/274870462, sultanahmad/274870620, Elite_Falcon/274870895, ayushupadhyay0606/274871356, sachin_pec/274871400, PeskyBird/274872047, mo.sayed/274872189, Problem-killer/274872202, 6cat/274872230, satyendra_s/274872371, aditya_kunwar/274872425, Hany_Osama/274872915, 22h51a6649/274873147, dhirajyadav19118186/274873284, Paconnie/274873412, veritaseum/274873449, opcoder_0521/274874122, invincible0206/274874212, tanishmajumdar34/274874326, maykkkk/274874361, megu_99/274874398, ishrak0hasin/274874592, SojibSD/274874662, amankumar1210/274874902, donkeycode19/274874965, atishayjain27272003/274874992, aman_raj_7/274876316, gyash9878/274876683, suplex_city/274876885, ribhavsingla/274876977, yash_gahlot/274877317, v17ar/274877606, Dark_Knight36/274877777, 0khaled0/274878045, aryanlps9/274878215, abhishekleo_/274878957, musharraf__786/274879496, hadymo7med/274879563, pookiebearprincess/274879645, syam_praneeth/274879719, sskumarsi/274879772, nguyenphuc2789/274879890, ps.75/274879929, S_Arman10/274880030, Adi_tya_28/274880157, aksharvaishnav36/274880453, AyushSharma/274880462, sk.tanvir/274880563, Enthusiast_5/274880749, Swayam_18/274881091, bansaludhav3396/274881118, ksukshavasi/274881219, NguyenPhuocHuuDung/274881629, Tahi_/274882022, cyberhitman01/274882084, Titan493ASST/274882177, hardikbhadoria2004/274882341, AtomicFire/274882402, T_saha11/274882508, king0203/274882626, VISHNUMADHANI/274882671, rinku_57/274883375, tejaramjanee/274883739, Seraphic/274883905, nalin168/274884121, Datpth/274884152, sk_07singh/274884261, sattusmile/274884710, riteshkumar332003/274884924, Aditya_khade/274885771, the_MiNazz/274885800, valor_knight/274886403, sharmaankit9089/274886467, ayushiiiawasthi7/274886613, TheElvenKing/274886990, n.vantien/274887069, SakethramCS06/274887100, pranav_27/274887130, m.viss2010/274887206, an_G/274887534, NanoNinja18/274887692, ManyaJain/274887769, eliya21/274887821, devcormac101/274887875, adeodatusv18/274888032, phitron_01/274888176, chiragrai/274888312, ALCHEMIST_NG/274888750, Ankit-2719/274888903, Conqueror27/274889401, Rarma/274889445, adishwar/274889582, cuhpmiiH/274889773, 22501a1230/274890087, sangam.2510/274890131, dhruvi_patel/274890351, abhishek-403/274891224, honestcheater08/274891476, priyanshu1708/274891630, LONY_CODE/274891691, ChandaK_ChaKma/274891989, FirstException/274892009, IamRomi/274892477, rudrauwu/274892970, dank_host/274893340, VladX100/274893668, Arnav0806/274893888, namrapatel/274894065, Safwatnusrat/274894437, 22501a1238/274894485, Hvshah-2005/274894536, jack69/274894621, Sreya21st/274894683, ninja_987/274894855, Haya_ahm08/274895278, baishakhmahfiz/274895589, Anishh_/274895893, sharmaranjan816/274896195, ayush.trp/274896493, aryshende/274896795, Nilanshu_Ranjan_101/274896928, farhadnuri_63/274897843, Hasitha03/274898003, Achyut_Dave/274898015, aniket_748/274898037, raghavjindal17/274898500, Himanshuhere/274899113, prashu_sh/274899167, shivansh_sri/274899691, mohamed7_4/274900183, sssshivamm/274900442, diego_delarocha/274901011, ayushmehra2112/274901439, anvesh_32/274901932, rahmaaref/274901950, anonymouschill/274902350, hamster7/274902713, stasrass/274903151, shashankk04/274903865, bhashitm2/274904044, niraj00.7/274904214, Code_Master001/274904260, Abir2007049/274904783, rohi.har/274905032, MAYUR96/274905282, aryan.12a17/274906313, akankshayadav9975/274906426, nikpopo68/274906463, ASHWANIGHANGHAS/274906825, nooncode/274906970, omkumavat/274907037, atreyabordoloi/274907098, New_Coder1303/274907687, aurora8/274907990, saeed_ahmad_chughtai_12/274908159, anurag1517/274909332, Shashank_Daduria/274909377, Piyush_Sagatani/274910221, mariaashraf2004/274910306, Harsh_Dhoke/274910716, anurag_wande/274911079, mayankahuja1718/274911092, sinha.sakshi47/274911101, saumyaa_100/274911226, KrakenX3/274911390, himelrahman5293/274911716, Khushi_pal/274912179, Ray_0906/274912352, Poco_le/274912971, 1404ashwani/274913561, Dhyey01/274913977, Sonal99/274914013, yahiamoussadek1/274914030, SN2809/274914198, dwngng16012009/274914271, ramnagendra_1103/274914693, G_C_/274914714, yuvakiran99/274915128, M7RX/274915222, Aditya./274915942, perrar/274916624, dhruvsharma7016/274916715, JjaAZzz/274917346, trishna_10/274917920, alphakunj/274917955, 214g1a0539/274918452, Moyogi/274918543, Harshika535/274918717, Code_Vats/274919880, Akhila_Nidumolu/274920549, ishraqb0i/274920570, go_to_my_own_company/274920759, ahmed_555/274920842, YubarajBose/274920993, ashikur498/274921416, piyush1120/274921860, varunmadnawat/274921926, aryan3/274922032, Indigo_wyy/274922168, himanshuranjandixit/274922452, durjoy6405/274923029, Judas/274923032, Pradhyumn28/274923380, Qode_breaker/274923570, Sumit_1006/274923646, Sneaky_angel/274924157, rrb_01/274925133, Vermin45/274925319, vipul_lakum/274925775, J.Rakib/274926066, blaze_hombre/274926362, Shubh_29/274926702, EluruSaiVenkat/274927365, imacoderboi/274927726, assmaa.qa/274928158, AnkitSingh_19/274928415, saurav_3062/274929591, anxious_bug/274930324, manojvarma/274931404, sofikulsk_02/274933601, coder_1502/274934608, abhishekp_iitj/274935155, Naitik7838/274937216, TheByte/274937900, Poojan_B/274938087, King_Satan/274938521, k.run007/274939024, ajaythakurr/274939151, raman_of_the_sky/274939411, Sat-Y-am/274939940, harishverma22/274940106, Ojasss/274941656, suvam_18/274941969, raj_mishra__98/274942810, vishal1620/274944410, mridul2597/274945340, Kirty/274945565, edith77/274946896, mohantyanurag2004/274947367, Biba2003/274947663, Satyendra_9580/274947993, hecker_baba0960/274948541, HALZOOM/274948670, xwz_abhii27/274949928, EngineerAnish/274950147, TEKNAS2005/274951090. Such a coincidence is a clear rules violation. Note that unintentional leakage is also a violation. For example, do not use ideone.com with the default settings (public access to your code). If you have conclusive evidence that a coincidence has occurred due to the use of a common source published before the competition, write a comment to post about the round with all the details. More information can be found at http://mirror.codeforces.com/blog/entry/8790. Such violation of the rules may be the reason for blocking your account or other penalties. In case of repeated violations, your account may be blocked.