### witua's blog

By witua, 7 years ago, translation, ,

Hi all,

Next Codeforces Round, which is with number 157, will take place tomorrow. I'm an author of it, it is my 7th round at CF. Thanks alot to Gerald for helping in preparings.

Scores distribution in both divisions is 500-1000-1500-2000-2500.

Good Luck!

Top-7 Div1:

Top-4 Div2:

Thanks!

Editorial (currently only for Div2).

• +220

 » 7 years ago, # |   +13 Will the round use dynamic rating system? What are scores for the problems? Will there be problems about lucky numbers? 157 = 74 + 47 + 7 + 7 + 7 + 7 + 4 + 4 GL & HF!
•  » » 7 years ago, # ^ |   +64 Since GCD(4,7)=1, every round number can be considered lucky ;)
•  » » » 7 years ago, # ^ |   +13 If you are to find positive values, only any greater then ab-a-b.
 » 7 years ago, # |   -27 157 div 1 = 7*7*7 — 4*4*4*4 — 7*7 — 4*4 — 7 — 7 — 4 — 4 = 7^(7-4) — 4^4 — 7^(sqrt(4)) — 4^(sqrt(4)) — 7*sqrt(4) — 4*sqrt(4); 157 div 1 = 77 + 44 + 44 — 4 — 4; 157 div 2 = 44 + 44 — 7 — 7 + 4;It can be concluded that the round for first division will be more difficult than for the second division.
•  » » 7 years ago, # ^ |   +16 Exactly how much time did you spent calculating it ? :P
•  » » » 7 years ago, # ^ |   +1 5 minute
 » 7 years ago, # |   0 "Round will not use dynamic system" Shouldn't it be more explict to write "Round will use standard distribution"?
•  » » 7 years ago, # ^ |   +8 it's because the score distribution may won't be standard(for example : 1000 1000 1500 2000 2500 is not dynamic nor standard)
 » 7 years ago, # |   -14 It is the third "Ukrainian" round in a row! Waiting for a nice one)
•  » » 7 years ago, # ^ |   -55 Ну и зачем ты кичишься "украинским" раундом? Ты националист? Признавайся, это [ты]?(http://www.youtube.com/watch?v=RrwLGOCiqGA)
•  » » » 7 years ago, # ^ |   -50 И этот недотролль на девятом месте по вкладу. Парадокс, одно слово...
•  » » » » 7 years ago, # ^ |   +33 Petr?
•  » » » » » 7 years ago, # ^ |   -34 Мне кажется, что из тех троих с вкладом 136 не сложно догадаться кто это пишет)
•  » » » » 7 years ago, # ^ |   +32 ivan.popelyshev? So unexpected!
•  » » » » 7 years ago, # ^ |   0 By the way, if you think somebody uses multiple accouns, you can contact MikeMirzayanov. You can send him a private message on Codeforces. May be, you know his e-mail.
•  » » » » 7 years ago, # ^ |   -14 Ты вещества употребляешь? Попелышев тут абсолютно не при чем. Тебе у него ещё поучиться надо, а ты его недотроллем называешь. Но ты не ответил на вопрос: "ты националист"?
 » 7 years ago, # |   0 What does "the score distribution will be announced later." mean? isn't it always like 500:1000:1500:2000":2500 ?
•  » » 7 years ago, # ^ |   +2 Not always. The most common distribution is 500 1000 1500 2000 2500 but there are exceptions. That means that some problems will be harder or easier than normal.
 » 7 years ago, # |   +2 what does "dynamic system" mean?
•  » » 7 years ago, # ^ | ← Rev. 2 →   -19 Dynamic scoring system is the system in which you receive points only for a correct solution and the received points are inversely proportional to the time it took you to solve the problem.
•  » » » 7 years ago, # ^ |   +2
•  » » » » 7 years ago, # ^ |   +7 Oh, I didn't know that. Thanks a lot ! Sorry if I confused someone .
 » 7 years ago, # |   +32 Wow! Mr. witua's problemset is always great! ;)
 » 7 years ago, # |   +4 when the score distribution will be announced.
 » 7 years ago, # |   0 Good luck to all^O^
 » 7 years ago, # |   0 Good Luck to all contestants :)
 » 7 years ago, # |   +10 More and more times we help little Elephant :D
 » 7 years ago, # |   +39 Is this the first round after end of the world?
•  » » 7 years ago, # ^ |   0 I have a doubt . If I solve the first problem 10 minutes after the start of competition and second problem after further 15 minutes i.e. 25 minutes after the start of competition . Then while calculating the score for the second problem solved will the time considered bye 25 minutes or 15 minutes . If it is 25 minutes , then is it not better to solve difficult problems first because there the penalty is larger . The text says it is better to solve problems by order in difficulty ( ascending or descending ) . May be difficult problem will large time so will affect time of larger number of problems , hence ascending order of difficulty . But just clarify which time will be considered . Thanks .
•  » » » 7 years ago, # ^ |   0 25 minutes after the start of competition
•  » » » 7 years ago, # ^ |   0 You'll have the penalty for 25 minutes, since they can't know how much time you have used for each problem... The most people start with the easier problem but others prefer to start with problem E, up to you to choose your strategy.
•  » » » » 7 years ago, # ^ |   0 Thanks for responding before my 1st contest . Good luck
•  » » » 7 years ago, # ^ |   0 25 minutes.
 » 7 years ago, # |   +9 Contest was interesting, but it has a problem: from the one side first 3 problems were really easy, but the next 2 were very hard (as for Div 2). But thanks in any case.
