### Nickolas's blog

By Nickolas, 3 years ago, translation,

The contest is over; I hope you enjoyed it! The editorial is available here.

The 8th April Fools Day Contest will take place on Wednesday April 1st. This is a joke competition in which solving the problem is often easier than figuring out what the actual task is.

In this round you'll be given several weird problems and 2 hours to solve them. The contest will use ACM ICPC rules (no hacks, the standings are decided by the number of solved problems and penalty time earned on them), and it will be unrated. You can submit solutions in any language allowed by Codeforces, unless the problem says otherwise. To get an idea of what the contest will look like, you can check out the contests of the past years: 2012, 2013, 2014, 2016, 2017, 2018, 2019.

As usual, to enjoy competing in this round you'll need a sense of humor compatible with mine. Good luck, and have fun!

• +1014

| Write comment?
 » 3 years ago, # |   +104 This is a joke competition in which solving the problem is often easier than figuring out what the actual task is. It's the extreme of those hard-to-comprehend problem statements.
•  » » 3 years ago, # ^ |   +33 Is it rated?
•  » » » 3 years ago, # ^ |   +23 You are willing to know the solution of first problem I see :p
•  » » » 3 years ago, # ^ |   0 I saw a problem with a same name with this problem, I don't know if they are the same
•  » » » » 3 years ago, # ^ |   0 No, they're not.
•  » » » 3 years ago, # ^ |   -7 cout<<"NO"<
•  » » » » 3 years ago, # ^ |   0 is the contest rated
•  » » » » » 3 years ago, # ^ |   0 No
•  » » » » » » 3 years ago, # ^ |   +11 IT'S SHOWTIME TALK TO THE HAND "Aprilfool! It's rated!" YOU HAVE BEEN TERMINATED 
 » 3 years ago, # |   +22 Will the editorials be posted ?
•  » » 3 years ago, # ^ |   +57 Not before the contest :-) You can see that all past contests have editorials.
•  » » » 3 years ago, # ^ |   +14 How can you tell the truth?
•  » » » » 3 years ago, # ^ |   +39 With a lot of practice :-)
•  » » 3 years ago, # ^ |   +257 You better ask will there be problem statements
•  » » » 3 years ago, # ^ | ← Rev. 2 →   +5 Will there be problem statements?
•  » » » » 3 years ago, # ^ |   +66 Occasionally :-)
•  » » 3 years ago, # ^ | ← Rev. 2 →   +59 1st Plot twist:Contest cancelled
•  » » » 3 years ago, # ^ |   +275 Plot Twist 2: Contest is rated
•  » » » » 3 years ago, # ^ |   +53 Plot Twist 3: Contest will take place on April 2nd
•  » » » » » 3 years ago, # ^ |   +43 Plot Twist 4: Contest will start two hours in advance.
•  » » » » » » 3 years ago, # ^ |   +138 Plot Twist 5: Final standing will be the reverse of actual one.
•  » » » » » » » 3 years ago, # ^ |   0 Plot Twist 6: No time penalties on Wrong Submissions! xD
•  » » » » » » » » 3 years ago, # ^ | ← Rev. 2 →   +50 Plot Twist 7 : When we think there's a plot twist hidden but turns out there is no plot twist at all
•  » » » » » » » » » 3 years ago, # ^ | ← Rev. 2 →   +22 Plot Twist 8: contest will be onsite.
•  » » » » » » » » » 3 years ago, # ^ |   +30 Plot Twist 9: codeforces goes for maintainence during contest time.
•  » » » » » » » » » 3 years ago, # ^ | ← Rev. 3 →   -56 Plot Twist 10: We will be competing while living in artificial reality.
•  » » » » » » » » » 3 years ago, # ^ |   -60 Plot Twist 11: It's last plot twist
•  » » » » » » » » » 3 years ago, # ^ |   +85 Plot Twist 12: Plot Twist 11 was intentionally misleading.
•  » » » » » » » » » 3 years ago, # ^ |   +4 Plot twist 13: This is not a plot twist.
•  » » » » » » » » » 3 years ago, # ^ |   +33 Plot Twist 14: There is no plot.
•  » » » » » » » » » 3 years ago, # ^ |   +52 Plot Twist 15: There is no twist.
•  » » » » » » » » » 3 years ago, # ^ |   +73 Plot Twist 16: Only language allowed is BrainFuck.
•  » » » » » » » » » 3 years ago, # ^ |   +2 Plot Twist 17: 17 is equal to 0
•  » » » » » » » » » 3 years ago, # ^ |   -13 Plot Twist 18: The contest will be cancelled.
•  » » » » » » » » » 3 years ago, # ^ |   +36 ... and that's how we know that plot twists are periodic with the period of 17! (Well, assuming that each next plot twist is a function of exactly one plot twist immediately preceding it)
•  » » » » » » » » » 3 years ago, # ^ |   -23 Plot Twist 17 + 2: Contest is rated
•  » » » » » » » » » 3 years ago, # ^ |   -18 Plot Twist 17 + 3: Contest will take place on April 2nd
•  » » » » » » » » » 3 years ago, # ^ |   +1 Plot Twist 17 + 4: Contest will start two hours in advance.
•  » » » » » » » » » 3 years ago, # ^ |   0 Plot Twist 17 + 5: The problem statements will be locked and can only be accessed after you submit and lock the solution.
•  » » » » » » » » » 3 years ago, # ^ |   +9 Plot Twist 17^6: Only output is provided and you have to find problem statement with input.
•  » » » » » » » » » 3 years ago, # ^ |   +3 Plot Untwist 17 + 7: this will untwist all the twists without further twisting already twisted plot.
•  » » » » » » » » » 3 years ago, # ^ |   +7 Plot Twist 25: The contest is running.
•  » » » » » » » » » 3 years ago, # ^ |   +3 Plot twist:
•  » » » » » » » » » 3 years ago, # ^ |   0 Plot Twist 27: Actually ,its not 27th but 28th twist(count it).
•  » » » » » » » » » 3 years ago, # ^ |   0 Plot Twist 29: pilot is going to die.
•  » » » » » » » » » 3 years ago, # ^ |   +16 Plot twist 10^9- Plot twist Time Limit Exceeded!
•  » » » » » » » » » 3 years ago, # ^ |   +1 Plot Twist 10^9+7 "RunTime Error"
•  » » » » » » » » » 3 years ago, # ^ |   +20 The Plot Twist we expected : Everything aboveThe Plot Twist we got : Error 502 Bad Gateway across all versions of the website !
•  » » » » » » » » » 3 years ago, # ^ |   +3 plot twist 10: gets a "f***"in judgement protocol.
•  » » » » » » » » » 3 years ago, # ^ |   0 Plot Twist 34: Those commenting on this thread will have their rating increased
•  » » 3 years ago, # ^ |   +8 (Assuming its April Fools Day) Yes!! before the contest!!
 » 3 years ago, # |   +51 Pretty much every recent contest has started to feel like a joke contest now, so this joke contest is more like just another normal contest. So I don't see why it should be unrated.
