### tourist's blog

By tourist, history, 6 months ago, translation, ,

Hello 2018!

If you're still thinking what to do on the eighth day of year 2018, pay attention! The first round for both divisions of the new year starts on January 8 at 17:35 Moscow time (what about other timezones?).

Four important components of Hello 2018 will be the same as in Good Bye 2017:

• Div1 + Div2 combined
• 8 problems
• 2 hours 30 minutes
• Rated

But there will also be a substantial difference:

• Different problems

The problems of this round have been proposed and prepared by YakutovDmitriy, BudAlNik and myself.

Thanks to everyone without whom this round wouldn't be possible as well: AlexFetisov, Golovanov399, KAN, MikeMirzayanov, PavelKunyavskiy, qwerty787788, VArtem, winger.

Good luck!

Scoring distribution: 500 — 750 — 1000 — 1250 — 1750 — 2250 — 3000 — 3500.

Problem tutorial can be found here.

Congratulations to the winners!

Announcement of Hello 2018

•
• +2848
•

 » 6 months ago, # |   +175 The difference is pretty substantial and unique.
 » 6 months ago, # |   +58 How sweet we have tourist as a contest writer. Looking forward to the contest.
•  » » 6 months ago, # ^ |   -66 Yeah thanks to him we have the first hello contest of the whole time
 » 6 months ago, # |   +260 Now I have a legitimate reason to skip school.
•  » » 6 months ago, # ^ |   +127 And work.
•  » » 6 months ago, # ^ |   +141 And porn
•  » » » 6 months ago, # ^ |   0 haha ^o^
•  » » 6 months ago, # ^ |   +51 And sleep
•  » » 6 months ago, # ^ |   -19 and exam
•  » » » 6 months ago, # ^ |   +2 Why So Serious? :p :p
•  » » 6 months ago, # ^ |   +18 and food
•  » » 6 months ago, # ^ |   +64 and downvoting this comment.
•  » » » 6 months ago, # ^ |   -11 :)
•  » » 6 months ago, # ^ |   -27 and minecraft
•  » » 6 months ago, # ^ |   -27 And gaming
•  » » 6 months ago, # ^ |   0 ِAnd University
 » 6 months ago, # |   +409 Wow, wasn't expecting a round with different problems, you guys are full of surprises!
 » 6 months ago, # | ← Rev. 3 →   +50 i can see contestRegistrants in Hello 2018 > Goodbye 2017UPD: and most of them will be Legendary grandmaster
 » 6 months ago, # |   -119 i hope that there will be no math problem ...
 » 6 months ago, # |   +543 And Thanked Mike :D
•  » » 6 months ago, # ^ |   -44 It isnot fany mem
 » 6 months ago, # |   -13 WoW , Contest writer tourist , eagerly waiting for the contest.
 » 6 months ago, # |   +46 Registration goal-10k :-)
 » 6 months ago, # |   +590
•  » » 6 months ago, # ^ |   +9 And now tourist gonna be Top Contributor after Hello 2K18 :)
 » 6 months ago, # |   +106
 » 6 months ago, # |   +55 But there will also be a substantial difference: Different problemsBest announcement <3
•  » » 6 months ago, # ^ |   +13 I'm not sure I understand this statement.
•  » » » 6 months ago, # ^ |   +19 He said "Four important components of Hello 2018 will be the same as in Good Bye 2017: ..." before this.
•  » » » » 6 months ago, # ^ | ← Rev. 2 →   -8 In my case, I was seeing "Other problems" instead of "Different problems", and I thought he meant 8 problems + other problems. But then it's no longer 8 problems :p But then they fixed it. Not sure why I saw "other problems"
•  » » » 6 months ago, # ^ |   0 But there will also be a substantial difference:Different problemsDifferent writers!
•  » » 6 months ago, # ^ |   0 Also usefull
 » 6 months ago, # |   +21 Is this the first Hello contest ever made?
•  » » 6 months ago, # ^ |   -14 yes
•  » » 6 months ago, # ^ | ← Rev. 3 →   0 No, in 2015 there was such contest. It was put into gym and was unrated, but there was an announcement and countdown to it on homepage etc. http://codeforces.com/gym/100570EDIT: Oh, actually it was already mentioned below, I have not seen it before posting it.
 » 6 months ago, # | ← Rev. 3 →   0 Best announcement ever!!Don't miss the chance to hack legendary grandmasters (reals and fakes) :D
 » 6 months ago, # | ← Rev. 2 →   -99 .
•  » » 6 months ago, # ^ |   +54
 » 6 months ago, # |   +21 Nice, one of my biggest competitors setting the problems this time, gonna be fun mate!
•  » » 6 months ago, # ^ |   +45 It is less obvious if you change your icon too.
•  » » » 6 months ago, # ^ |   -45 lol its the real me this time
•  » » 6 months ago, # ^ |   -28 ЗБ ФЕЙК
 » 6 months ago, # | ← Rev. 2 →   -51 Highest ranked person on CF will not be able to participate
 » 6 months ago, # |   -40 So, round by tourist for both divisions and without any purple guys as problemsetters... Seems to be my very chance to stop performing THAT shitty on contests.