•  » » 7 years ago, # ^ |   0 Apparently not that easy actually; there are a lot of hacks happening. (I think problem C has many hacks.) The first three are easy but somewhat tricky.
•  » » » 7 years ago, # ^ |   0 any challenge case for C?
•  » » » » 7 years ago, # ^ |   0 Nop, but some have forgotten the cases with only 1.
•  » » » » » 7 years ago, # ^ |   0 I did.and u hacked me :( However good that you did,else it would have failed system tests and I wouldn't have got any points.
•  » » » 7 years ago, # ^ |   0 Even so, they were too unbalanced. 1200 ppl having OK on pretests for A-C and 30 for D?I'm fine with problems whose difficulty is based mostly on tricky cases (or using an appropriate bruteforce to escape such cases), as long as they don't make up more than half of all problems, which was not the case in div. 2.
 » 7 years ago, # | ← Rev. 2 →   +3 i think that the A,B,C questions were very easy
•  » » 7 years ago, # ^ |   0 Were*
•  » » 7 years ago, # ^ |   +2 REALLY ???
•  » » » 7 years ago, # ^ |   0 First 3 problems all done in 14mins... Well it's all problems that I can finish
 » 7 years ago, # |   0 in div1 second problem had a hard implementation and no special algorithm which i didn't like.the whole contest had too much mathematics in it i guess. calculating expectations is HARD.
•  » » 7 years ago, # ^ | ← Rev. 2 →   -14 You can brute force (10^5 is easy). Or otherwise just note that the sum of all numbers minus the sum of the main diagonal is exactly twice of the sum of a line, but this is also exactly what we're given. The rest is left as an exercise (read: implementation problem)....misread comment. I need to pay more attention to "1" and "2".I don't mind a lot of mathematics in the contest; in fact I like it. (Okay I'm an IMO participant so that's biased.) But the point is that it helps you to learn more than usual implementation problems. You can use Google/Wikipedia while you're competing right?
•  » » » 7 years ago, # ^ |   +1 It's Div1 B, not Div2.
•  » » » 7 years ago, # ^ |   0 are u sure u participated in div1????!!!!
•  » » » » 7 years ago, # ^ |   0 I'm sure I did B Div1 (D Div2) though....yeah, now I reviewed my solution, I agree that it's hard to implement and has no special algorithm. Sorry for the confusion. (I must not take contests at 1 AM.)
•  » » 7 years ago, # ^ |   0 No idea on how to calculate number of numbers with at least some number of lucky digits in a range... I suck.
 » 7 years ago, # |   -22 Why all on codeforses.ru are on english?
 » 7 years ago, # |   +5 Fast testing: Is it our christmas's gift?
 » 7 years ago, # |   +18 That awkward moment when you can't decide, whether to try the next problem or to start hacking other's solutions.
•  » » 7 years ago, # ^ |   0 When the system tests start?
•  » » » 7 years ago, # ^ |   0 Started already, enter the contest and see the "Status" tab
•  » » » » 7 years ago, # ^ |   0 ok thanks
 » 7 years ago, # | ← Rev. 2 →   +16 WOW new feature in codeforces that when hacking, every code that you have seen it before will colored in green to make it easy to know what codes you have not seen it yet.
•  » » 7 years ago, # ^ |   0 It was already on the previous contest. And yes, it is awesome. But I'm disapointed that we can't reset the colors (like "mark as non read" for client mail).
 » 7 years ago, # |   +18 I found someone submitted only his template code and got passed. Maybe Div1 Problem B is a previous used problem. Look at these submissions: 2812620 2812759
 » 7 years ago, # |   0 Just finished up my first contest at CodeForces . I attempted the first three problems in Division 2 and spent rest of time trying to figure out problem D , but to no avail . I have a question : Do the hacks have to made within the 2 hours of the contest itself . And can I hack within my room only or elsewhere also . Can I hack a solution of problem that I have personally solved or can I hack solution to any problem . I was thinking that hacking phase would be after 2 hours . I recently started participating topcoder.com SRM's and there hacking phase which is called challenge phase starts after the coding phase . They have 75 minutes coding for 3 problems , 5 minutes intermission and then 15-20 minutes of hacking phase . I guess I had to press the hacks tab during the contest to be able to hack . Still have not seen the interface of hacking . Tell me something about it .
