### DarthKnight's blog

By DarthKnight, history, 4 years ago, ,

Hello Codeforces.

I'm honored to announce you, that Codeforces round #326 is gonna take place soon on Codeforces.

Writers are AmirMohammad Dehghan(PrinceOfPersia) and Ali Haghani(Haghani). There will be 6 problems in each division(4 problems are common) and you'll have 2 and a half hour to solve them. I hope you enjoy the problems.

I wanna thank Maxim Akhmedov(Zlobober) for his great helps in preparing this round, MikeMirzayanov for wonderful platforms of Codeforce and Polygon, Delinur for translating problem statements into Russian and MohammadReza Maleki(mruxim) and Ali Bahjati(AliB) for their great advices (and AliB again for some graphics).

This is my third round on Codeforces and not the last one, I hope.

This is the last round on Codeforces with Zlobober as coordinator. It was nice working with him. We had a lot of fun and interesting contests during his coordination. I just wanna say: Thank you Maxim for all your contribution to CodeForces community and good luck in the future. After I heard these news, my first guess for the next coordinator was I_love_Tanya_Romanova; But I don't know if CodeForces hires people from out of Russia or not.

The main character of this round is Duff, but you'll also have to help her friend, Malek!

I wish you all high ratings and lots of joy.

Scoring will be posted soon.

GL & HF!

Problems are sorted by the expected difficulty, but we strictly recommend you to read all the problems.

UPD: Scoring is: 750-1000-1500-2000-2500-3000 in Div.2 and 500-1000-1500-2000-2750-2750 in Div.1 .

UPD1: Editorial is published.

UPD2: System test is over. Congratulations to all winners.

Div.1 Winners are:

Div.2 Winners are:

Also congratulations to izrak, the only one who solved problem Div.1 D.

•
• +721
•

 » 4 years ago, # | ← Rev. 3 →   -116 .
 » 4 years ago, # |   +123
•  » » 4 years ago, # ^ |   -28 Came from gym... tired... was really afraid to be late on this round...Gym makes my body better and Codeforces makes my brain better!Really hard week but I'm marchin on to become better & better...Vote up if you agree that SPORT and PROGRAMMING are really good compatible!!
•  » » » 4 years ago, # ^ |   +21 Now I believed it's Instagram not Codeforces... :/
•  » » » » 4 years ago, # ^ |   0 I've just wanted to share the best part of my life with you guys, to inspire new achievements...Is it bad desire or what?? :(((
•  » » » 4 years ago, # ^ |   -14 If you DO NOT agree please DO NOT vote down, I'm loosing my contribution :((
• »
»
»
»
4 years ago, # ^ |
-9

Lol. Guess you don't like the "bad boy" image :p

# let's keep it that way

 » 4 years ago, # |   -84 THIRD
 » 4 years ago, # | ← Rev. 4 →   -210
•  » » 4 years ago, # ^ |   -34 what does it mean? Zlobober is still alive ;)
•  » » » 4 years ago, # ^ |   -24 Sorry, wrong word.
•  » » » » 4 years ago, # ^ |   -6 Its cool now :D
•  » » 4 years ago, # ^ |   +21 Damn. I've been laughing at "R.I.P" for about an hour now, and I feel bad for it xD. Anyways thank you Zlobober! :D
 » 4 years ago, # |   +3 Mother of math contest is coming :v will miss you Zlobober :(
 » 4 years ago, # |   +116 Your first guess seems to be wrong :)Looking forward to an interesting contest) And I'm also curious about next coordinator)
•  » » 4 years ago, # ^ |   +46 I heard some people say it's Endagorion.
•  » » » 4 years ago, # ^ |   +27 It sounds good to me too. However, take a look at this comment.
•  » » 4 years ago, # ^ |   +67 when the entire Codeforces loves you but you love Tanya Romanova :(
•  » » 4 years ago, # ^ |   -10 This isn't math contest? -_- I am feed up
 » 4 years ago, # |   -50 How can purple user prepare Div.1 round??It seems a bit nonsense like grey user preparing Div.2 round...
•  » » 4 years ago, # ^ |   +7 even red users have difficulty of PrinceOfPersia problems, and u asking if he deserves to prepare round ?
•  » » 4 years ago, # ^ | ← Rev. 3 →   0 because he is a great coder and Mr Haghani is a legendit would be awesome contest, just enjoy the contest!
 » 4 years ago, # |   +13 I want to thank Maxim on fantastic work and good contests. I was prepared one round with this great guy and I hope we will meet again :)
 » 4 years ago, # |   +5
 » 4 years ago, # |   0 GOOD JOB, Zlobober!!!!
 » 4 years ago, # | ← Rev. 2 →   +46 very good character ;) hope she dislike math :|