•  » » 6 months ago, # ^ |   +62
•  » » » 6 months ago, # ^ |   +5 Your contest was good bro, but you should have given little bit easier problem C.
•  » » » 6 months ago, # ^ |   -6 Your contests aren't shitty :)
 » 6 months ago, # | ← Rev. 2 →   -208 Неплохое начало нового года!)
•  » » 6 months ago, # ^ |   -29 Hahaa nice one
 » 6 months ago, # |   +64 Let's not forget the idea of the first Hello contest was from the Sith
•  » » 6 months ago, # ^ |   -88 attention whore
 » 6 months ago, # |   -15 I'm really waiting about this contest. I hope that will be a good contest for us.
 » 6 months ago, # |   -51 3.14-rated
•  » » 6 months ago, # ^ | ← Rev. 2 →   -27 -_-
•  » » 6 months ago, # ^ | ← Rev. 8 →   -9 3.14 rated? reminds me of...
•  » » 6 months ago, # ^ |   +15 sounds like "pirated"
•  » » » 6 months ago, # ^ |   +7 C'mon! I said the same thing but got 17 downvotes :/ doesn't anybody know "Monkey D Luffy" ?!
 » 6 months ago, # |   -26 It's going to be a perfect Hello 2018 :)
 » 6 months ago, # |   0 Tourist is going to be first contributor by the end of the contest!
 » 6 months ago, # |   0 Hello 2018.
 » 6 months ago, # |   +18 This time I don't even have to bet for 10K+ registrants, so I bet for tourist becoming Top contributor! :v
 » 6 months ago, # |   -15 *short sad story ...
•  » » 6 months ago, # ^ |   0 He still has a shot at solving C
 » 6 months ago, # |   -35 Tourist is so overrated. He says anything and people will upvote him
•  » » 6 months ago, # ^ |   +37 Metsuka is so underrated. He says anything and people will downvote him :(
•  » » » 6 months ago, # ^ |   -10 Let's see who gets more upvotes or downvotes!
 » 6 months ago, # |   +7 Short statements please!!!
 » 6 months ago, # |   0 I hope know who of the setters did every problem, at least at the end of the competition, but I really want to know during the real competition. Is like knowing who you are facing when you solve the problem.
•  » » 6 months ago, # ^ |   -28 You are facing thousands of other contestants bro
 » 6 months ago, # |   -13 I can't wait to see these problems.
 » 6 months ago, # |   +7 Logic Codeforces: participated in previous contest on 5/1/2018 and then the 8/1 is Hello 2018 ?? :D ??
•  » » 6 months ago, # ^ |   -31 We are pupil so we don't have right to express our opinion, or else we will be downvoted!
•  » » » 6 months ago, # ^ |   +3 nahh nevermind, just speak up what you think tho, as long as they are not offensive
•  » » » » 6 months ago, # ^ |   -10 I wasn't offensive and they downvoted me!
•  » » » 6 months ago, # ^ |   +9 you get downvoted because you are rude and cancerous, I doubt most people have so much free time to click into your profile to know that you are pupil before downvoting
•  » » 6 months ago, # ^ |   -8 maybe the logic is 2018 is 8th year in this decade, so hello 2018 on 8th day of this year?
•  » » » 6 months ago, # ^ |   +43 nah. 2018 is 9th year to be correct
•  » » 6 months ago, # ^ |   0 The other contest wasn't for both divisions
 » 6 months ago, # |   -18 well it seems , the contest has legitimate reasons to cross 10k registrants.#Tourist.
 » 6 months ago, # | ← Rev. 7 →   +27
 » 6 months ago, # |   -22 Finally a round that tourist can't take the first place :D
•  » » 6 months ago, # ^ |   +16 You should say: "tourist can't even pass the pretests".
 » 6 months ago, # |   0 Can any body tell me if i should sleep to prepair for the next day's exam or ... well forget it!
 » 6 months ago, # |   0 Now I wish I hadn't registered for a word games contest in my college. This will be sadly missed :(
•  » » 6 months ago, # ^ |   +27 This will be sadly missedYou mean the word games contest right?
•  » » » 6 months ago, # ^ |   0 No he means contest held by guy named tourist.
 » 6 months ago, # |   0 Not sure if I should rejoice that tourist is the round writer .. or wish my rating good bye
 » 6 months ago, # |   0 With 1100+ uvotes on this announcement , tourist gonna top 2nd leaderboard too.:)
 » 6 months ago, # |   +90 chinese boy again changed his handle OO0OOO00O0OOO0O00OOO0OO
•  » » 6 months ago, # ^ |   +80 GG...now the size of this table should be increased to fit in the page.
•  » » » 6 months ago, # ^ |   +95 Or 10 other people should try hard to keep him out of the table.
•  » » » » 6 months ago, # ^ |   -13 9 other is enough I guess :P
•  » » » 6 months ago, # ^ |   +32 That's the most unsatisfying thing I've seen today
•  » » » 6 months ago, # ^ |   0 Or just trim the display after 16 chars
 » 6 months ago, # |   -31 I dont knoy inglish( I cant anderstend yu(((
 » 6 months ago, # |   +9 up to 10K
 » 6 months ago, # |   0 can you please tell me , what does it mean by "different problems" ?? i think every problem is different , from different tags like number theory , graph , dp , dfs/bfs , dsu , data structures ,ad hoc etc .but i can't understand why "Different problems" is specialized in the blog , can anyone explain ???
