### Furko's blog

By Furko, 7 years ago, translation,

Hello everyone!

Codeforces Round #186 (Div. 2) will take place on Thursday, May 30th at 19:30 MSK. This is my first Codeforces Round and I hope that everyone will enjoy this round.

I would like to thank Gerald for helping me prepare this round. Special thanks to Delinur for translation of all problem statements into English.

Problems point values today is: 500-1000-1500-2500-2500

Good luck & have fun! :)

• +224

 » 7 years ago, # | ← Rev. 2 →   -117 I hope that the contest will be rated.
•  » » 7 years ago, # ^ |   +5 This is not your problem!
•  » » 7 years ago, # ^ |   +16 That's why you have to respect this simple rule : "You may edit your comment only for fixing grammar mistakes or small changes. Do not change the main idea of your comment."
 » 7 years ago, # | ← Rev. 3 →   -17 Fast announcement.
 » 7 years ago, # |   +26 hope this round be successful
•  » » 7 years ago, # ^ |   +6 Hope all.
 » 7 years ago, # |   -14 Let's get ready for fun!
 » 7 years ago, # |   +10 Lets just hope this contest goes fine and rated. :)
 » 7 years ago, # |   0 Wish this contest will be rated. BTW thanks for early announcement. :)
 » 7 years ago, # |   +18 Oh MY god!!!I have taken part in three CF round...But I am unrated now(Because all of those three round have something wrong...)= =...SO I don't want to miss this one ....But ..At 23:30 on Thursday, I will on the train to Chengdu to take part in a invitation match.....WTF....Who can help me!!!!!
•  » » 7 years ago, # ^ |   0 let me play for you. :D
•  » » » 7 years ago, # ^ |   +1 only joking....
•  » » 7 years ago, # ^ |   +9 This is life.
•  » » » 7 years ago, # ^ |   +9 Yes...life is cruel...
•  » » 7 years ago, # ^ |   0 What kind of help do you expect?
•  » » » 7 years ago, # ^ |   +14 I need a laptop when I am on the train.... and a wifi....Although I usually write code on the cellphone by c4droid and submit by chrome....But...as you know, it's not convenient...
•  » » 7 years ago, # ^ |   +4 So...please the judge system good luck and don't have fun ....please this round can be rated....I want to be rated!!
 » 7 years ago, # |   +3 I hope everything will be ok this round.
 » 7 years ago, # |   -13 For Furko its his first codeforces round and i hope that it will be very easy or very hard :)))
 » 7 years ago, # |   -7 THIS IS MY FIRST CONTEST IN CODEFORCES ....WISH ME GOOD LUCK T-T
•  » » 7 years ago, # ^ |   +16 Good luck.P.S: Your Captain Obvious
 » 7 years ago, # |   +5 Thinks for this round.I'm so glad it's coming soon.
 » 7 years ago, # |   0 I hope me and my team perform excellent in this round we've like preparing here because the problems are more tougher that UVA online judge. BLACKBOXCODERS
 » 7 years ago, # |   +6 hopefully this round will be successful! good luck everybody! :)
 » 7 years ago, # |   +1 This is going be heavy loaded contest. 2177 and still counts.
•  » » 7 years ago, # ^ |   +3 Not so "heavy" loaded. April fools day contest has 3200 registered user, and #175 has just a little more than 3000.
•  » » » 7 years ago, # ^ |   +3 Don't forget it's just Div2 contest. I think many Div1 coders will not participate in it.
• »
»
»
»
7 years ago, # ^ |
-8

# 175 is also a div2-only contest :D.

•  » » » » » 7 years ago, # ^ |   +3 Ok. I'm not saying, that contest is going to be the most busiest :)
 » 7 years ago, # |   +4 After hard Chinese problems, I think easier European.
 » 7 years ago, # | ← Rev. 3 →   0 Gl && hF
•  » » 7 years ago, # ^ |   +2 hv?
•  » » » 7 years ago, # ^ |   0 good luck have fun.
 » 7 years ago, # |   -7 maybe it is not the right place but why USACO training page wont open ? is their site down or something ?
 » 7 years ago, # |   -17 Anyone else having 'In queue' longer than usual?
 » 7 years ago, # |   +6 This is the most unlucky hacking attempt, isn't it? :(