•  » » 7 years ago, # ^ | ← Rev. 2 →   +1 1- in 2 hours2- your room only3- only problems that you solved after locking it
•  » » 7 years ago, # ^ |   +26 FAQ page is not meant only to make the menu bar bigger .You should go through the rules here
 » 7 years ago, # |   +9 fast system test :)
 » 7 years ago, # |   +7 Good round overall, but i couldn't submit any hacks on problem C div 2.
 » 7 years ago, # |   0 Thanks @kingofnumbers What is the process of locking the solution . I didn't lock any solution . I just submitted and watched the message that it has passed pretests . I have not suffered because of that because system testing of DIV 2 has ended and I can see myself in final standings with points of all 3 problems I did . Do I need to do something else also to lock my solution of just a submit means locking . Or is there some concept of lock once I click on the "Hacks" tab . ????Meanwhile I too feel like many , that the first 3 problems were too easy and last 2 two too difficult . Some medium level problems were missing , I feel .
•  » » 7 years ago, # ^ |   0 You can lock your problems by going to the dashboard of the contest and clicking on the lock icon aside of the problem you have solved.
•  » » 7 years ago, # ^ |   0 don't be afraid, you will get points on problem that you solved even if you did not lock it, but you may lock it if you want to hack the others' solution , locking a problem means that you can't resubmit your solution again if you find a bug in your solution
 » 7 years ago, # |   +28 red ^_^ thanks for the contest
•  » » 7 years ago, # ^ |   +2 Congratulations! Waiting for Div 2 rating update, hopefully I will be first time in Div1. And just before new year, like a new year gift
•  » » 7 years ago, # ^ |   +1 Congratulations!~
 » 7 years ago, # |   0 time limit for C problem in test 17，the id is 2814562。help
 » 7 years ago, # |   -43 the contest was terrible. you sucked with your problem set.
 » 7 years ago, # |   -6 How soon are the ratings likely to be updated . I want to know whether I will be eligible for next Div2 contest which is happening soon or will I be promoted to Div 1 . I have 376 rank in Div 2 today .
•  » » 7 years ago, # ^ |   0 Sorry, but you can be sure you'll remain in Div2
•  » » 7 years ago, # ^ |   +1 I think to be eligible for Div1 for first-comers(rating 1500), you need to have a rank of 5+ or so.My experience: Rank 16-> Rating 1476->1663Anyway my rating is going to drop >_<
•  » » 7 years ago, # ^ |   +8 You are in div2 for sure. the real question is will you be blue or green?.
•  » » 7 years ago, # ^ |   +3 about 1550 I think ....
 » 7 years ago, # |   0 I cant believe it. My submission number 2812603 passes the test case 11 (458754) for which it gives the answer 667496909 on my computer.
•  » » 7 years ago, # ^ |   0 It is giving correct in custom test as well, better contact the admins.
 » 7 years ago, # |   0 Yeah! Finally div1
•  » » 7 years ago, # ^ |   -6 +1
 » 7 years ago, # |   0 Now waiting for the tutorial
 » 7 years ago, # |   +7 what happened!! my code still running!!! after updating new ranking !!!http://www.codeforces.com/contest/259/standings/page/42Problem A, Div-2. 00:07:28 Running on test 31 [final tests] → 2808294
•  » » 7 years ago, # ^ |   +1 i lost 87 points... showing my rank 823.. what the is this??? @codeforces authority.
•  » » 7 years ago, # ^ |   0 AC now, after sending mail to admin, but rating not yet updated..... hope to recover the bug soon.... :)
 » 7 years ago, # |   0 Why these submissions got TLE? I don't have a clue.
•  » » 7 years ago, # ^ |   +1 In the first submission you calculate strlen(A) in every iteration of main loop. There are exactly strlen(A) iterations of main loop, so you solution is O(strlen2(A)), it is about 1010 operations, so TL.
•  » » » 7 years ago, # ^ |   -10 Thanks. I had thought the compiler or CPU may cache this constant.
•  » » 7 years ago, # ^ |   0 About first submission — strlen function works in O(n) timeAbout second submission — I don't know Java at all, but it seems that this code res+=line.charAt(i); works in O(n) time
•  » » 7 years ago, # ^ |   +5 len.charAt(i) is O(1) but res = res + len.charAt(i) uses string concatenation which is O(n) because a new string object is being created
•  » » » 7 years ago, # ^ |   0 You are right, thanks.
 » 7 years ago, # | ← Rev. 3 →   +10 There's something wrong in test program on div2 A. Somebody prints "No" as the result(2817648), but the answer should be "NO". I tried to hack it, but failed.
•  » » 7 years ago, # ^ |   0 Maybe validator check the first later of output :D
 » 7 years ago, # |   +9 why am I div 2 winner? noh4h_ss won the contest. no?
•  » » 7 years ago, # ^ |   -15 Div 2 problem 2 Can anyone explain this program for finding main diagnol values??main() { int i,j,a[3][3],b,c; for(i=0;i<3;i++) for(j=0;j<3;j++) scanf("%d",&a[i][j]); c=a[1][0]+a[1][2]-a[2][0]-a[2][1]; b=(a[0][1]+a[0][2]-c)/2; a[1][1]=b; a[0][0]=a[1][0]+b+a[1][2]-a[0][1]-a[0][2]; a[2][2]=a[1][0]+b+a[1][2]-a[2][0]-a[2][1]; for(i=0;i<3;i++) { for(j=0;j<3;j++) printf("%d ",a[i][j]); printf("\n"); } return 0;}