•  » » 4 years ago, # ^ |   +32 I guess she likes data structures
•  » » » 4 years ago, # ^ |   -28
•  » » » » 4 years ago, # ^ | ← Rev. 2 →   -12 PrinceOfPersia hates algorithms !!!! how come :DYou dont see his awesome blogs Algorithm Gym and others discussing data structures and segment tree, do you?!
•  » » » 4 years ago, # ^ |   +7 She likes the D. (data structures :))
•  » » » » 4 years ago, # ^ |   -34 You're asking for downvotes dude.
•  » » » » » 4 years ago, # ^ |   -29 I know :D but getting downvotes is more fun than getting upvotes xD
•  » » » » » » 4 years ago, # ^ |   -14 Thats right baby :*
•  » » 4 years ago, # ^ |   +41 i think if she doesn't like math , she will ask u to help her in math problems :D
•  » » 4 years ago, # ^ |   0 Wow !!! Math is nice than bruteforce...
 » 4 years ago, # | ← Rev. 2 →   +19 codeforces bug ??
•  » » 4 years ago, # ^ |   0 Check it now once again ;)
•  » » » 4 years ago, # ^ |   0 no change !
•  » » » » 4 years ago, # ^ |   +2 In my page it shows 154 in Contribution :/
•  » » 4 years ago, # ^ |   0 cookie ... :)
 » 4 years ago, # |   +16 I'll be specialist this contest :(
•  » » 4 years ago, # ^ |   0 But your prediction was wrong. Congrats!
 » 4 years ago, # |   +3 And i had already got used to seeing Zlobber on each round publication. Oh Well!!!Missed Gerald. Will also miss you Maxim. Even though some people(me included) might not comprehend the amount of work required to be coordinator, we can all agree that you did a great job.Thank you once again
 » 4 years ago, # |   0 HackerRank HourRank1 and Codeforces round 326. Tomorrow is gonna be fun!
•  » » 4 years ago, # ^ | ← Rev. 2 →   +16 Look at my day : school, test from Algebra HourRank 1 — my third competition as problemsetter :) Codeforces round 326 Learing logic and prolog for test in Friday And yes, I missed today TCO SRM — sorry Errichto, my dear friend. School was sabotaging me :(
•  » » » 4 years ago, # ^ |   -44 Сменку не забудь))))
•  » » » » 4 years ago, # ^ |   +5 It's the worst idea to write message in Russian, in English blog.
•  » » » 4 years ago, # ^ |   0 Tough day. I forgive you then.
 » 4 years ago, # |   +32 Who is this "Duff"? :/
•  » » 4 years ago, # ^ |   +55 :|
•  » » » 4 years ago, # ^ |   -53 so sexy... so sexy...
•  » » » 4 years ago, # ^ |   +36 Lucky "Malek" :)
•  » » 4 years ago, # ^ |   -6 why It must be a special person ?
•  » » 4 years ago, # ^ |   -7 It's Duff beer dude!!! ;)
•  » » 4 years ago, # ^ |   +10 Designated Ugly Fat Friend
•  » » » 4 years ago, # ^ |   +55 FYI, in Iran we call hot chicks "Duff" ;)
•  » » » » 4 years ago, # ^ |   -13 So what do you think about daff?
•  » » 4 years ago, # ^ | ← Rev. 2 →   -22 Maybe Hilary Erhard Duff
•  » » » 4 years ago, # ^ |   +78 With all these pictures, it feels more like Instagram than Codeforces :|
•  » » » » 4 years ago, # ^ |   -6
•  » » » » 4 years ago, # ^ |   +4 Next time better let all the characters be male
 » 4 years ago, # |   +6 Just iranian's know the meaning of duff ;)
•  » » 4 years ago, # ^ |   +10 But now anyone knows...We should punish PrinceOfPersia that told them our secret :D
•  » » » 4 years ago, # ^ | ← Rev. 5 →   0 .
 » 4 years ago, # |   -12 Good luck to everybody.
 » 4 years ago, # |   0 Hi I really become glad when see that Iranian Coders prepare a round:) But i have a sugestion for you princeofpersia, Please prepare persian version of problems for iranian coders. Ty hf with The Duff :) :P