•  » » 7 years ago, # ^ | ← Rev. 2 →   +9 hmm... i'm pretty sure that you writed this contest from this account http://codeforces.ru/profile/kingofnumbers2
•  » » » 7 years ago, # ^ | ← Rev. 2 →   -10 But I didn't cheat :)I only used one account in this contest
•  » » » » 7 years ago, # ^ |   +11 Anyway, creating 2nd account is prohibited by rules.
•  » » 7 years ago, # ^ |   +53 I think, this one is worse:
•  » » 7 years ago, # ^ |   0 my submission 3800641 came pretty close to TLEing too.....thankfully it didnt exceed 2 seconds! :)
•  » » » 7 years ago, # ^ | ← Rev. 2 →   0 I think your IO is very very slow, because my solution get sum from 0 to n every iteration, but it's pass for 400ms. Try to use ios_base::sync_with_stdio(false).
•  » » » » 7 years ago, # ^ |   0 what is the function of ios_base::sync_with_stdio(false) ?
•  » » » » » 7 years ago, # ^ |   0
 » 7 years ago, # | ← Rev. 2 →   -8 wasted so much time trying to find out why my brute force solution didn't work for the second problem when a very easy dp implenetation I made in the end passed all the pretests... yet another bad contest for me :(
 » 7 years ago, # |   +8 how solve problem D?
•  » » 7 years ago, # ^ |   0 I was going to ask the same question!
•  » » 7 years ago, # ^ |   +3 dp[i][j] = minimum cost to repair j holes from the first i holes Complexity: O(N^3)
•  » » » 7 years ago, # ^ |   0 how do steps?
•  » » » » 7 years ago, # ^ |   +1 Try every i <= k < N, dp[k+1][new_j] = min(dp[k+1][new_j], dp[i][j] + minCost(i, k)). minCost(i, j) can be precalculated in O(N^3).
•  » » » » » 7 years ago, # ^ |   0 How to precalc minCost(i, j)?
•  » » » » » » 7 years ago, # ^ |   0 You take all the intervals from the input and then do something similar to Floyd–Warshall.
•  » » » » » » » 7 years ago, # ^ |   0 The floyd-warshall part is not necessary.
•  » » » » » » » » 7 years ago, # ^ | ← Rev. 2 →   +18 Hey, do you have cerealguy's permission to use his photo? :)
•  » » » » » » » » » 7 years ago, # ^ |   0 I didn't know there was already a cereal guy here when I chose this pic.
•  » » » » » » » » » 7 years ago, # ^ |   +10 You have my permission.
•  » » » » » » » » » 7 years ago, # ^ |   +3 there are some minor differences, size of head and also bowl or even the table !
•  » » » » » » 7 years ago, # ^ |   +5 first of all, each cost[i,j]=INF.for each l,r,c you get, cost[l,r]=min{ cost[l,r] , c }then cost[i,j]= min{ cost[i,j] , cost[i-1,j] , cost[i,j+1] }
•  » » » » » 7 years ago, # ^ |   0 Uhn!Could you explain what is the meaning of the recursion formula and the 'minCost(i,k)'?
•  » » » » » » 7 years ago, # ^ |   0 You have currently decided what to d with the first i holes. You repaired j from them. You try to repair every interval (i,k), i <= k < N. The cost to repair this interval is minCost(i, k) which is precalculated. You end up at dp[k+1][new_j] because you have already decided what to do with the first k+1 holes and you repaired some additional holes. Also, you can decide not to do anything at this hole (go to dp[i+1][j]).
•  » » 7 years ago, # ^ | ← Rev. 10 →   +6 dp[i][j] = minimum cost for fixing j holes out of first i holes.dp[i][j] = min(seg.cost + dp[i-seg.size][j-seg.size]where seg = {l,r,c} and all seg.r == jI didn't submit as I was a minute late, but I believe it to be correct.UPD: Nah, not correct logic, small modification required to it.
•  » » » 7 years ago, # ^ |   0 My idea is the same as yours but got wrong answer on pretest4.In fact,we won't fix a hole more than one time. try this test: 3 2 3 1 2 1 2 3 2
•  » » 7 years ago, # ^ |   0 This is my idea but my code wasn't right for samples: First I define dp[i][j][k] = minimum const to fix at least k holes in j first holes using first i companies. while companies are sorted by their right points. And the update: dp[i][j][k] = min (dp[i — 1][j][k], dp[i — 1][j — (j — company[i].left + 1)][k — (j — company[i].left)] + company[i].cost)I saw that the difference between second and third dimensions of dp is always the same, so I omitted third dimension. And so this dp is my solution: dp[i][j] = minimum cost to fix at least j — n + k holes in first j holes using first i companies while companies are sorted.Is this solution right ? :-?
 » 7 years ago, # |   +9 I hope tests for problem C are good enough to fail Java solutions which use Arrays.sort().