•  » » 3 years ago, # ^ |   +8 -Unrated
•  » » 3 years ago, # ^ |   +4 very dank
 » 3 years ago, # |   +1 I think this is going to be fun :D
 » 3 years ago, # |   +4 It's my first April Fools Contest in Codeforces. I think it'll be interesting and meaningful (to me). Just wish me (and everyone) good luck and have fun!
 » 3 years ago, # |   +33 What if you don’t have a sense of humor?
•  » » 3 years ago, # ^ |   +28 Then it falls to other people to make fun of you.
 » 3 years ago, # |   +35 April Fool's joke:Us: Yes!!, unrated contest.CodeForces: April Fool's, it's rated.Us: rating dropsCodeForces: Just kidding... :P
•  » » 3 years ago, # ^ |   +12 unless...
 » 3 years ago, # |   0 Seems interesting, very much looking forward to it.
 » 3 years ago, # |   0 Excited for the contest in this QUARANTINE...
 » 3 years ago, # |   +95 Is it fair to call the winner a fool ?
•  » » 3 years ago, # ^ |   +1 *participant
•  » » 3 years ago, # ^ |   +3 You just nailed it bro!!
•  » » 3 years ago, # ^ |   +1 you can see who won now.
 » 3 years ago, # |   -30 Why it will be unrated ?
•  » » 3 years ago, # ^ |   +14 Have a look on previous year contests, you will get to know.
 » 3 years ago, # | ← Rev. 2 →   +3 plot twist : contest will be rated Nickolas is a paid actor
 » 3 years ago, # |   +35 Waiting for another one OEIS task.
•  » » 3 years ago, # ^ |   +30 Which is why I can't really give one :-D I'm not sure this is a kind of joke that gets better after multiple repetitions, and you can pull off a trick like this only once :-)
 » 3 years ago, # | ← Rev. 3 →   0 Will each problems have the same points? What will be the difficulty level of each problem? Same or Different?
•  » » 3 years ago, # ^ |   +3 ACM ICPC rules mean that each problem is worth 1 point regardless of complexity, and the ties are resolved using penalty time. The problems will have different difficulty; I try to arrange them in increasing order of difficulty but for this kind of contest it's harder than usual to estimate this correctly :-)
 » 3 years ago, # |   +4 I hope there are no problems with solutions based on references specific to the problem setter of the contest. (like this one — https://codeforces.com/contest/1145/problem/C) I think the problems should be solve-able for all users irrespective of whether they follow specific other users or not. Science/math trivia and general movie/pop-culture references are fine, and would allow a greater number of users to attempt the problems.
•  » » 3 years ago, # ^ |   +5 Yes i agree with you
•  » » 3 years ago, # ^ |   +9 I solved that problem during contest without knowing the reference to problem setter or anything about quantum computing.
•  » » 3 years ago, # ^ |   +5 actually this is a very good point
 » 3 years ago, # |   -24 This quarantine it feels good to be fooled.At least something is happening.
 » 3 years ago, # |   0 One of the best chances to rank over reds :p
•  » » 3 years ago, # ^ |   0 You bet!!
 » 3 years ago, # |   +10 I'm waiting for the memes based on the disasters happened in 2020 so far
 » 3 years ago, # |   +12 One of the most funniest contests.
 » 3 years ago, # |   +35 your wish of "short statement" will be fulfilled here.. for sure!
•  » » 3 years ago, # ^ |   +51 It is so short that there is not even a statement.
 » 3 years ago, # |   +1 Hoping for a mind refreshing and entertaining contest with a lot of humorous content in this Quarantine Times!!!PS: For the first time I am going to give a contest with my family!!
 » 3 years ago, # |   +3 Boys often don't understand the humor in girls. Then What?
•  » » 3 years ago, # ^ |   +15 I don't think the issues people usually have with April Fools Contests are related to my gender... But in this unlikely case, you still have two problems written by my co-author kit1980 :-)
 » 3 years ago, # |   +14 If "unrated" is a joke XD
•  » » 3 years ago, # ^ |   +1 Just Enjoy it! A problem without statement~
 » 3 years ago, # |   +8 No April Fools Day Contest in 2015?????
 » 3 years ago, # |   +30 When someone tells you after the contest that has been rated.
 » 3 years ago, # |   +98
 » 3 years ago, # |   -37
 » 3 years ago, # |   +1 I hope those problems don't make me go bald hahaha
 » 3 years ago, # | ← Rev. 2 →   +34 Le output format : The correct spelling for school is school, if you put the second 'o' before the first 'o' it is absolutely wrong.
 » 3 years ago, # |   +1 There will be no contest...It’s all a joke and I’m not gonna fall for it.
 » 3 years ago, # |   +7 We need a round based on dank memes.
 » 3 years ago, # |   +5 lets post all the solutions here after getting AC :D
 » 3 years ago, # |   +1 Can I participate with my team?__
 » 3 years ago, # |   +17 Latest News = Competitive Programming is going to be introduced in this Summer Olympics ... Congrats to Whole Coderforces Community for this tremendous achievement :-) .https://www.nytimes.com/newsletters/computerscience/1087
 » 3 years ago, # |   +5 It is April Fools Day Contest, right? Will the problems be fool, or are they gonna make us feel like a fool? Which one do you think?
 » 3 years ago, # |   +15 Its april fools day and CodeForces is kindda joking with me (note to the Memory).thank u CF for making us to smile while we quarantine ourselves.
 » 3 years ago, # |   -23 Is contest rated?