•  » » 4 years ago, # ^ | ← Rev. 3 →   0 I think one of the reasons Cozezilla was built by princeofpersia is the purpose which you stated, but unfortunately I have no info that why after the first contest the site went a little down till now..
•  » » » 4 years ago, # ^ |   +1 No, my meant was we can see problems in persian language version in this site (http://codeforces.com)
 » 4 years ago, # |   0 I 'm waiting timer :)
 » 4 years ago, # |   +51  00:30 start time (local time) + 0:10 expected delay + 2:30 contest + 0:30 system test + 0:30 rating changes = 04:10 sleep time 
•  » » 4 years ago, # ^ |   +41 + 1:30 system test
 » 4 years ago, # |   +11 I suspect that there are many hacks in today's contest good luck everyone!!!
•  » » 4 years ago, # ^ |   +6 I agree with you, because it's PrinceOfPersia's contest
 » 4 years ago, # |   +14 wish a duff contest too. :D
 » 4 years ago, # |   0 Thank you !
 » 4 years ago, # |   +4 Congrats! :D You're now first in top contributors list.
•  » » 4 years ago, # ^ |   +5 And also congrats for your gold medal of iranian national olympiad in informatics.
 » 4 years ago, # |   +31 Dear dynamic scoreI hate you
 » 4 years ago, # |   -8 Ready for Contest...I am coming
•  » » 4 years ago, # ^ |   -20 Whats that equation in Prob D(Div-II)
 » 4 years ago, # |   -19 Duffy...plz don't sit on ur duffDuffy..Duffy..Duff :-p
 » 4 years ago, # |   -21 Have I opened CF or Instagram :/
•  » » 4 years ago, # ^ |   +8 You have opened PrinceOfPersia's blog. :)
 » 4 years ago, # |   -9 Good_luck everyone!!!
 » 4 years ago, # | ← Rev. 2 →   0 Isn't it late enaugh to post scoring?
 » 4 years ago, # |   +1 "Problems are sorted by the expected difficulty, but we strictly recommend you to read all the problems."Famous statement. I smell a rat!!!
 » 4 years ago, # |   0 Auto comment: topic has been updated by PrinceOfPersia (previous revision, new revision, compare).
 » 4 years ago, # |   +5 no delay until now!thanks god! i wish it continues!
 » 4 years ago, # |   0 Did 6 problem rounds become standard ?
 » 4 years ago, # |   0 CF round 326 Good luck to everyone!!! 3*2=6 :)
 » 4 years ago, # |   0 Here comes the 10 minute delay :D
•  » » 4 years ago, # ^ |   +125 Not in my round buddy ;)
•  » » » 4 years ago, # ^ |   0 thanks for a great contest :)
 » 4 years ago, # |   0 In problem C, if I have subsequences (1.2.3),should I connect 1 and 3 after erasing 2.
 » 4 years ago, # |   +156 So satisfying!
•  » » 4 years ago, # ^ |   +2 awesome revenge :D
•  » » 4 years ago, # ^ |   0 revenge :D
•  » » 4 years ago, # ^ |   +22
 » 4 years ago, # |   +73 That's why, when he saw her minister, Malek, free, she gave her a sequence consisting of n non-negative integers, a1, a2, ..., an and asked him to perform q queries for her on this sequence. What is this gender-fluidity? I'm going to make a round about amoebas and randomly change gender pronouns throughout the statements!
 » 4 years ago, # |   +3 Seems like Div. 2 C is going to be one of the most hacked problems in Codeforces history...