•  » » 7 years ago, # ^ |   +12 Such test are included to pretests.
•  » » » 7 years ago, # ^ |   0 Yeah. I couldn't pass test 11 on Java. I finally pass them, when rewrite solution to C++
•  » » » 7 years ago, # ^ |   +1 Thanks for trying to include that test, but my solution passed pretests just to time out on test 48 (Is that a hack input?).I guess it is my fault to keep forgetting not to use Arrays.sort() on arrays of primitives
•  » » » » 7 years ago, # ^ |   0 I add shaffle to my solution in Java and get TL too. Probably we need to read input data faster
•  » » 7 years ago, # ^ |   0 I think it's 100% unfair. Quick-sort is the same for every language, Java probably have more overhead, but again — I think it's unfair.
•  » » » 7 years ago, # ^ |   0 Shaffle array before sort it in Java.
•  » » » » 7 years ago, # ^ |   0 Ok. I got it, it looks like tests are written to kill exactly Java implementation of quicksort. Good job!
•  » » » 7 years ago, # ^ |   +4 The default way of sorting things is not the same in every language. Modern compilers (GCC, Python, .NET starting from version 4.5, Java when sorting objects) tend to use worst-case algorithms, mostly Introsort and Timsort. However, in Java, integer sorting still uses double-pivot quicksort which is O(n2) in the worst case.
•  » » » » 7 years ago, # ^ |   0 So, is it way to fix it? Write your own sort?
•  » » » » » 7 years ago, # ^ |   0 Randomly swap some items of array. And after that u can use Arrays.sort()
•  » » » » » » 7 years ago, # ^ |   0 You may want to know about Collections.shuffle routine.
•  » » » » » » » 7 years ago, # ^ |   +1 Yeah, according to javadoc — Collections.shuffle runs in linear time. So it's a good solution. Thanks
•  » » » » » 7 years ago, # ^ |   0 Or, box int-s into Integer-s and use an object sorting routine (Collections.sort?). It may be slower though in the general case.
•  » » » » » » 7 years ago, # ^ |   0 Funny stuff. I shaffle my List, but get TL again in practice.
•  » » » 7 years ago, # ^ |   0 submit in java 7
•  » » » » 7 years ago, # ^ |   0 great man... i was struggling with TLE using Java6. (so now in undestand java6 to java7 is not just for syntax changes.) thanks :)
•  » » 7 years ago, # ^ |   0 The sorting algorithm used in Java for Arrays.sort(int[] arr) is tuned quicksort which offers very good average case performance.Many contestants used Arrays.sort() today for problem C and have passed System tests. I think if the solution fails, the problem lies elsewhere.
•  » » » 7 years ago, # ^ |   0 My solution was using Arrays.sort() and failed pretests with TLE.The same solution is passing after these changes: - Use FastScanner implementation by martinezgjuan (which uses BufferedReader + StringTokenizer). - Use Java 7 (not Java 6)Now is passing with worst running time 951ms (no need to shuffle the array).
•  » » » » 7 years ago, # ^ |   0 Java 7 also uses quicksort, it's just your luck that nobody has made anti-java-7-hack.
•  » » » » » 7 years ago, # ^ |   0 AFAIK java7 uses TimSort
 » 7 years ago, # |   0 I am really curious about what the pretest 4 of problem D is.
 » 7 years ago, # | ← Rev. 2 →   0 that was a great contest after ... :)
 » 7 years ago, # |   +5 May someone introduce the intended method for Problem E ?
 » 7 years ago, # |   +1 anybody knows why system testing is taking very long time today??
•  » » 7 years ago, # ^ | ← Rev. 4 →   +2 Big number of testcases for problem C, I guess. Also, contest is merged for both divisions, so there is a lot of participants => solutions to judge
•  » » 7 years ago, # ^ |   +3 and a lot of submit in contest
•  » » 7 years ago, # ^ | ← Rev. 2 →   -15 Ask messi. He is best ;)EDIT : I thought there are more FC Barca fans than others in CF and I'll get pluses. 8)
 » 7 years ago, # |   +4 Problem D is really beautiful, solving it was tons of fun!!
 » 7 years ago, # |   +5 O(N3 + M) on problem D got me TLE :(