•  » » 3 years ago, # ^ |   -11 No
•  » » » 3 years ago, # ^ |   +18 is giving answer before the contest allowed?
•  » » 3 years ago, # ^ | ← Rev. 3 →   0 Not rated.
 » 3 years ago, # |   0 Theres no questions. Was that the joke ?
•  » » 3 years ago, # ^ |   0 same here
•  » » » 3 years ago, # ^ | ← Rev. 2 →   +11 This is the point of the april fools contest. You're trying to find out patterns.
 » 3 years ago, # |   0 problem is not showing up just input and output for every problem and i entered in it i don't know now what to do
•  » » 3 years ago, # ^ |   0 Big F bro. :P
 » 3 years ago, # | ← Rev. 2 →   +15
 » 3 years ago, # |   0 I was thinking in which categories does these question falls ?
•  » » 3 years ago, # ^ |   +8 None
 » 3 years ago, # |   +18 hope all contests have problem statement concise like this one
 » 3 years ago, # |   0 Is it rated? Can someone hint over this?
•  » » 3 years ago, # ^ |   0 No, we can't give you hint.
•  » » 3 years ago, # ^ |   0 No (we cannot give you the answer)
 » 3 years ago, # | ← Rev. 3 →   -10 NULL
 » 3 years ago, # |   +1 Multum gaudebamus fuit!
 » 3 years ago, # |   +59 tourist got the 1st like usual even though this is just a joke round, insane!
 » 3 years ago, # |   +101 How on earth is tourist first in this contest too
•  » » 3 years ago, # ^ |   +10 LOL
 » 3 years ago, # |   +19 Never have I been so curious to know the solutions. Can't sleep without the editorial.
•  » » 3 years ago, # ^ |   +3 https://codeforces.com/blog/entry/75480, working on the rest of solutions
 » 3 years ago, # |   +79 tourist: Rated, unrated; I am inevitable.
 » 3 years ago, # |   +1 Everyone who attempted A got it correct, this the first time that I have seen it happen.
•  » » 3 years ago, # ^ |   +9 I print nothing and got WA at first...
•  » » 3 years ago, # ^ |   +20 There is only 1 test, and WAs on the 1st test are not shown as failed attempts. Trust me, not everybody got it from the 1st try :-D
•  » » 3 years ago, # ^ |   0 Not Me , It took me my third attempt;On my first attempt i readinput -standard input output-standard output ,so i took a input number and printed that number.Later ,i submitted my blank template in my second attempt;And finally printed NO after that..
•  » » » 3 years ago, # ^ |   0 I meant got it correct during contest not on first attempt :)
 » 3 years ago, # | ← Rev. 2 →   +25 I had to check from tourist's submissions page, to check whether he actually submitted the problems, or we were being fooled by CF. LOL! xD
•  » » 3 years ago, # ^ |   +2 What if his submission page is also made up? What if he never really attended the contest?
 » 3 years ago, # |   +30 SOLUTION FOR EFirst: fill area in photoshopSecond: Do 2d dimension arr. Check pixel at (i*15)+5 (g*15)+5. If it's white, put 0 in arr else put 1; Save that arr in file for use it in final solution. I picked Node.JS for this step. var fs = require("fs"); var Canvas = require("canvas"); let fileLink = "smile.png"; var canvas = new Canvas.Canvas(960, 960, "png"); var ctx = canvas.getContext("2d"); const Image = Canvas.Image; var image = new Image(963,964); dataArr = []; image.onload = function () { ctx.drawImage(image,-2,-2,963,964); for (let i = 0; i < 64; i++){ let newStr = []; for (let g = 0; g < 64; g++){ var p = ctx.getImageData((g*15)+4, (i*15)+4, 1, 1).data; if (p[2] < 240){ newStr.push(0) } else { newStr.push(1) } } dataArr.push(newStr) } fs.writeFileSync("DATAOUT.txt",JSON.stringify(dataArr)) }; image.src = fileLink; Final solution: just get row and col and check arr[row][col] if it's 0 print "OUT" else print "IN"
•  » » 3 years ago, # ^ |   +45 mspaint.exe FTW
•  » » » 3 years ago, # ^ |   +39 when your linux distro does not package a drawing tool so you search 'online image editor' and pick the first one with a floodfill tool
•  » » 3 years ago, # ^ |   +5 Or you can use this
•  » » 3 years ago, # ^ | ← Rev. 2 →   +13 GIMP supports an excellent image format: it can export images as C code (the code for a struct with the raw uncompressed bytes stored in a unsigned char[] field). I used that.
•  » » 3 years ago, # ^ | ← Rev. 2 →   +10 Another solution without calculating coordinates. Fill area with black, resize to 64x64 and just convert pixels in python to C++ format: import imageio import numpy as np ans = np.array(imageio.imread("maze.png"))[:, :, 0] for line in ans: print('{', end='') print(*map(lambda x: 1 if x == 255 else 0, line), sep=',', end='') print('},\n', end='') 
 » 3 years ago, # |   0 When will we receive the editorials? :P
•  » » 3 years ago, # ^ |   +21
 » 3 years ago, # |   0 How do I solve F?
•  » » 3 years ago, # ^ |   +27 "elementary" -> periodic table of elements. Check if word can be spelled using symbols of chemical elements.
 » 3 years ago, # |   0 H is awful and awesome at same time