•  » » 6 months ago, # ^ |   0 I believe that's joke. "Different" = "Not the same"[as in "Goodbye 2017"].
•  » » » 6 months ago, # ^ |   0 Yah , I think so :D :D
•  » » » » 6 months ago, # ^ |   +3 It's just like saying "Hah you are so smart".
•  » » » » » 6 months ago, # ^ |   0 ya ya ya :D :D
 » 6 months ago, # |   +10 Yea, eighth day of 2018 is great time to finish new year's eve parties and write some contest :3 But please, could somebody remind me, why is tourist organizing another contest and I still haven't do anything to have my own one?
•  » » 6 months ago, # ^ |   +15 Oh, yea, I remember now, I'm so lazy, that's te reason... So hoping to see great tasks from you :D
•  » » » 6 months ago, # ^ |   +56 Let's see if you can get upvotes by changing your color to nutella.
•  » » » » 6 months ago, # ^ | ← Rev. 2 →   +36 Yea, I've just noticed it... Really, all the time I'm getting upvotes only because of nutella? ;_; I now feel upset, so much racism on codeforces :/ And on the other hand, seriously, no one recognizes me? So much effort, so much tiring and no one recognizes Radewoosh...?
•  » » » » » 6 months ago, # ^ |   +3 Life of !reds is like this
•  » » » » » 6 months ago, # ^ |   -9 Well, I recognize you..(yo mama's nephew or best friend)
•  » » » » » 6 months ago, # ^ | ← Rev. 2 →   +23 I recognize you Mateusz!! But not just because of your efforts and nutella, we were sitting next to each other at IOI! :))
•  » » » » » 6 months ago, # ^ |   0 Dude i do. You were like a star when became nutella. With to 1 places in a row. That was really cool! What was the judge you mainly worked on?
•  » » » » » 6 months ago, # ^ |   +92 Make Radewoosh Great Again!
•  » » » » » 6 months ago, # ^ | ← Rev. 2 →   +3 Would you yield me an autograph if I say I do? :D (you won my contest if anything xD)
•  » » » » » 6 months ago, # ^ |   +89 pfff people recognize swistakk, not you
•  » » » » » » 6 months ago, # ^ |   +18 Are you trying to start a civil war in Poland?
•  » » » » » 6 months ago, # ^ |   +10 I also recognize you Mateusz!!! (^o^)/
•  » » » » 6 months ago, # ^ |   +10 Holy crap it worked
•  » » 6 months ago, # ^ |   -17 Because you are still expert :V
 » 6 months ago, # |   0 username should have a valid length. This is totally embarrassing
•  » » 6 months ago, # ^ |   +38 It's palindrome though!
•  » » » 6 months ago, # ^ |   +217 Nah, the first letter is black, while the last is red.
•  » » » » 6 months ago, # ^ |   0 Yah, it could be a mirrored palindrome too if the last become black.
•  » » » » 6 months ago, # ^ | ← Rev. 2 →   +48 Not if I don't see color.
•  » » 6 months ago, # ^ |   +5 It looks like a reflection, if you look carefully it's like water moving. :D
•  » » 6 months ago, # ^ |   +7 This is clearly a sound wave with compressions and rarefactions
•  » » 6 months ago, # ^ |   +36 He Should Got HANDLE_LIMIT_EXCEEDED
•  » » » 6 months ago, # ^ |   +28 He successfully hacked codeforces design
 » 6 months ago, # |   +88 is it rated?? please don't downvote today is my birthday.
•  » » 6 months ago, # ^ | ← Rev. 2 →   +19 Let's see if this innovative strategy worksP.S Please don't downvote today is my birthday
•  » » » 6 months ago, # ^ |   +17 thanks for the popcorn mate meet you @ the party
•  » » 6 months ago, # ^ |   +56 Can't wait for tommorow so I can downvote you
•  » » 6 months ago, # ^ |   +1 Happy birthday ，aha
 » 6 months ago, # |   0 Good Time! I don't have to skip class that day. Excited.
 » 6 months ago, # |   +1 Before the contest ... tourist will be the first on the Top contributors list :)
 » 6 months ago, # |   -46 Codeforces...you are supposed to remove Christmas decorations before January 5th...it is bad luck to keep them up longer than that. I suggest you alter the logo back although I don't know if it's binary or gets worse the longer you leave it, damage may already have been done
 » 6 months ago, # |   +38 Dang!
 » 6 months ago, # |   0 Love that Codeforces does new things.
 » 6 months ago, # |   +18 The comment is hidden because of too negative feedback, click here to view it
 » 6 months ago, # |   -7 I hope that OO0OOO00O0OOO0O00OOO0OO will be the winner of the contest.
 » 6 months ago, # |   -40 I am so shocked that no one has asked it, Is it rated though?
 » 6 months ago, # |   +102 Mike did it :D The Art of Errors Handling...
•  » » 6 months ago, # ^ | ← Rev. 3 →   -9 And the first character isn't black!UPD: eh, sorry for the comment, it's him trying Grandmaster.
•  » » » 6 months ago, # ^ |   -83 He plays with the handle and colors like a kid ! it was bad behavior to change the handle in such way just to ruin the CF page design ! such a RED Coder must be more wise and contribute to make this place better.
•  » » » » 6 months ago, # ^ |   -27 Very true! Very wise!
•  » » » » 6 months ago, # ^ |   +78 He actually contributed in making the place better by making Mike add the handling for long handles :)
 » 6 months ago, # | ← Rev. 2 →   +1 That moment when I see Div-1 Coder's code failed on system test and my code get AC on same problem :D