•  » » 7 years ago, # ^ |   +6 It's funny. My O(N^4) passed.Sometimes the speedy inner loop is more important than the asymptote. I wrote carefully to eliminate 31/32 of the transitions in the dp without computing them.
•  » » » 7 years ago, # ^ |   0 Mine solution is even slower, but passed.
•  » » 7 years ago, # ^ | ← Rev. 3 →   0 haidora1, I think that the cycles for(int n = 1 ; n <= N ; n++){ for(int k = 1 ; k <= n ; k++){ for(int i = 0 ; i < f[n].size() ; i++){ for(int h = n ; h >= 0 ; h--){ ... if f[N].size ~ M , give you O(N3 + MN2) .
•  » » » 7 years ago, # ^ | ← Rev. 2 →   0 Thank you , I can see what's wrong now.
 » 7 years ago, # |   +5 TLE-SOLUTION passed solution why the second solution passed and the first one get TLE
 » 7 years ago, # |   +1 Wow, so many AC for problem C which pass with execution time of exactly 2000 ms, which is the TL for that task. Ofcourse on the other hand some codes definitely fail by only a few ms in this case. Now I wonder — is the TL set a little too low and hence might reject some codes with TLE even with the correct idea/implementation of solution OR is the TL a bit too high and that's why it lets some weaker codes pass that actually shouldn't?
•  » » 7 years ago, # ^ |   0 The Time limit is enough, those codes probably used slow input methods
 » 7 years ago, # |   -33 unrated?
•  » » 7 years ago, # ^ |   0 Why lol?!!
 » 7 years ago, # |   -19 So, what is the point for CodeForces to support several languages as they do if you will have problems that cannot even run within the time limits using that language, regardless of how efficient you do it. You may have the exact same code in Python and Java, but you get TLE in Python (The same happens sometimes with Java and C++). Then, why support Python? Why don't you just get serious and support languages in which problems can be done like in TopCoder? Or just increment the time limit for certain languages, whatever you feel more confortable with. That would be a lot easier for contestants! In my opinion, it is NOT fair to get a problem wrong when the algorithm is identical to others who got it right, being the code language the only differentiator.
•  » » 7 years ago, # ^ |   -13 Can't agree more. The same algorithm runs in time if coded in C++, but in python it gets TLE. This happened in problem C for many Contestants.
•  » » 7 years ago, # ^ |   0 That's a lot of work for every task, since the difference in speed isn't constant.See the FAQ: It is not guaranteed that all the problems will have solutions in all the given languages (it's especially about the scripting ones). Probably, I'll later introduce equalizing coefficients for the working time for some languages. A "plus" next to the version name means that the testing system can use older versions. If you have suggestions about the possible ways to change the compilation or the launching line, write about them in your commentaries.
•  » » 7 years ago, # ^ | ← Rev. 2 →   +18 Python is easier to write correct code in than C++.The syntax is simpler, the edge case and corners are less likely to cause you trouble, the array bounds are checked so that errors show up right away, debugging and tooling is better, Python has a repl so you aren't always compiling-testing-compiling-timing just to try an idea, and you don't have to worry about static type declarations. C++ is a pain with cruft from legacy implementations, the syntax is verbose and cryptic, the template system is full of hidden troubles waiting to bite during a contest, and even the compiler error messages are indecipherable.But C++ runs about ten times faster than Python.So there are advantages and disadvantages to both. You are allowed to switch languages between problems. You can even pick your algorithm and then choose your language for each problem based on speed and convenience.Being able to choose wisely is part of competing here.
•  » » » 7 years ago, # ^ |   -9 I have to disagree with you there. I know Python have a lot advantages over C++ in terms of readability, testing and debugging; that's the main reason I code in Python rather than C++, or even Java that I use as my second choice.I believe it can be challenging enough to come up with an algorithm that works for a particular problem and also have a quite good and reasonable complexity. So, why would my solution be wrong when is as good as yours?I can see how almost every C++ coder codes everything in C++, but you can say that you have to "choose wisely" your code language for a particular problem, when even the easiest problem you already code it in C++. So, when do you actually choose? I believe that is not the reason.
•  » » » 7 years ago, # ^ |   +3 I think the main issue here is that it was not possible to get AC in Python with any solution. While I understand that you have to think about efficiency twice in python (sometimes naïve code gets accepted only in C++ while in other languages you have to think of smarter solutions), I still consider that the most important ability to learn in these competitions is algorithmic skill, not language syntaxes or quirks.In my opinion, is better if, for these kind of problems, Codeforces won't accept Python to avoid the misleading information that is possible to solve the problem with Python.In short, we (at least me) are not here to learn the syntax and tools of languages, we are here because we would like to solve algorithmically challenging problems.
•  » » » 7 years ago, # ^ |   +8 I think the constraints were not very well checked for the problem C. My code in Java barely passed the tests (1880ms) by even using fast custom made I/O routines and with an O(n lg n) algorithm. Had I not used the fast I/O library my code would have easily failed. And Java is not even one of the slowest languages supported. So either time limits should be loosen up a bit and maybe also increase the input constraints so algorithmically worse solutions fail even in C++.
•  » » » » 7 years ago, # ^ |   0 I don't think so. This for loop might be the reason why the code is slow. for(int i=1; i<=n; i=4*i){ for(int j=0; j
•  » » » » » 7 years ago, # ^ |   0 Oh, then it could have been a bit faster. Thanks for the tip :)
•  » » » » » » 7 years ago, # ^ |   0 Your pass is not that slow though :). 1 + 4 + 16 +... ~ 3 passes of the array.
•  » » » 7 years ago, # ^ |   +1 When I see n <= 10^5 and I have a O(nlog(n)) or faster solution, Python is the first choise.
 » 7 years ago, # |   +3 My same code got Time limit exceeded in contest but Accepted in practise...I wonder why???TLE code : 3800440 AC code : 3803673