•  » » 3 years ago, # ^ |   0 How to solve?
•  » » » 3 years ago, # ^ | ← Rev. 2 →   0 code in ArnoldC SolutionIT'S SHOWTIME HEY CHRISTMAS TREE input YOU SET US UP 0 HEY CHRISTMAS TREE n YOU SET US UP 0 HEY CHRISTMAS TREE mod YOU SET US UP 0 HEY CHRISTMAS TREE ans YOU SET US UP 1 HEY CHRISTMAS TREE iswh YOU SET US UP 1 GET YOUR ASS TO MARS input DO IT NOW I WANT TO ASK YOU A BUNCH OF QUESTIONS AND I WANT TO HAVE THEM ANSWERED IMMEDIATELY GET TO THE CHOPPER n HERE IS MY INVITATION input HE HAD TO SPLIT 1000 ENOUGH TALK GET TO THE CHOPPER mod HERE IS MY INVITATION input I LET HIM GO 1000 ENOUGH TALK STICK AROUND iswh GET TO THE CHOPPER ans HERE IS MY INVITATION ans YOU'RE FIRED n ENOUGH TALK GET TO THE CHOPPER ans HERE IS MY INVITATION ans I LET HIM GO mod ENOUGH TALK GET TO THE CHOPPER n HERE IS MY INVITATION n GET DOWN 2 ENOUGH TALK GET TO THE CHOPPER iswh HERE IS MY INVITATION n LET OFF SOME STEAM BENNET 0 ENOUGH TALK CHILL TALK TO THE HAND ans YOU HAVE BEEN TERMINATED 
•  » » » 3 years ago, # ^ |   0 codeIT'S SHOWTIME HEY CHRISTMAS TREE t YOU SET US UP 0 GET YOUR ASS TO MARS t DO IT NOW I WANT TO ASK YOU A BUNCH OF QUESTIONS AND I WANT TO HAVE THEM ANSWERED IMMEDIATELY HEY CHRISTMAS TREE num YOU SET US UP 0 GET TO THE CHOPPER num HERE IS MY INVITATION t HE HAD TO SPLIT 1000 ENOUGH TALK HEY CHRISTMAS TREE mod YOU SET US UP 0 GET TO THE CHOPPER mod HERE IS MY INVITATION t I LET HIM GO 1000 ENOUGH TALK HEY CHRISTMAS TREE ok YOU SET US UP @NO PROBLEMO HEY CHRISTMAS TREE ans YOU SET US UP 1 HEY CHRISTMAS TREE cur YOU SET US UP num STICK AROUND ok GET TO THE CHOPPER ans HERE IS MY INVITATION ans YOU'RE FIRED cur ENOUGH TALK GET TO THE CHOPPER ans HERE IS MY INVITATION ans I LET HIM GO mod ENOUGH TALK GET TO THE CHOPPER cur HERE IS MY INVITATION cur GET DOWN 2 ENOUGH TALK GET TO THE CHOPPER ok HERE IS MY INVITATION cur LET OFF SOME STEAM BENNET 0 ENOUGH TALK CHILL TALK TO THE HAND ans YOU HAVE BEEN TERMINATED 
•  » » » » 3 years ago, # ^ |   0 Where did u find syntax of that language?
•  » » » » » 3 years ago, # ^ |   0
•  » » » » » 3 years ago, # ^ |   0 You can Google for "it's showtime esoteric language", the first link for me is https://lhartikk.github.io/ArnoldC/. By now you know the language name. The README contains a good spec. Perhaps the most difficult thing for me was to find out how to read input, but Googling for "arnoldc input" helped.
 » 3 years ago, # |   +48 How to solve I?
•  » » 3 years ago, # ^ |   +4 yes
 » 3 years ago, # |   +16 First (and for sure last) time I solved 7 problems lol.
 » 3 years ago, # |   +52 )
 » 3 years ago, # |   0 What are the solutions?
 » 3 years ago, # |   0 How to solve F?
 » 3 years ago, # |   +18 Was this part of April fool's suprise? I couldn't even find the submit button XDD// For some moment I REALLY thought it was some kind of penalty for submitting too many WAs
 » 3 years ago, # |   +6 Having a picture with coordinates may help you solve E problem （做了一张有坐标的图片，可能会帮助你解答E题）
•  » » 3 years ago, # ^ |   0 But how ?
•  » » » 3 years ago, # ^ |   0 Actually , you can still submit it if you want.^-^
 » 3 years ago, # |   +1 I am stupid, how to solve C?
•  » » 3 years ago, # ^ |   +24 Paste the title into Google. Google tells you that correct order of these words is in fact a bit different and you can get some permutation from it. You need to apply that permutation to bits of the number on input.
•  » » » 3 years ago, # ^ |   +8 Actually, it's possible to deduce this permutation just from the samples...
•  » » » » 3 years ago, # ^ |   0 Maybe it is, but how do you get the idea behind it then?
•  » » » » » 3 years ago, # ^ |   0 Maybe I wasn't clear enough — the idea was from the title; I'm talking about the permutation itself, the samples give exactly enough information to decode it :)
•  » » » » » 3 years ago, # ^ |   0 The $0 \le n < 64$ part clearly shows it's an array of bits. Then I noticed the count of 1 and 0 bits in the original number matches the count of 1s and 0s in the result (respectively); then I tried to apply a simple shift. When it didn't work, I just noticed the highest and the 2nd bit don't change and the others are just reversed.
•  » » » » 3 years ago, # ^ |   0 It is not, no sample contains the terms 2^3 and 2^4, so the mapping of those bits is ambiguous.
•  » » » » » 3 years ago, # ^ |   -10 It would only take a WA to fix that.
•  » » » » » » 3 years ago, # ^ |   0 .. sure but that's not the point here ..
•  » » 3 years ago, # ^ |   0 And after happily lived ever they And they lived happily ever after All of the numbers have <= than 6 bits, so reorder the bits just like those words.
 » 3 years ago, # | ← Rev. 4 →   +63 A — print No.B — the first letters of each line spell "two factors" (finding the first nontrivial factor x, then outputing x and a/x worked for me).C — the problem title is "and they lived happily ever after" permuted. Permute the bits in the binary representation of the number, in the same way.D — is the hexadecimal number even or odd?E — the problem asks for whether a square is inside or outside the curve. Use a photo processing tool such as GIMP that allows export of pictures to C code, after applying a paint bucket tool.F — Check whether string can be broken down into chemical element symbols.G — The language is http://users.monash.edu/~damian/papers/HTML/Perligata.html (unfortunately the link does not seem to contain enough information...)H — The language is https://github.com/lhartikk/ArnoldC.