•  » » 6 months ago, # ^ |   +30 The moment i see U talking about Div1 Coders and you are PURPLE :D
•  » » » 6 months ago, # ^ |   +5 it's all about New Year magic :)
•  » » » » 6 months ago, # ^ |   0 yes i know , Work hard to make this magic real Bro :)
•  » » » » » 6 months ago, # ^ |   +4 Yes I will try, Thanks :)
•  » » » 6 months ago, # ^ |   +12 Why are you commenting everywhere? -_-
•  » » » » 6 months ago, # ^ |   -7 For Contribution I guess :p
•  » » » » 6 months ago, # ^ |   0 You Created a new a count just to ask this question ! :/ ياض يا قليل :D
 » 6 months ago, # |   -19 So,say "Hello" to Codeforces with "Hello2018" contest :)
 » 6 months ago, # | ← Rev. 2 →   -15 Look at the Top Contributors list. Only Two more then Top Rating and Top Contributor tourist Love You :). You Are my first crush <3
•  » » 6 months ago, # ^ | ← Rev. 3 →   +7 Or maybe just one??
 » 6 months ago, # |   0 Looking at the large number of upvotes for this blog post, I can't wait to see number of registrants exceed 10000
 » 6 months ago, # |   +97 Can you consider: Making drain lower? Turning "handle magic" off for the contest?
 » 6 months ago, # |   -14 please dont hurt me with hardy problems daddy:(
 » 6 months ago, # | ← Rev. 2 →   -15 tourist Hey Bro :) If you reply me I will show this to my school mates
 » 6 months ago, # |   +109
•  » » 6 months ago, # ^ |   0 Ugh. Sniping the typography nerds with that kerning.
 » 6 months ago, # | ← Rev. 2 →   +6 World War 4 in next few minutes
•  » » 6 months ago, # ^ |   +5 is that M. Bison on your icon?
•  » » » 6 months ago, # ^ |   +8 yes
•  » » » » 6 months ago, # ^ |   +7 glad to see another sf fan here
 » 6 months ago, # |   +5 tourist finelly get the first place of the Top contributors :Dwell done
•  » » 6 months ago, # ^ |   +8 with the minimum number of Blogs :D
 » 6 months ago, # |   +7 Lovely scoring distribution
•  » » 6 months ago, # ^ |   +2 but I think problems will not be that easy
 » 6 months ago, # |   +3 Hope, codeforces server work fine during the contest.
 » 6 months ago, # |   +3 10 min delay
 » 6 months ago, # |   +2 We have less than one minute so good luck to everyone!
•  » » 6 months ago, # ^ |   +5 Oh no, delay
 » 6 months ago, # |   +8 Yeah Sure , Let's wait for 10k participants!!
 » 6 months ago, # |   +16 It seems that we have more 10 mins to prepare the contest :)
 » 6 months ago, # |   +6 Anyone facing this?
 » 6 months ago, # | ← Rev. 2 →   0 9K participants, yeeeeee
 » 6 months ago, # | ← Rev. 2 →   -10 They are waiting for the total number of registrations to get 10000. Very greedy
 » 6 months ago, # |   +156 Tourist can never create a complete problemset on his own, because he can't tell the difference between div2A-D
•  » » 6 months ago, # ^ |   0 uh no he can, that's what a god-like problem-setter does.
•  » » » 6 months ago, # ^ |   +6 He's a god-like problem-solver.
 » 6 months ago, # | ← Rev. 2 →   0 Wow. More than 9K registrants.
 » 6 months ago, # |   +6 Extra 10 minutes for 10k registrants :)
 » 6 months ago, # |   0 my first contest of 2k18 ..very excited !!
 » 6 months ago, # | ← Rev. 2 →   -8 codeforces hacking system is such a disaster now!
•  » » 6 months ago, # ^ |   +11 I can't even try to hack anybody cause my flash player isn't up to date :'/
•  » » » 6 months ago, # ^ |   0 me too :(
•  » » » 6 months ago, # ^ |   0 Use mozilla
 » 6 months ago, # |   0 Dear Admin , Please make sure that system testing is fast today unlike GoodBye Contest. :)
 » 6 months ago, # |   0 for A, is it possible to hack solutions of this form: cout << m % (1 << n); ??
•  » » 6 months ago, # ^ |   +2 no all possible is blocked
 » 6 months ago, # |   0 Is D ternary search on k?
•  » » 6 months ago, # ^ |   +21 binary search on k
•  » » » 6 months ago, # ^ | ← Rev. 2 →   -6 When k is small, we have many options to choose from. So just greedily choose the least time consuming problems from sorted vector(acc. to 'a'). This gives a situation where every problem we pick contributes to score. But as k is small, this score is low.When k is large, we don't have many options to choose from. So, we have many questions we can attempt, but not all of them might contribute to score, either due to not enough options with a value greater than k, or due to time.So, on both sides of optimal k, we get lower scores.
•  » » » » 6 months ago, # ^ |   0 Nope. Doesnt make sense at all. Its clearly binary search.
•  » » » 6 months ago, # ^ |   0 I somehow got WA with that.
 » 6 months ago, # | ← Rev. 4 →   +15 When you try to be newbie and fool the predictor:
 » 6 months ago, # |   0 Very clear problem, but so hard to me. Thank you
 » 6 months ago, # | ← Rev. 2 →   0 Was the hack 30 100000000 invalid for problem A?