•  » » 4 years ago, # ^ | ← Rev. 3 →   0 It also happened to me :[ I am sorry but is it possible for others to hack my solution after I locked it immediately ? In the case the answer is no, how could this happen that after 20 mins of locking the problem, 2 people just hacked it?
•  » » » 4 years ago, # ^ |   0 Locking your solution doesn't protect it from hacking. It just gives you the ability to hack other people's codes.
•  » » » » 4 years ago, # ^ |   0 So how can I prevent it from getting hacked ?
•  » » » » » 4 years ago, # ^ |   +32 code the correct solution :p
•  » » » » » » 4 years ago, # ^ | ← Rev. 2 →   0 You mean if it gets hacked, it's because the code couldn't pass all the test cases ?Alright I got it !
•  » » » » » » » 4 years ago, # ^ |   -10 If it gets hacked, it contains some bugs. But if it contains bugs, it may pass systests.
•  » » » » » » » 4 years ago, # ^ |   0 yup !!
•  » » » » » 4 years ago, # ^ |   +28 Write correct solution
•  » » » » » 4 years ago, # ^ | ← Rev. 2 →   +8 Submitting the right solution haha. If your solution has any failure people will always be able to hack it.
•  » » 4 years ago, # ^ |   0 You are scaring me now :/
•  » » » 4 years ago, # ^ | ← Rev. 2 →   0 Is there something wrong ? I am sure I locked all of them , but some seconds ago same thing happened to my B solution too. could someone please explain this to me ? UPDATE: I got my answer above, tnx :]
 » 4 years ago, # |   -17 Div 2 Problem D requires PhD in mathematics.
•  » » 4 years ago, # ^ |   +18 Get PhD in mathematics.
 » 4 years ago, # |   0 TLE on Pretest 3 for Div-2 Problem E (Duff in the Army) :/
 » 4 years ago, # |   +1 I thought score was dynamic, but it was fixed!However, its time to get the editorial right now as it is a contest of PrinceOfPersia !! :)
 » 4 years ago, # |   +3 It seems to be a nice contest. Aparently I was to busy with problem F to try all problems but anyway :) Btw, is there solution faster than for F?
 » 4 years ago, # |   +1 Good problems .. ))
 » 4 years ago, # |   0 How to solve div2 C??
 » 4 years ago, # |   +3 It was a nice competition, Had fun solving the Problems :).
 » 4 years ago, # |   +8 Does anybody know what was Div2 D pretest 4? Spent half an hour debugging with no success... =(
•  » » 4 years ago, # ^ |   +1 To pass 4th pretest, you have to use long long. I wrote #define int long long and passed it.
•  » » » 4 years ago, # ^ |   0 Bloody hell. I guess this will be the last time I tried to use long long only where I thought I needed it...
•  » » » » 4 years ago, # ^ |   +24 Got TL in the hardest problem last time because used long long instead of casting to long long only on multiplication. Didn't get place on the top.So, think twice
 » 4 years ago, # |   +3 Auto comment: topic has been updated by PrinceOfPersia (previous revision, new revision, compare).
 » 4 years ago, # |   +1 2 times I battle with TLE resulting from scanf vs cin :(. Cin: not even once.
 » 4 years ago, # |   0 im so eager to know what the test11 is in D2 C, spent almost 2h solving this problem and FAILED!!
 » 4 years ago, # |   -13 Nice one (PrinceOfPersia) (Y)
 » 4 years ago, # |   +3 Oh my god.what a fast editorial and system testing.
 » 4 years ago, # | ← Rev. 3 →   -11 This my AC submission for D2-C: 13635586, with 218 ms. This is my previous submission for the same problem: 13634487, that got TLE.However, the only difference of the two submissions is the array length. The former has 1M, while the latter has 2M.Can someone explain this phenomenon? My previous submission should have been AC with around 500-600 ms :(Edit: nvm, I used cin/cout in the previous submission... :(
•  » » 4 years ago, # ^ |   0 only difference is array length? You change cin to scanf buddy. Scanf is faster!
•  » » 4 years ago, # ^ |   -11 Its not actually because of cin/cout. If your array was 1M length, that means there is no cell of memory in 1M+19, as it has to be. It was a popular hack though!
•  » » » 4 years ago, # ^ |   0 He uses array 1000100 — length, plz don't comment if you even don't see the code. ><
•  » » 4 years ago, # ^ |   -6 Use: ios::sync_with_ios(false); while using cin and cout.
 » 4 years ago, # |   -11 I got TLE in Div.2 C because of f*cking cin. There shouldn't be problems like this. This is the second contest in a row spoiled by the problem setters. I'M SO PISSED OFF!!!!!!!!
 » 4 years ago, # | ← Rev. 2 →   +4 I think somebody submitted a wrong code for C or D (div1) and now he/she is going to get accepted and the writer is adding some test now. :D Is it right?
 » 4 years ago, # |   0 How to do div 2C problem?
 » 4 years ago, # |   +4 Div 2 C got TLE only becuase I used cin cout....logic is correct. This shouldn't happen..shouldn't it? The time should be given such that it will get AC irrespective of input method :(