•  » » 3 years ago, # ^ |   +8 For G you can translate the code without any resources, it just takes a bit.
•  » » » 3 years ago, # ^ |   +1 I have no idea how you do that
•  » » » » 3 years ago, # ^ |   +34 That's what I did, took about 20mins. You look at it as a linguistic problem.You mostly ignore -um, -mentum and -o suffixes because they seem to be just 'latinizing' the text. Then stuff like addementum or multiplicamentum are easy operations. Things like "var", "aresult", "bresult", "result" are seemingly just variables.Convert all numbers from Roman to decimal to better understand the conditional and loops. The order of input-output (reversed) points to the siqus lines likely being pushing/popping in a stack and input is probably in the first loop. The cumula on these lines also points in that direction as "accumulation" points to some data structure.The only thing left is to figure out elevamentum and privamentum fodementum. Looking at how big the values are compared to the input and associating with "elevate", the former is a power function.Calculating all other values and comparing with the output gives you that privamentum fodementum has to be a square root and you're done.
•  » » » » 3 years ago, # ^ |   +18 I did it without realizing it was an esolang, it's easier than it sounds. For example "aresultum tum bresultum addementum da resulto." clearly means "add aresult and bresult to get result". "multiplicamentum" is also very obvious.Most of the lines have very obvious parsings if you think they must be program instructions.
•  » » » » » 3 years ago, # ^ |   0 I think that is because Portuguese (this is your native language, right?) may be much closer to Latin, than English.
•  » » 3 years ago, # ^ |   +20 You can add use Lingua::Romana::Perligata "convert"; before the code to make Perl convert the code to an understandable form.
 » 3 years ago, # |   +26 GET TO THE CHOPPER!
 » 3 years ago, # |   +23 Guys, leave pictures alone, do old school. 10 years ago this was called art!0000000000000000000000000010101111110100000000000000000000000000 0000000000000000000000101110101010010111110000000000000000000000 0000000000000000000011101000100011010000100100000000000000000000 0000000000000000011110101011111000011110101110100000000000000000 0000000000000000110000001010000011110000101010110000000000000000 0000000000000010011011111011101110100101100010010100000000000000 0000000000000111001001000000101000111100110110110110000000000000 0000000000011111101101101110111011100001100100100011100000000000 0000000000111111111111000010000010001011001101101001110000000000 0000000001111111111111111111101111111001111001111111111000000000 0000000011111111111111111111111111111111111111111111111100000000 0000000111111111111111111111111111111111111111111111111110000000 0000000111111111111111111111111111111111111111111111111110000000 0000001111111111111111111111111111111111111111111111111111000000 0000011111111111111111111111111111111111111111111111111111100000 0000011111111111111111111111111111111111111111111111111111100000 0000111111111111111111111111111111111111111111111111111111110000 0001111111111111111111111111111111111111111111111111111111111000 0000011111111111111111111111111111111111111111111111111111111000 0000000111111111111000100111111111111110001010111111111111100000 0011000001111111110010001111111111111110100000001111111100000000 0011110000011111000110100011111111111111101101100101100000001100 0111111100000100011100111001111111111101001000110000000001111110 0111111111000001001001101100011111111101101111100100001111111110 0111111111111011011100000111001111111000100100001110111111111110 0111111111000001000111011100011111111010111110100010010111111110 1111111111110111010010010001001111110010010000110111000111111111 1111111111100010010110111011101111010111011110011100010111111111 1111111111101111110111100001001010000101001011110001110111111111 1111111111100000100100111011100010101101101001000100100111111111 1111111111110110111101101110001011100000111101011111101111111111 1111111111100011100100100011101001110111100101110001000111111111 1111111111111000001101110110111011000001001101100100010111111111 1111111111111101101000010100001010010101101000110110111111111111 1111111111110000111101010101011110110100101110011100011111111111 1111111111111010010001110001111000100110000100110001111111111111 1111111111111111000111000101101101101100101110100100111111111111 1111111111111111110001011111100000111111100010001111111111111111 0111111111111111100100001111101011111111111000100111111111111110 0111111111111111111111111111111000011111111111111111111111111110 0111111111111111111111111111010010111111111111111111111111111110 0111111111111111111111111101000111111111111111111111111111111110 0011111111111111111111111100010001111111111111111111111111111100 0011111110011111111111111111110111111111111111111111111111111100 0001111111010111111111111111100011111111111111111111101111111000 0001111111000100011111111111001011111111111011111010000111111000 0001111111010101001010001101011001010010110001100000101111111000 0000111111110001100000100000001100011000000101001110111111110000 0000011111110100111101111011100111000011101111101011111111100000 0000011111111110100100100010111101110110100000100011111111100000 0000001111111100001101101000010001010000111010001111111111000000 0000000111111111011000111110110101000101100011111111111110000000 0000000111111111001110010100011100010111001000111111111110000000 0000000011111111100011110001110110111101111011111111111100000000 0000000001111111110110000101000000100001011111111111111000000000 0000000000111111111111010111101101101011001111111111110000000000 0000000000011111111111110000111100001000011111111111100000000000 0000000000000111111111111111111110111111111111111110000000000000 0000000000000011111111111111111111111111111111111100000000000000 0000000000000000111111111111111111111111111111110000000000000000 0000000000000000011111111111111111111111111111100000000000000000 0000000000000000000011111111111111111111111100000000000000000000 0000000000000000000000111111111111111111110000000000000000000000 0000000000000000000000000011111111111100000000000000000000000000