•  » » 7 years ago, # ^ | ← Rev. 2 →   +2 thats really mysterious....u should probably report this issue to the admin with the above details.
•  » » » 7 years ago, # ^ |   +2 How to report?
•  » » » » 7 years ago, # ^ |   +2 sorry, i'm not sure of that.....but i suggest u send a message to MikeMirzayanov as he's the host of this site...
•  » » » » » 7 years ago, # ^ |   0 The same thing happened to my friend!TLE: 3801046AC: 3804156So very wierd :|
•  » » 7 years ago, # ^ |   0 Probably the way they measure the runtime of a code is not smart enough. Report it so they can do something about it, if possible. Not only your particular case but in general.
•  » » 7 years ago, # ^ | ← Rev. 2 →   +4 TLE code : 3799383 AC code : 3804162
 » 7 years ago, # |   +3 It is really funny, IceTube has become purple and Goldensea is blue ! and I think he can't compete in Div 1
 » 7 years ago, # |   +3 I had no idea about the difference in runtime between read using scanf/printf and cin/cout in C++. I always use scanf/printf in codechef and spoj but I was confident here in codeforces. I got TLE in problem C and I change cin/cout by printf/scanf and I got AC in 1 sec. Great, I will use scanf/printf here too.
•  » » 7 years ago, # ^ |   0 Try resubmitting the exact same code that gets you TLE again. It could get AC now. A lot of participants have had this problem today. If so, I think you should report this to the authority.
•  » » » 7 years ago, # ^ |   0 Thanks man, personally, I will stop using cout/cin in everywhere.
•  » » » » 7 years ago, # ^ |   0 The fact is, if you notice execution time, it gets clear why this happened.
•  » » » » 7 years ago, # ^ |   0 take a look here electrician: http://codeforces.com/blog/entry/925
•  » » » » » 7 years ago, # ^ | ← Rev. 2 →   0 Thanks for your help man, I read this great post. lol, using (_ios_base::sync_with_stdio(false);_) it was faster than using printf/scanf. Thanks a lot. Here is my submission.
•  » » » » 7 years ago, # ^ |   0 Sometimes, writing a function to read is faster than printf/scanf.
 » 7 years ago, # |   +3 It seems like many participants' solution of problem C got TLE during the contest but the exact same code gets AC after the contest! This is really unfair for the people who've faced this.
 » 7 years ago, # |   0 Any quick explanation on how to solve Problem E?