•  » » 6 months ago, # ^ |   0 I don't know how A was passing this test case.. I too tried to hack with similar test but failed which resulted in demotivation and regret of why the fuck I tried to hack and now I am going to be ripped off dark blue.
•  » » 6 months ago, # ^ |   0 Maybe you are missing the endline between 30 and 100000000
•  » » » 6 months ago, # ^ |   0 I tried again with 30 (and in the next line)100000000 but it showed "ignored".
 » 6 months ago, # |   0 I couldn't get my code to compile, since apparently __int128's don't exist on CF? http://codeforces.com/contest/913/submission/34030034
 » 6 months ago, # |   0 What is the 6th test in C?
 » 6 months ago, # |   +6 Please can anyone tell approach for 'C'?
•  » » 6 months ago, # ^ |   -6 If cost[i] < cost[i-1], we can just take 2^i objects instead of 2^(i-1). Just find the answer from binary representation of L.
 » 6 months ago, # |   0 Problem D seemed really fascinating but couldn't really think how to approach it !! Anyone who solved, can explain the idea behind it?
•  » » 6 months ago, # ^ |   0 binary search on k
•  » » » 6 months ago, # ^ |   0 That's Nlog^2 right? I thought that it is possible to have a gap in ks, but it wasn't true so I missed this solution. But I wanted to make sure that I haven't missed a more efficient solution (mine is NlogN, but the difference shouldn't matter)
•  » » » » 6 months ago, # ^ |   0 No, its NlogN. You can sort array t before binary search, and then you simply need one traversal inside binary search. But, you need to keep arrays a and t together, i mean, sorting array t will mix indexes, but you can keep vector of pairs or something to keep a_i and t_i together always.
•  » » » » » 6 months ago, # ^ |   +4 Ohh shit, you're right. And it was much easier to code.
•  » » 6 months ago, # ^ |   +5 I think binary search, actually im pretty sure. First, sort t_i but keep a_i with them ( you can make vector of pairs). You binary search for res, and you go through array a and ask if a_i is bigger than res, if yes add t_i to sum. If you can add exactly res elements so that sum is less or equal to T, then just lo = mid + 1, othervise hi = mid- 1.
•  » » » 6 months ago, # ^ |   +1 Shouldn't you check if a_i is >= res and not bigger than res. I used the first one and got WA.
•  » » » » 6 months ago, # ^ |   0 Yes, >= , my bad.
•  » » 6 months ago, # ^ |   0 We want to maintain multiset of times for value K when we do a cycle for k from n to 0. Just add all problems with a=k and check if first k elements sum of the set is <=T.
•  » » 6 months ago, # ^ |   0 I've done ternary search by the a[i] ( the min value of a[i] that will appear in the answer ). I was late to submit. So, maybe someone did it with the same approach?
•  » » 6 months ago, # ^ |   0 I did not use binary search or ternary search. I tried all possible answers in decreasing order maintaining the best set of problems so far, in such a way that each problem is added and removed from the set at most once. So it works in : solution.
 » 6 months ago, # |   +3 Problem D is binary search, I didnt have time to submit solution, I was late for few seconds literally..
•  » » 6 months ago, # ^ |   0 Mate! Just the same. Understand your feelings :(
 » 6 months ago, # |   +185
 » 6 months ago, # |   +25 I hope there is an elegant solution for problem E. It would be an implementation hell otherwise.
•  » » 6 months ago, # ^ |   +29 you need to think in terms of graphs and do some sort of shortest path algorithm which obeys given grammar
•  » » » 6 months ago, # ^ |   0 What about the lexicographical thing?
•  » » » » 6 months ago, # ^ |   0 Will the simplest brute force work? Just iterate through all the possibilities of the combination of logic...It is not that slow I think.
•  » » » » » 6 months ago, # ^ |   0 I thought it work at first, but turned out that some of the answer is really long (more than 12 character), so brute force didn't work.
•  » » » » » » 6 months ago, # ^ |   0 So I mean the brute force with minimal branch-cutting. The point is that the brute force must be implemented correctly.And yes I think it is hard to debug because some of the expressions are really weird.
•  » » » » » 6 months ago, # ^ |   +1 I did that and since possiblities are just 256.I hardcoded them
•  » » » » » » 6 months ago, # ^ |   0 I saw your solution. How did you come up with the wierd formulas?
•  » » » » 6 months ago, # ^ |   0 here is distance is the string and we can write comparator for that as required.
•  » » 6 months ago, # ^ |   0 The implementation is not that bad. Just follow the grammar. The problem, though, it's one of the biggest piles of shit I have ever seen
•  » » 6 months ago, # ^ | ← Rev. 3 →   +23 here is simple code. http://codeforces.com/contest/913/submission/34031760
 » 6 months ago, # | ← Rev. 2 →   +2 How can someone take n-1 integers as input using this loop and get pretest passed in problem B ?? Or am I missing something ??!!