•  » » 3 years ago, # ^ |   +11 looks better like this0000000000000000000000000010101111110100000000000000000000000000 0000000000000000000000101110101010010111110000000000000000000000 0000000000000000000011101000100011010000100100000000000000000000 0000000000000000011110101011111000011110101110100000000000000000 0000000000000000110000001010000011110000101010110000000000000000 0000000000000010011011111011101110100101100010010100000000000000 0000000000000111001001000000101000111100110110110110000000000000 0000000000011111101101101110111011100001100100100011100000000000 0000000000111111111111000010000010001011001101101001110000000000 0000000001111111111111111111101111111001111001111111111000000000 0000000011111111111111111111111111111111111111111111111100000000 0000000111111111111111111111111111111111111111111111111110000000 0000000111111111111111111111111111111111111111111111111110000000 0000001111111111111111111111111111111111111111111111111111000000 0000011111111111111111111111111111111111111111111111111111100000 0000011111111111111111111111111111111111111111111111111111100000 0000111111111111111111111111111111111111111111111111111111110000 0001111111111111111111111111111111111111111111111111111111111000 0000011111111111111111111111111111111111111111111111111111111000 0000000111111111111000100111111111111110001010111111111111100000 0011000001111111110010001111111111111110100000001111111100000000 0011110000011111000110100011111111111111101101100101100000001100 0111111100000100011100111001111111111101001000110000000001111110 0111111111000001001001101100011111111101101111100100001111111110 0111111111111011011100000111001111111000100100001110111111111110 0111111111000001000111011100011111111010111110100010010111111110 1111111111110111010010010001001111110010010000110111000111111111 1111111111100010010110111011101111010111011110011100010111111111 1111111111101111110111100001001010000101001011110001110111111111 1111111111100000100100111011100010101101101001000100100111111111 1111111111110110111101101110001011100000111101011111101111111111 1111111111100011100100100011101001110111100101110001000111111111 1111111111111000001101110110111011000001001101100100010111111111 1111111111111101101000010100001010010101101000110110111111111111 1111111111110000111101010101011110110100101110011100011111111111 1111111111111010010001110001111000100110000100110001111111111111 1111111111111111000111000101101101101100101110100100111111111111 1111111111111111110001011111100000111111100010001111111111111111 0111111111111111100100001111101011111111111000100111111111111110 0111111111111111111111111111111000011111111111111111111111111110 0111111111111111111111111111010010111111111111111111111111111110 0111111111111111111111111101000111111111111111111111111111111110 0011111111111111111111111100010001111111111111111111111111111100 0011111110011111111111111111110111111111111111111111111111111100 0001111111010111111111111111100011111111111111111111101111111000 0001111111000100011111111111001011111111111011111010000111111000 0001111111010101001010001101011001010010110001100000101111111000 0000111111110001100000100000001100011000000101001110111111110000 0000011111110100111101111011100111000011101111101011111111100000 0000011111111110100100100010111101110110100000100011111111100000 0000001111111100001101101000010001010000111010001111111111000000 0000000111111111011000111110110101000101100011111111111110000000 0000000111111111001110010100011100010111001000111111111110000000 0000000011111111100011110001110110111101111011111111111100000000 0000000001111111110110000101000000100001011111111111111000000000 0000000000111111111111010111101101101011001111111111110000000000 0000000000011111111111110000111100001000011111111111100000000000 0000000000000111111111111111111110111111111111111110000000000000 0000000000000011111111111111111111111111111111111100000000000000 0000000000000000111111111111111111111111111111110000000000000000 0000000000000000011111111111111111111111111111100000000000000000 0000000000000000000011111111111111111111111100000000000000000000 0000000000000000000000111111111111111111110000000000000000000000 0000000000000000000000000011111111111100000000000000000000000000 
 » 3 years ago, # |   +8 it was nice experience , saw new perspective of solving a question . I can't find solution for C ..but still enjoyed it
 » 3 years ago, # |   0 Unknown language = Brainfuck?
•  » » 3 years ago, # ^ |   0 It's ArnoldC.
•  » » 3 years ago, # ^ |   0 No it's ArnoldC.
•  » » » 3 years ago, # ^ |   0 I thought because on compilation it was giving message something like fuck...that's why I guessed it. :)
•  » » » » 3 years ago, # ^ |   0 I just googled the compilation message and that led me to the language ArnoldC.
 » 3 years ago, # |   +24 tourist got fooled by A :)
 » 3 years ago, # |   +6 Codeforces, is it bug or joke? Why couldn't I to submit problem O?
•  » » 3 years ago, # ^ |   0 U think ur geniuz huh?!
•  » » 3 years ago, # ^ |   0 @No problemO, sir.
 » 3 years ago, # |   +2 When I find out at the end of the contest I mistakenly got a CE by writing the correct C++ solution of G using UnknownX......
 » 3 years ago, # | ← Rev. 4 →   +13 It seems to me that there is a notorious coincidence......Also mfw I solved this task back then but didn't solve it now because I thought some of the elements aren't elements criesI even had a file named Elementary.cpp and I was asked if I wanted to replace that file.......
•  » » 3 years ago, # ^ |   0 To make it even more notorious, we independently used the same problem in a local contest last year: https://icpc.cs.fau.de/wp-content/uploads/2019/03/problemset_winter_2019.pdfFunnily enough that problem is called "Elementary" as well.
 » 3 years ago, # |   +86 In problem D, I actually did a research on OEIS. Found out that all the sample input were chess related, I thought that the problem is to collect the first element of each chess related sequences. I searched OEIS "chess", got 61 pages, with 607 results. So I wrote a program that collects the data from those pages, and writes the code for me. After I done that, I happily submitted the code and got WA on test 5. And only after all of these, I figured out what the actual task is. I really got fooled.
•  » » 3 years ago, # ^ |   +8 I have also noticed that the answer is equal to the first element of the OEIS sequence, so I thought I needed some API to query the first element of the given OEIS sequence, but suddenly I noticed that most of the submissions got the correct answer, so I guessed the real answer would be simpler than that:)
•  » » 3 years ago, # ^ |   0 I'm pretty sure OEIS actually offers downloadable versions, e.g. at https://oeis.org/wiki/Welcome#Compressed_Versions.
•  » » 3 years ago, # ^ |   0 WOW! Can you share your code SPatrik?
•  » » » 3 years ago, # ^ |   0 Sure: 75146152 I copied the generated code into my submission.
 » 3 years ago, # |   +8 Could not do. I am a fool indeed.
 » 3 years ago, # |   0 never been so stressed.