•  » » 4 years ago, # ^ | ← Rev. 4 →   0 The problem is that in that case, inefficient algorithms with scanf would also pass. Sorry, but you just have to use scanf for large input problems =/ (I had some submissions fail because of that today too...) OR use ios_base::sync_with_stdio(false);cin.tie(false);cout.tie(false);
•  » » 4 years ago, # ^ |   0 so... Make the time limit so that Java's Scanner(System.in) would pass? This would allow for much less optimized algorithms in C to get passed.
 » 4 years ago, # |   0 very easy and noble the pretest, I hate this competition's system
•  » » 4 years ago, # ^ |   +1 Pretests are good. They permit the whole "hack" system to exist.
 » 4 years ago, # |   0 Auto comment: topic has been updated by PrinceOfPersia (previous revision, new revision, compare).
 » 4 years ago, # | ← Rev. 2 →   +29 Good problems, but the jump in difficulty between div1 ABC and DEF was way too big.
 » 4 years ago, # |   0 My old laptop's battery run out of charge in the last twenty minutes and then I try to edit my code on my mobile phone but finally got a Compile Error...
 » 4 years ago, # |   +3 Eh, my sqrt-decomposition on Div2-E gave TLE :( I was too lazy to code HLD and I didn't want to copy my previous implementation since I don't like copying old codes. Somebody who got AC with sqrt-decomposition?
•  » » 4 years ago, # ^ |   +6 There's no need for HLD, you only need the same structure as for LCA (except this time storing also the 10 smallest people on the path 2k vertices up from v, not just the 2k-th parent of v). Then, it's just LCA+mergesort.
•  » » » 4 years ago, # ^ |   0 Ah, I am such an overkiller :D Thanks for the explanation, it seems much easier now! :)
•  » » » » 4 years ago, # ^ |   +5 Generally, this tends to be a full replacement for HLD as long as there aren't any updates.
•  » » » » » 4 years ago, # ^ |   +5 Thanks for sharing that, I will know it in future! And congrats for becoming red again! :)
•  » » » » 4 years ago, # ^ |   +17 Speaking of overkill, I used persistent segment trees to solve this problem.
•  » » » 4 years ago, # ^ |   0 What is HLD. Will not work Heavy Path Decomposition?
•  » » » » 4 years ago, # ^ |   +4 Heavy-Light Decomposition. The same thing, a slightly different name.It will work, but as I mentioned above, it's a total overkill.
 » 4 years ago, # |   0 I think it's better to swap problem E,div1 and D,div1 and the score of D,div1 being 3000.I mean that the arrangement of the question be like this: A,div2 B,div2 A,div1 B,div1 C,div1 E,div1 F,Div1 and D,div1
 » 4 years ago, # | ← Rev. 2 →   -10 this contest learns me this:all prime divisors of N are not between 2 and sqrt(n) ! just its for testing is it prime or not!thanks PrinceOfPersia XD !*sorry it was t not w!
•  » » 4 years ago, # ^ |   0 actually you are wrong, and this is one of the reasons so much people got hacked.For example, consider number 33. It's square + ceil is 6. But the prime divisors are 3 and 11.
 » 4 years ago, # | ← Rev. 2 →   +16 50th place! Rating +4, here I come!UPD: Damn, I never get it right with this new formula.
•  » » 4 years ago, # ^ |   0 No it's +25 and many congrats! :)
 » 4 years ago, # |   +1 The contest can get unforgettable if the rating update very soon.
 » 4 years ago, # |   +3 Why this submission gave TLE? (Problem C, Div 2) http://codeforces.com/contest/588/submission/13648330
•  » » 4 years ago, # ^ |   -12 Because you are reading the input with cin. Also you shouldn't mix scanf and cin. I think this should be considered as a mistake from the problem setters, since CF should be about algorithms, not about ridiculous language details.
•  » » 4 years ago, # ^ |   0 cin >> a;
•  » » 4 years ago, # ^ |   0 due to cin Code needs I/O optimization. Change cin to scanf
•  » » » 4 years ago, # ^ | ← Rev. 4 →   -30 I hate when I see this type of comments. Scanf is not faster than cin, not even close on newer versions but cin is synced with scanf as a default since 4.6(?) which means it uses scanf behind the scene. You can use ios::sync_with_stdio(false; în your main function and see the difference.Do that before any reading and don't use both scanf and can.
•  » » » » 4 years ago, # ^ | ← Rev. 2 →   +20 I hate such comments like yourth, because SCANF is faster and it is FACT! Example of codes which are simular but not pass with cin and ios::sync!Code with cin and without cin As you see, it is faster MORE then TWO TIMES!
•  » » 4 years ago, # ^ | ← Rev. 2 →   +4 It's enough to write ios_base::sync_with_stdio(false);cin.tie(false);cout.tie(false);at the first of your code and now I think you can get AC with cin/cout.
•  » » 4 years ago, # ^ |   +1 cin >> a; was giving TLE. I got AC now :/.
 » 4 years ago, # |   0 Why TLE in test 38??? please, i need help http://codeforces.com/contest/588/submission/13643971