•  » » 6 months ago, # ^ |   0 It is given that vertex 1 is the root!
•  » » » 6 months ago, # ^ |   +6 Looks like you didn't get my point. After n, there are n-1 inputs in the problem. But, this man loops from o to n-1, that means he takes n integers. How did he even get output ??!!
•  » » » » 6 months ago, # ^ |   +1 There is input stream closing. When stdin closes scanf doesn't wait for input, it just returns 0. Question is what is u. I don't know, but i presume, that u is dublicate from previous iteration.
 » 6 months ago, # |   0 Shitty Bug ! Spent 1 and half hour on a stupid bug!
 » 6 months ago, # |   -11 Really elegant contest with clear statements. Thank you.
 » 6 months ago, # | ← Rev. 3 →   +10 I'm sure that this: cin >> n >> m; cout << m % (pow(2, n)) << endl; Passes system tests, in div2 A.
 » 6 months ago, # |   +51 You know that sweet feeling when you've been debugging a source that is correct because it fails the example because the modulo is not the standard 1e9 + 7? Well now I do and it hurts like shit especially when I solved the problem 20 minutes before the end of the competition and I just found the bug...Anyway, apart from my mistakes, E was a total shit and I regret that I upvoted the contest
 » 6 months ago, # |   +4 matthew99 finally makes a comeback. Congratulations !
•  » » 6 months ago, # ^ |   +105 Don't say this before system test. I'm scared.
•  » » » 6 months ago, # ^ |   +4 :(
•  » » » » 6 months ago, # ^ |   +38 I see why fear is my enemy.
•  » » 6 months ago, # ^ |   +1 his solution to C failed system test :(
 » 6 months ago, # |   +96 CF's hack system is a total disaster. It should be disabled IMMEDIATELY until admin replaces it's flash-based hack interface
•  » » 6 months ago, # ^ |   +21 At least AhnLab is not required! haha
 » 6 months ago, # |   +10 Similar problem E link only output length.
 » 6 months ago, # |   +30 When you realize after contest that in D it's a[i]<=m to count instead of a[i]>=m. -_- fml fmr(rating)
•  » » 6 months ago, # ^ |   +1 i also thought same for 1 hour lol
•  » » 6 months ago, # ^ |   +1 Wtf, me to))
•  » » 6 months ago, # ^ |   0 I think i've messed it up because of the 1st test
 » 6 months ago, # |   0 what was the hacks for A and B ?
•  » » 6 months ago, # ^ |   +5 a was 26 100000000
•  » » » 6 months ago, # ^ |   0 the answer ?
•  » » » » 6 months ago, # ^ |   0 one of succcessive hacks
 » 6 months ago, # |   +25 It's true that Problem D is the final "Too Easy Problems" ? :) But anyway, nice contest and nice problems.
 » 6 months ago, # | ← Rev. 2 →   +6 On problem A --> How on earth this --> 34020785 submission passed the inputs test 1:10000001000000test 2:12123 12123test 3:123213123213Can anybody explain??
•  » » 6 months ago, # ^ |   0 Even I got an unsuccessful hack attempt on a similar solution. What I observed was that the value of s becomes some large negative (something like -9.XXXX * 10^9) and the modulo returns the correct, positive remainder. Although unsuccessful hack, I am impressed by the cleverness of those guys. I mean, cmon! The hackbait was TOO DAMN TEMPTING XD
•  » » » 6 months ago, # ^ |   -11 The problem setter is tourist. Can you imagine he haven't noticed that some Contestant will submit this type of solution and those who will try to hack this type of solution will get unsuccessful hacking attempt.Of course he did and that is why he is tourist. And thats how he can fool hackers
•  » » 6 months ago, # ^ |   +2 In C++ standard reference casting from double/float to int has undefined behavior if the result lies outside the range of representable values. In VC and G++ compilers it returns MAX_INT for overflowing and the modular works well.
 » 6 months ago, # |   0 I failed to hack lots of problem A solutions because of casting from double(in pow method) to int returned MAX_INT and the modular operator returns correct answer. (However in C++ reference, it talks about undefined behavior for overflowing). Anyway I learnt something new :-)
 » 6 months ago, # |   0 Ah...give me 10 more mins I can submit E...so sad.
 » 6 months ago, # |   0 In Problem A, will the code using power function for all n can get Accepted and if not can anyone help me with the hacks that can be used or if the answer is yes then why is it so because there will be overflow. (sorry about bad English.) Thanks.// C++ ll is long longll solve(ll n,ll m){ ll x = pow(2,n); return m%x; }
•  » » 6 months ago, # ^ |   0 Seems like casting double to int with overflowing surprisingly gives -2^31 as an answer. int(pow(2, 1000)) = -2147483648. And yes, because m <= 10^8, m % (-2147483648) = m (which won't not be true for m > 2^30 or something).
•  » » » 6 months ago, # ^ | ← Rev. 2 →   +3 m%INT_MIN=m is true for all 32 bit signed integers except m=INT_MIN. The reason is the way % operator is defined. a%b+(a/b)*b=a always holds true, and for b=INT_MIN, a≠INT_MIN, a/b when casted to int (rounded towards 0) returns 0. Thus, a%b=a follows.
 » 6 months ago, # |   0 Problem E of this contest is almost the same as today's Problem E.It makes me feel not so good that I struggled on E for about 1 hour only to give up and was told there was a similar problem on Codeforces just after the contest. Link
 » 6 months ago, # |   +53 Does the following work on H? I didn't have time to write it due to having too many bugs on G.Say the x1, x2, ..., xn split [0, 1] into n + 1 intervals: I1, I2, ..., In + 1. Now we do dp, with the observation that the answer on each interval is going to be a polynomial. The dp formula directly shows this. The rest is then just implementing some integrals to compute the density on a real number x after k steps.