»
3 years ago, # |
Rev. 6   -36

## IT'S SHOWTIME

HEY CHRISTMAS TREE varX

---------------------------

YOU SET US UP 0

---------------------------

GET YOUR ASS TO MARS varX

---------------------------

DO IT NOW

---------------------------

I WANT TO ASK YOU A BUNCH OF QUESTIONS AND I WANT TO HAVE THEM ANSWERED IMMEDIATELY

---------------------------

HEY CHRISTMAS TREE a

---------------------------

YOU SET US UP varX

---------------------------

GET TO THE CHOPPER a

---------------------------

HERE IS MY INVITATION varX

---------------------------

HE HAD TO SPLIT 1000

---------------------------

ENOUGH TALK

---------------------------

HEY CHRISTMAS TREE b

---------------------------

YOU SET US UP varX

---------------------------

GET TO THE CHOPPER b

---------------------------

HERE IS MY INVITATION varX

---------------------------

I LET HIM GO 1000

---------------------------

ENOUGH TALK

---------------------------

HEY CHRISTMAS TREE result

---------------------------

YOU SET US UP 1

---------------------------

HEY CHRISTMAS TREE isTrue

---------------------------

YOU SET US UP 1

---------------------------

STICK AROUND isTrue

---------------------------

GET TO THE CHOPPER result

---------------------------

HERE IS MY INVITATION result

---------------------------

YOU'RE FIRED a

---------------------------

ENOUGH TALK

---------------------------

GET TO THE CHOPPER a

---------------------------

HERE IS MY INVITATION a

---------------------------

GET DOWN 2

---------------------------

ENOUGH TALK

---------------------------

GET TO THE CHOPPER result

---------------------------

HERE IS MY INVITATION result

---------------------------

I LET HIM GO b

---------------------------

ENOUGH TALK

---------------------------

GET TO THE CHOPPER isTrue

---------------------------

HERE IS MY INVITATION a

---------------------------

LET OFF SOME STEAM BENNET 1

---------------------------

ENOUGH TALK

---------------------------

CHILL

---------------------------

TALK TO THE HAND result

---------------------------

## YOU HAVE BEEN TERMINATED

•  » » 3 years ago, # ^ |   +34 Please use "" to format the code, like this:   code goes here  
•  » » » 3 years ago, # ^ |   0 this might help
•  » » » » 3 years ago, # ^ | ← Rev. 2 →   0 You don't have to put "----" between the lines, you can just type like this:   line 1 line 2 line ...  
 » 3 years ago, # |   +65 The problems were extremely nice this time, thanks!
 » 3 years ago, # |   +11 Fun contest :)
 » 3 years ago, # | ← Rev. 2 →   0 Is the contest is rated?
•  » » 3 years ago, # ^ |   0 nope
 » 3 years ago, # |   0 Was problem G meant for Romans?
•  » » 3 years ago, # ^ |   0 It's a project named Lingua::Romana::Perligata, to write Perl codes in Latin.
•  » » 3 years ago, # ^ |   +3 No, it was meant for fools.
 » 3 years ago, # |   +1 Did anyone have a long queue on custom invocation? It took me about 10 minutes to make sure the UnknownX language is actually ArnoldC; luckily, "It's showtime" title allowed me to start working on the solution before that, but waiting for 10 minutes was weird.
•  » » 3 years ago, # ^ |   0 Oh. I got so much penalty submitting the code just to see the compiler errors :/. Next time I'll use the custom invocation. Thanks for the tip!
 » 3 years ago, # |   0 I failed to submit code (for practice) after contest... :(
 » 3 years ago, # |   +8 When can we submit the code after contest....I want to check whether my H is correct or not.
 » 3 years ago, # |   +10  # # ###### # # ### # # # # ##### ### # # ## # # # #### # # ##### #### # ### # ## # # #### # # # ## # ## ##### ### ### # # ## # # # ### # # # # #### ## ## ## ## ###### ## ## ### ### ### ## # # ### ############ # # # ## ## ## # ### #################### ####### #### ########## ################################################ ################################################## ################################################## #################################################### ###################################################### ###################################################### ######################################################## ########################################################## ######################################################## ############ # ############## # # ############# ## ######### # ############### # ######## #### ##### ## # ############### ## ## # ## ## ####### # ### ### ########### # # ## ###### ######### # # ## ## ######### ## ##### # ######### ############ ## ### ### ####### # # ### ########### ######### # ### ### ######## # ##### # # # ######## ############ ### # # # # ###### # # ## ### ######### ########### # # ## ### ### #### # ### #### ### # ######### ########### ###### #### # # # # # # #### ### ######### ########### # # ### ### # # ## ## # # # # ######### ############ ## #### ## ### # ### #### # ###### ########## ########### ### # # ### # ### #### # ### # ######### ############# ## ### ## ### ## # ## ## # # ######### ############## ## # # # # # # # ## # ## ## ############ ############ #### # # # # #### ## # # ### ### ########### ############# # # ### #### # ## # ## ############# ################ ### # ## ## ## ## # ### # # ############ ################## # ###### ####### # ################ ################ # ##### # ########### # ############## ############################## ############################ ########################### # # ############################# ######################### # ################################ ######################## # ############################# ####### ################### ############################### ####### # ################ ##################### ####### ####### # ########### # ########### ##### # ###### ####### # # # # # ## # ## # # # ## ## # ####### ######## ## # ## ## # # ### ######## ####### # #### #### ### ### ### ##### # ######### ########## # # # # #### ### ## # # ######### ######## ## ## # # # # ### # ########## ######### ## ##### ## # # # ## ############# ######### ### # # ### # ### # ########### ######### #### ### ## #### #### ############ ######### ## # # # # ############## ############ # #### ## ## # ## ############ ############# #### # ############ #################### ################# #################################### ################################ ############################## ######################## #################### ############ 
 » 3 years ago, # |   +6 first question was damm good . i refreshed my codeforces question site ,checked my wifi just to make sure that that there is no question statement ,the name of question itself was the question . Really enjoyed this contest . it's gave new and exciting experience .
 » 3 years ago, # |   0 Thanks so much for preparing this round ! Love it so much. How could i submit my code right now ?