•  » » 4 years ago, # ^ |   0 i think the order of your algorithms is O(N^2)the size of N is 10^6 worst case then your algorithm do 10^12 processesthe time limit was 1 second and CPU can do 10^9 process per secondso TLE
•  » » 4 years ago, # ^ |   0 order is NlogN*logN = 10^6 * 20 * 20 Using array instead of set will get it pass
•  » » 4 years ago, # ^ | ← Rev. 2 →   0 just use scanf instead of cin, here i send your solution
 » 4 years ago, # |   0 Does it take much time for the contest to be published on your profile? I mean, for the rating change and all that
•  » » 4 years ago, # ^ |   0 it must appear till tommorow
•  » » 4 years ago, # ^ | ← Rev. 2 →   0 It usually takes 1 — 2 hours. Bingo! It's there.
•  » » » 4 years ago, # ^ |   0 It's the first time I take park in a contest. I had to leave a 30 minuntes from the beginning, so I just solved 1 problem. My rating lowered in 62 points. It's kind of funny
•  » » » » 4 years ago, # ^ |   0 Yes it's weird. I think rating on Codeforces depends on previous contests also. That's why even when my ranking was better than other people but still i have a lower rating than them!
•  » » » » » 4 years ago, # ^ |   +1 Thanks!
 » 4 years ago, # | ← Rev. 2 →   +1 This is my submission for Div2B : # 13646742 The logic is the same as given in editorial but for some reason it's giving different answers on my IDE (correct) and CF judge (wrong).
•  » » 4 years ago, # ^ |   +1 pow function is messing up with your answer Tip:Never use pow function
•  » » » 4 years ago, # ^ |   0 Thanks a lot. I changed it and the code works. Any reason as to why it must be giving that error on the CF judge but not elsewhere.
 » 4 years ago, # | ← Rev. 2 →   0 I solved A and B in Div-2 and passed system test ... Why skipped ??!!!!
•  » » 4 years ago, # ^ |   +21 Cheating.
•  » » 4 years ago, # ^ |   +12 You may have Multi ID or Your code may be matched with someone's . That's why thus happens what I am thinking . Same problem happens to me .
•  » » » 4 years ago, # ^ |   0 May be matched with someone's, but I never cheating :/
•  » » » » 4 years ago, # ^ |   0 Anyone never know what did you do ?? Everyone is just guessing that for these reasons You are not in the Contestant list ...
 » 4 years ago, # |   0 Problems are too Interesting and much easier to Read and Understand what the problem wants?? Well Done . Keep it up . Thanks .
 » 4 years ago, # |   0 Really nice div1E, solved after the contest.
 » 4 years ago, # | ← Rev. 2 →   0 Could someone give me a tip about how I can remove the "Memory limit exceeded" from my code for div.2 E? http://codeforces.com/contest/588/submission/13652236 I tried to make a LCA of sets...
 » 4 years ago, # |   0 Its strange changing cin (alongwith ios::sync_with_stdio(false);) to scanf worked. Was getting TLE with cin
•  » » 4 years ago, # ^ |   +1 Have you tried gob ?
•  » » » 4 years ago, # ^ |   0 ofc
 » 4 years ago, # |   +10 Screencast of me failing rounds.
•  » » 4 years ago, # ^ |   +37 Failing? But you got #4..
•  » » 4 years ago, # ^ | ← Rev. 5 →   +3 #just_grandmaster_things
 » 4 years ago, # |   +1 Looks like someone got a bit too angry :P
 » 4 years ago, # |   0 Can anyone offer a brief explanation about problem E please? I really don't know what is the basis of a vector and why the answer is 2 ^ (b.size()) ...
 » 4 years ago, # |   0 Why did you change the start time?, it is pretty bad time for people in latin america ): Is this going to change in the next rounds?