•  » » 6 months ago, # ^ |   +43 Yes, basically that's it.
 » 6 months ago, # |   +8 E is totally same with http://codeforces.com/gym/100867 problem E I don't think it's good.
 » 6 months ago, # |   +5 can anyone please explain the approach for C?
•  » » 6 months ago, # ^ |   0 Can someone please share there approach please!
 » 6 months ago, # |   0 Anyone have a list of their solutions for all 256 functions in problem E? I can't figure out why I got WA, here's my list: https://pastebin.com/r6Curstb
•  » » 6 months ago, # ^ |   +5
•  » » » 6 months ago, # ^ |   0 such patience :)
•  » » » » 6 months ago, # ^ |   +10 Actually i did not have confidence if my original solution passes time limit or not.hence I did this.
•  » » » 6 months ago, # ^ |   0 good patience !
 » 6 months ago, # | ← Rev. 2 →   0 Why does my ternary search logic fail?When k is small, we have many options to choose from. So just greedily choose the least time consuming problems from sorted vector(acc. to 'a'). This gives a situation where every problem we pick contributes to score. But as k is small, this score is low.When k is large, we don't have many options to choose from. So, we have many questions we can attempt, but not all of them might contribute to score, either due to not enough options with a value greater than k, or due to time.So, on both sides of optimal k, we get lower scores.Edit : The test case I failed was due to > instead >=But, as others did it with binary search, I wonder where my ternary search logic has flaws.
 » 6 months ago, # |   +6 I created (and solved?) a harder version of problem D as I misread the problem statement as: A task will be taken into account to the final score if a[i] <= total_solved_task. (Indeed, I pass all the samples with this interpretation) And I wasted more than 100 minutes on it while 1k more contestants solved it :) It's time to become a Candidate Master :)
 » 6 months ago, # |   0 In hello 2018 round I wrote my submission to problem-C Party Lemonade, it ran well on geeksforgeeks c++14 compiler giving correct ans for test case 4 but the same code with same input gave wrong ans on codeforces c++14 compiler. why is it so.. mysubmission url:-http://codeforces.com/submissions/tibialAcorn98 submission no -34026659
 » 6 months ago, # |   0 In problem G, I add some last digits such that the result number N satisfies N % 2|N| = 0 and N doesn't end with 0 or 5. The rest is to find k such that N ≡ 2k modulo 5|N|. It seems to be done by induction.
•  » » 6 months ago, # ^ | ← Rev. 3 →   0 I thought the same thing but forgot that N % 2^|N| needs to be 0. If you can prove the minimum |N| needed, there's a way to find k in O(5^(|N|/2) * log(|N|)). Also, it looks like 2^i passes through all numbers not divisible by 5 on modulo 5^|N|. The way to find k is finding the numbers 5^(i * floor(sqrt(n))) and starting from the number you want going back (multiplying by floor(5^|N| / 2) + 1 that's the modular inverse of 2) until finding a number that's from 5^(i * floor(sqrt(n))).Edit: but probably there's a smarter way to solve it, something like getting the answer for 5^x using the answer from 5^(x — 1), since 2^i is a cycle through 5^(x — 1) and probably through 5^x so the answer for 5^x is i * size of cycle + answer for 5^(x — 1).
 » 6 months ago, # | ← Rev. 2 →   +3 Can someone please explain to me why this submission on problem D passes the pretests?On the first example test (which is usually the same as the first pretest), it outputs:2 2 3 4... implying that you get a score of 2 if you solve problems 3 and 4. But you don't, you get a score of 1 (since problem 3 requires 4 solved problems). Am I missing something or is the judge for this problem broken?EDIT: nevermind, it seems like I interpreted the statement wrong. I thought a[i] has to be smaller than the total number of problems, but in reality a[i] has to be greater than the total number of problems... and reading through the comments here, it seems like I'm not the only one :P
 » 6 months ago, # |   -12 D is straightforward binary search . Lost a good amount of time while debugging C ! :( . bad contest.
•  » » 6 months ago, # ^ |   0 Just because you can't handle overflow doesn't mean contest is bad >:(
 » 6 months ago, # |   0 Hello 2018 but with the old name... So sad
 » 6 months ago, # |   +11 I find this contest so much better than the good bye 2017. I'm very grateful to the authors.
 » 6 months ago, # |   +48
 » 6 months ago, # |   +9 Correct way to solve C?Also, hello 2018 and rating drop my old friend...
•  » » 6 months ago, # ^ | ← Rev. 2 →   +10 Let's update ci: ci + 1 = min(ci * 2, ci + 1). After this we may see that taking away 2N - 1 until L ≥ 2N - 1 is optimal since it's the smallest price we can get 2N - 1 litres for. Then there're two possibilities if there are remaining coins: you either take one more 2N - 1 or go and do the same thing for 2N - 2 till L ≥ 2N - 2 and so on.
•  » » » 6 months ago, # ^ |   0 Aha I see nice :) and Thank You
•  » » 6 months ago, # ^ |   0 Look at my code
 » 6 months ago, # |   +31 check this out that's why you are not red yet :v http://codeforces.com/contest/913/submission/34025378
