Комментарии
|
+1
It’s actually a reminding sentence. Problem-setter doesn’t want to repeat answering clarification like “am I allow to …” (yes, you do — in problem statement). Also, it may be a misleading corner case so problem-setter stresses on it. Edit: it’s not a grammer competition, of course. You will see this kind of sentence often, and in most cases, the purpose of problem-setter is good (i.e. try to make thing clearer, not try to be evil and cheat you :P) |
|
На I_love_natalia →
Тренировка по задачам межвузовского первенства Самарской области, 2 месяца назад
+41
Handlers of 2 testers look alike :) |
|
+18
:( just change one constant to get D accepted
in GCJ 1A, add one more if to win Poor me |
|
+5
shankysodhi>> what time limit are you talking about We are talking about TC's time limit, right :D shankysodhi>> And moreover did you get this number by experience or is there a way to calculate it Oleg>> try same code in practice arena, run with some data and check what time took to execute it. shankysodhi>> When you say O(N * log(N) * jackpot) .... is jackpot for the outer loop and n* log n for sorting the array ...??? .......... Is that your approach? You are right for both questions. You should try to verify your doubt instead of asking for answer immediately. |
|
+3
I don't train for IOI now, but based on my past understanding, bronze contests are easy. If you pass bronze contest, please don't be too confident about bronze medal :) you can simply try past IOI's problems and compare with actual result.
|
|
0
I think I pressed "Enter" (this time I'm not so sure), and there was no explanation except "invalid case". Anyway, it's ok for me :)
|
|
+3
How come :( yeah I'm pretty sure that I tried to challenge other by that case, and I couldn't as it show: invalid case... That's why I thought that numbers should be separated by "," or "..." and stop making other challenge. Grrrr I should have many successful challenges
|
|
+3
Hmm, for me, it means something like: if you have "1<space><space>2", you need to remove all-but-one spaces, so it becomes "1<space>2". I try to challenge other by this case, but it is an invalid case. Now, my conclusion is: we don't need to understand that sentence in order to solve this problem :(
|
|
+1
It's hard to design a formula which sounds "reasonable" all the times.
In this case, pdwd successfully beat many high rated coders in div 1, so he deserves large rating increase. Although nvilcins may do the same thing if he completed in div 1, it's just an "if". The formula is not intelligent enough to consider his effort in a different situation, and I don't expect that a formula will do so. |
|
0
I used EPS = 1e-9 during the contest and got AC. After switching to EPS = 1e-6, I still get AC. It's better to avoid EPS (as much as possible) in these problems than to choose a correct EPS :)
|
|
+5
During the first half of the contest, clicking on "ROOM" always brings me to room 9, while my room is room 1. Thus it takes me quite long time to understand why I can NOT read other's solutions. I would like to report it as a bug.
This is the first time I participate in a codeforces-ruled contest. :) |
|
0
I use dp[kA+kB+kC][151][kA][kB], it sounds worse than your way. However, kA+kB+kC always increases by one in each step of DP, so you can use dp1[151][kA][kB] and dp2[151][kA][kB] instead. It's easy to fit in memory.
|
|
+17
Simple greedy: for each employee i, we assign to the employee j if q[j] > q[i] and the cost is min (i.e. pick the smallest possible cost).
|
|
0
I use KATE (on linux) because it's Khuc Anh Tuan's Editor :D
|
|
0
It's still the same, because log2(N) = log10(N) * log2(10). The difference is just a constant log2(10), thus it doesn't matter in complexity.
|
|
-3
Me :D
|
|
+1
Well, the translation is not really good. But I found it's challenged and interesting to understand the problem-statement (it's tricky but still logical). I saw similar writing style in other Russian contests at acm.timus.ru.
|
|
+1
I've just noticed that an invitation email was sent to me although I'm not eligible for this contest.
|
|
+1
I made some silly mistakes in problem E too, one of them is I wrote "return -1" instead of "cout << -1" ( although I didn't practice much on TopCoder recently ).
|
|
0
As you want to use them in programming competitions, it's better to choose a language which is widely supported. C++ is the answer.
Sometimes, it's just a personal preference. Sometimes, it doesn't matter as the programming language is just a tools to express what we've done. |
|
0
1) You don't have to write a complete program by yourself. Some of plug-ins can automatically generate it for you ( apply for both predefined class/method and local testing code ).
For me, I use kawigi to generate predefined class/method. I test my programs in default competition window. 2) I don't use any code-snippets. The 250 points is often straight forward to code in 5 mins (the solution is just about 5 lines long). 3) For TC, it's rarely for me to skip a problem (as the next problem should be much harder). I just do 250-500-1000. For each problem, try to solve it as fast as possible, forget about time and the rest. Sometimes I get stuck, I will watch the division summary to estimate the difficulty. 4) Practice is alway the key. It may be time-consuming and you have to give up other activities (it's your choice). There are source codes and editorials on TC, so it's better if you can practice un-solved problems after contest. Other contests have different rules and problems' style so it's good if you try all :D |
|
0
When I stop my pointer on a submission on standing page, the language of that submission is shown. Can you do the same thing on rating page: the rank of that coder in that competition is shown. Thanks!!!
|