### MikeMirzayanov's blog

By MikeMirzayanov, 11 years ago, translation,
Hello!

Despite the fact that Artem Rakhov prepared the round - I'm writing this post, as he is currently training for the ACM-ICPC World Finals, writing a contest with the teammates.

Contest has been prepared by: Artem Rakhov, Gerald Agapov (congratulations on the "redness") and Maria Belova.

Wish you high rating,
MikeMirzayanov

• +15

 11 years ago, # |   0 what is pretest 3 of COINS?
•  11 years ago, # ^ |   -14 No comments. Testdata is not available for participants.
•  11 years ago, # ^ |   0 kindly give an example of Impossible test case
•  11 years ago, # ^ |   +1 For example:A>BB>CC>AOutput: Impossible
•  11 years ago, # ^ |   +3 If anyone think that by some testcase  he can solve a better problem that he can solve as usual,then I think anyone of us should help him....
•  11 years ago, # ^ |   0 I totally agree.
•  11 years ago, # ^ |   0 Look at the time that question was asked. Mike meant that during the contest the test cases are not available.
•  11 years ago, # ^ |   0 answer test case 3 has "Impossible.",but you answer have been "Impossible. "answer has without dot.
 11 years ago, # |   0 Problem D:Second sample:input:6 3000000 2010100 4111100 0Is it correct?May be:6 3000000 2010100 4000011 0?
•  11 years ago, # ^ |   0 6 3 000000 2 010100 4 111100 0  There are no codes that do not contradict the m system responses. Please, you "questions" interface on the problemset page.
 11 years ago, # |   0 Hm, I thing it's really interesting.Recruit flushfileSubmits:A - 0:46, B - 0:49, E - 0:52Hacks:A - jackoneill (submitted in 0:46, hacked in 0:47), gigacoder (submitted in 0:56, hacked in 0:57)B - jackoneill (submitted in 0:48, hacked in 0:50), gigacoder (submitted in 0:56, hacked in 0:57) E - jackoneill (submitted in 0:52, hacked in 0:54), gigacoder (submitted in 0:56, hacked in 0:58) Recruit resetfile Submits: A - 1:00, B - 1:01, E - 1:01 Hacks: A - delphisourcer (submitted in 1:00, hacked in 1:01) B - delphisourcer (submitted in 1:00, hacked in 1:01) E - delphisourcer (submitted in 1:00, hacked in 1:02)
•  11 years ago, # ^ |   0 O!Recruit closefile Submits: A - 1:07, B - 1:07, E - 1:08 Hacks: A - gigacoder2 (submitted in 1:06, hacked in 1:07) B - gigacoder2 (submitted in 1:06, hacked in 1:08) E - gigacoder2 (submitted in 1:07, hacked in 1:09)
•  11 years ago, # ^ | ← Rev. 5 →   +4 And they all are writing on Delphi/FPC
•  11 years ago, # ^ |   +6 Finally, resetfile, closefile and flushfile have "+" with A,B and "-" with E
•  11 years ago, # ^ |   +6 This man has spoofed himself only....It's kind of morrons,that are trying ti cheat with their rank.It seems me funny btw)Take my advice- dont even pay ur attetion for them:)
 11 years ago, # |   +6 What is test 19 of problem C?
•  11 years ago, # ^ |   0 I want to know, too. Please help!
•  11 years ago, # ^ |   +1 It's such a case where the first solution (according to permutation) is not necessarily "lexicographically minimum one". You may try following case:AAAAAAAAAAAAAAAAAAAAAAAAAAHope it'll help.PS: Sorry for my weak English.
•  11 years ago, # ^ | ← Rev. 2 →   0 Is the solution is?AAA...A.A...A.A...AAAAAA..A..A..AAAA
•  11 years ago, # ^ | ← Rev. 2 →   +3 I know my bug of my solution.The compare function can *not* be the comparison of a string of all the characters in the map.It should be comparison the first line of two Maps, if they are the same, compare the second ones, otherwise return the smaller one.Attach the code of the struct Map :struct Map { char data[33][33]; int n, m; string getString(int n) const { // get line n string ret = ""; for (int j = 0; j < m; j ++) { ret.push_back(data[n][j]); } return ret; } bool operator<(Map o) const { for (int i = 0; i < n; i ++) { string a = getString(i); string b = o.getString(i); if (a == b) { continue; } else { return a < b; } } return false; }};Then, I got an AC.
•  11 years ago, # ^ |   0 Thanks. AC,too. Compare each line, not every char in a string.
 11 years ago, # |   0 What's the test 16 of problem C please?
 11 years ago, # | ← Rev. 2 →   0 Very ambiguous problem definitions regarding problem A.The first line contains the single number n (1 ≤ n ≤ 500) — the given integerIf the given integer is a triangular number output YES, otherwise output NOIs the n specifies range of triangular number(T1 - T500) or the integer to be checked ???
 11 years ago, # |   0 Integer to be checked.
 11 years ago, # |   0 In today's round ;I noticed that the test cases are available after the round; It's a great improvement in the codeforces ; Thanks to all of the organizers for their efforts .But about codeforces round 44 I want the test case # 7 for problem E [Canon] ;it gives me a time limit exceeded problem.If i re-submit the code now ; may the test cases appear in my submissions Thanks in advance;