•  » » 3 years ago, # ^ |   0 The contest should be open for practice now.
 » 3 years ago, # |   0 HASTA LA VISTA, BABY
 » 3 years ago, # | ← Rev. 2 →   +5 I encountered a strange bug here.Let's say that we try to get the answer to D from OEIS directly: import re import urllib.request S = input() with urllib.request.urlopen(f"http://oeis.org/search?q=id:{S}&fmt=text") as page: print(re.search(f'%S {S} \d+', page.read().decode()).group(0).split()[-1]) This runs fine on a clean environment with Python 3.7.2, but crashes on CF with error 13131313. The first guess is that the crash is caused by trying to connect to Internet, but that's not the case — import urllib.request already fails and even import _ssl fails with this same error. Since the latter is simply calling the dynamic loader on lib/python3.7/lib-dynload/_ssl.cpython-37m-x86_64-linux-gnu.so, it can't be a network access error.I tried finding out if someone else had this problem with this error code. The first and only meaningful search result is CF. And guess what, it's about a dynamic library import error, but a different one on PyPy 3. Turns out Python (CPython) 3 on CF can't import some libraries as well.We could say CF had a custom April 1st prank for me.
•  » » 3 years ago, # ^ |   0 For what it's worth, I've encountered error 13131313 too, when I tried to use import std; in D language (it's an equivalent of #include  in GNU C++, useful for one-off scripts and short solutions).My guess at the time was that importing some libraries toggle a Security Violation custom check at the invoker. Didn't pursue it further though. Sounds more plausible now. Likely the same happens with Python libraries known to deal with internet connections.
•  » » » 3 years ago, # ^ |   0 The link with the PyPy case hints that it could be a missing library, i.e. HTTP 404 (or a general 400) instead of 401/403, because that was a problem with _hashlib and I doubt that uses extra system resources. Maybe Mike handles security in most languages simply by purging undesirable elements of the ecosystem.In your case, isn't the D compiler still terribly outdated? It could also be that this include just doesn't exist in the CF version.
•  » » » » 3 years ago, # ^ |   0 Yeah, something seems to happen on the invokers with the libraries viewed as security threats. If they are just removed, it may be possible to track in the repository, pbox.me.The D compiler is up to date. When I got that 13131313 error, the compiler was 2.086 (May 2019 version). And it got updated to 2.091 (March 2020 version) just recently, thanks to Mike for that :) .Tried again right now, I get a memory limit exceeded instead of 13131313.
•  » » » » » 3 years ago, # ^ |   0 Seems like Memory Limit is something deliberate, tried it on problems with different limits:
•  » » » » » » 3 years ago, # ^ |   0 Since import is also a runtime operation, not compile-time like #include, maybe the imported everything counts towards used resources in such a way that the memory runs out. It shouldn't be that large, but I don't know how exactly shared resources are counted and what's checked for MLE. Many recursive DLL/SO loads could hypothetically break it.
•  » » » » » » » 3 years ago, # ^ |   0 Well, I was testing with D, and import is compile-time there. On Testsys with DMD 2.089 (compiling and running a 32-bit Windows executable, same as Codeforces), a similar program with import std; compiles and runs just fine:So it's specific to Codeforces invokers.
•  » » » » » » » » 3 years ago, # ^ |   0 import is compile-time there Are you sure about that? The docs talk about symbol name lookup, which is often a runtime thing. You definitely can resolve symbols from a "loaded" SO's PLT lazily when they're used during runtime, and you can do that at the program start (when they're loaded) too. I'm pretty sure your stdlib isn't linked statically either.This is a linker thing, both compile-time (ld etc) and runtime libdl.so. It's possible that D is using something custom for linking and the CF invoker is mishandling what it wants to do.Then again, I don't know about D, just general OS functionality and I'm guessing what the problem could be there. If you could view the startup part of your final executable, go over it step by step and find where it crashes with this error, that would be more productive.
•  » » » » » » » » » 3 years ago, # ^ |   0 You will be surprised. By default, the dmd Win32 compiler links the standard library statically from a phobos.lib file.Most of it, anyway. There's CURL which has bindings in the standard library, but actually a DLL since it's a third party lib. And indeed importing CURL gets me a Runtime Error.But the Memory Limit effect is something different still.
•  » » » » » » » » » 3 years ago, # ^ |   0 Huh. I guess the benefits of linking libstdc++.so dynamically don't exist in the case where you have a custom library that isn't used by anything else. Now that I think about it, some OJs use the -static` flag to do it in C++ too.So turns out the problem really was dynamic linking. That makes the MLE extra strange since if dynamic linking = security violation, then getting MLE instead = security risk. Well, MLE is either undefined behaviour of the judge or really too much memory allocated somehow.
 » 3 years ago, # |   0 how to solve C?
 » 3 years ago, # |   +1 how to solve B ? what are the first and second digit for in output ?
 » 3 years ago, # |   0 I got wa64 on A, help me
•  » » 3 years ago, # ^ |   -9 May be contest is rated for so that you are getting wa
 » 3 years ago, # |   0 For me problem A was a hint for problem C. C was very interesting.
 » 3 years ago, # |   +10 Remark: because of a bug in the "UnknownX" language, the problem H's input format must be concatenated into a single integer, and there are some problems unsolvable with UnknownX.However, there's a workaround for that: separate the two numbers with 8192 spaces.This is an accepted code for problem H, modified to take two numbers as input: Try it online!
 » 3 years ago, # |   0 Wow... i really loved giving this contest. It was fun.!!
 » 3 years ago, # |   0 Why hasn't the virtual participation been enabled? :) Would be fun to participate.
•  » » 3 years ago, # ^ |   0 This should be available now. Enjoy!