•  » » 6 months ago, # ^ |   +16 And this submission:http://codeforces.com/contest/913/submission/34021142 Code clearly and only him using eval techniques with python. :)
 » 6 months ago, # |   0 What is TC 8 on problem C all about?
»
6 months ago, # |
-15

# include<bits/stdc++.h>

using namespace std;

int main(void) { long long m,n; cin >> m >> n; long long result; result=pow(2,m); cout << n%result << endl;

}

How this code got AC for problem A? I used repl.it compiler and it gave RE.

•  » » 6 months ago, # ^ |   0 update: sorry, it gives the correct answer.
 » 6 months ago, # | ← Rev. 2 →   0 failed :/and failed :'/and failed ×_×...HELLO, 2018!!!
 » 6 months ago, # |   +28 Is it just me or you also had these failed problem phases? in all last couple of contests, I had systest failed problems for stupid reasons, in all of them. I'm really stuck in this sh*tty rating because of the HUGE effect that a 1000 or a 500 point problem can have.You know what's my problem with codeforces? I can solve all of the "easy" problems in a relatively small time, for example, I solved the first four in 49 minutes, not bad, but I'm not using the extra one hour and half for anything (Sometimes hacking, but you always have this belief that you can solve another one). And I'm not alone, usually, the easy problems are solved by more than 1000 people at the end of the contest. the next problem is solved by like 100 people, of course, I can't easily solve it, there are 100+ GMs competing too and they couldn't.So what's the way for me to get a good rating? submit questions fast, if I don't I will get more penalty and since 1000 people already solved all of the easy problems, I will have a rank like 700+ which is not good. So I have to be fast. Alright, but getting pretest passed is also not a 100% guarantee to get a score of a problem. and when you fail to solve a problem what happens? you go miserably down on ranking.Even if I have many good contests one after another and I bring up my rating, again there will be another contest, super hard to solve more than 3, and you just need a silly mistake on A to fail and with only B & C for example go down terribly.I don't care about my ranking, I just don't like the feeling of being stuck in Div.2 for this long. Every time I have to solve things that are not really adding to my knowledge like Div2.A and Div2.B and a lot of times Div2.C.Tl;dr, I just want sort of contests on codeforces, that have a mellow decreasing number of people who could solve the problems. something like 3000, 1500, 700, 300, 50.
•  » » 6 months ago, # ^ |   +1 I believe that virtual participating in previous contests, with practicing on being careful and quiet during reading and solving problems, will decrease the possibility of failing in post-test in real contests.
 » 6 months ago, # | ← Rev. 2 →   +1 what's the easiest and fastest solution for C?please explain completely(not just like most of editorials :))UPD1:I read tutorial and it was easy and fast and complete enough :D
 » 6 months ago, # |   +1 Is rating predictor alright? Doesn't seem so by looking at the rating predictions.
•  » » 6 months ago, # ^ |   0 Things got pretty complicated in the predictor due to handle changes (newly-used handles will be identified as new users by the predictor, therefore, the prediction is way too different).
 » 6 months ago, # | ← Rev. 2 →   +3 one of my friend solve A with cryptography 34024600
 » 6 months ago, # | ← Rev. 2 →   0 Where is my problem?My 34026270 of problem C got WA on test case 55. :'( Anyone please help !
 » 6 months ago, # | ← Rev. 2 →   0 hi there i've a question about my problem B why this 34032197 sulotion should get acc while the MAXN = 1000 & somewhere i've used adj[1000] ????
 » 6 months ago, # |   0 That's the highest upvotes I have ever seen on any post !!!!
 » 6 months ago, # |   +11 My submission for problem D, fails on the 23rd test case, but the checker log is weird, I don't have access to the full test case, but my answer seems correct based on the little summary that I can see.
•  » » 6 months ago, # ^ |   +8 I think this error means that "You said max score possible was 89771 but the score calculated from the indices you printed is 89770"?Not 100% sure but it seems this way.
•  » » » 6 months ago, # ^ |   0 hmm. Yes, thank you. I feel I got what's my bug now.
•  » » » » 6 months ago, # ^ |   0 I had the same bug ;(
•  » » 6 months ago, # ^ |   0 it says that the 89772 items you chose gave you actual score of 89770 not 89771 as written in the first line of your output, so I think the mistake is not obvious by just looking to the summary
•  » » » 6 months ago, # ^ |   +1 Yes, I got accepted now. Also thanks to tourist for taking the time to read and debug my code.
•  » » » » 6 months ago, # ^ |   0 what?
•  » » » » » 6 months ago, # ^ |   0 I messaged him about it.
•  » » » » 6 months ago, # ^ |   0 Could you explain?Why your code gets wa?
•  » » » » » 6 months ago, # ^ | ← Rev. 2 →   +3 I explained you already in private message, anyway again:If you answer more questions than the actual number, it might make other questions useless. (does this sentence make sense?!)For example imagine we have infinite time to answer the questions and our "a" sequence is {2, 2, 2}. The answer is of course 2, but if we solve all three problems, we get 0 points.
•  » » » » » » 6 months ago, # ^ |