•  » » 7 years ago, # ^ |   +4 Greedily, i in set A should add m-i-1 in set B. If the amount of i are more than m-i-1 's, we should add m-i-2. Before that wo should do i+1 add m-i-2. So use a stack to solve it. Complexity O(m+n). The O(n) is printing answer.
•  » » » 7 years ago, # ^ |   0 I'm sorry that I don't know how to write clearly. Please read my code if you interested. 3803851
 » 7 years ago, # |   +3 What is meet-in-the-middle algorithm ?
•  » » 7 years ago, # ^ |   0 I have only used this algo once, with some help from a friend. So I might not be able to explain efficiently. Still giving it a go.Here's a demo of the algo -You have a set of integers consisting of no more than 34 elements and want to find the number of subsets such that the sum of the integers in a subset is an integer N (N is a known value).A brute solution would be to try all 2^34 ways, which is not efficient.So what we do is we split the set in two equal subsets (meet in the middle algo), try to form all possible subsets for each set and record the results (the number of results is at most 2^17 for each set), then for each element in one set, run binary searches to find upper limit and lower limit for compatible results in the other set.I don't know if this explanation is good enough. Maybe you can take a look at this. http://www.infoarena.ro/blog/meet-in-the-middle
 » 7 years ago, # |   0 Why my code got WA on testcases 11 ?3805151
•  » » 7 years ago, # ^ |   0 use long long to store the answer. The maximum is near 2*10^6*10^9 ~ 10^15
•  » » » 7 years ago, # ^ |   0 Read clearly, he used.
•  » » » 7 years ago, # ^ |   0 I used, thank you all the same.
 » 7 years ago, # |   0 After two unrated contests of CF, this contest is finally rated. thanks ^_^
 » 7 years ago, # |   0 Can someone give me an idea for Problem C??I was actually trying to simulate, but I think it is unnecessary... can someon eplease help?
•  » » 7 years ago, # ^ | ← Rev. 2 →   +1 yes, actually you don't need to simulate the assignment in your codethe idea is to select biggest 4^n numbers then biggest 4^n-1 then 4^n-2 until 4^0
 » 7 years ago, # |   0 Great contestReally waiting for editorial, specially for brilliant problems D and E. GL & HF!
•  » » 7 years ago, # ^ |   +1 Here is editorial in Russian.
•  » » » 7 years ago, # ^ | ← Rev. 2 →   +1 Thanks, but where and when can I have it in English?
 » 7 years ago, # |   0 TLE : 3798859 ACC : 3806006 what should i do about it?
 » 7 years ago, # |   0 3806042 why am i getting runtime error? Its working perfectly on my console
•  » » 7 years ago, # ^ | ← Rev. 2 →   0 In C89 you have to return 0 from main(). Also, you should not cast away const.
•  » » » 7 years ago, # ^ |   0 Thanks a lot.It got accepted after using return 0 :)
 » 7 years ago, # | ← Rev. 2 →   0 Would someone mind translating the editorial to english from russian? That would be amazing!
 » 7 years ago, # | ← Rev. 2 →   +4 hopefully there will be a new round this sunday for both div 1 and 2.
 » 7 years ago, # |   0 D. DP[i,j] := min. cost of filling j holes among 1,...,i holesDP[i,j] = min {DP[i-1,j] , min(all l_m=i){(min(1<=k<=(r_m-l_m+1)){DP[i-1,j-k] + c_m}}}The first part of the recursion indicates when we don't take into account segment fixes which start at i and the second part represent the case when we consider repairs starting at index i.Complexity = O(mn^3). Can anyone suggest me some improvements. Like how I can improve my bounds. Thanks.
 » 7 years ago, # |   0 3811425 Ilya and matrix Hi, can someone refer to above submission and tell me why it is giving TLE error. I mean i have written in JAVA and used the buffered reader. I tested the same on my laptop (a core2duo machine) for a test file with data of size 1048576 and those many numbers and it completes in 500millisecs. but i always get TLE. is my reading method faulty? or the algorithm. I only have one loop.
•  » » 7 years ago, # ^ |   +3 yeah got the problem. i was using Java6, changed to Java7 got accepted in seconds.
 » 7 years ago, # |   0 In C problem,why I used cmp function(write by my self) tle but didn't use can ac!!
 » 7 years ago, # |   0 Anyone willing to explain the idea behind Div2-C?The sortings and reverses totally are failing me...