On BledDest → Kotlin Heroes 7 Announcement, 3 years ago 0 TL in H is so tight. I have $O(nm2^k)$ solution but it doesn't pass :( Guess it's because of using stack.
 On regex0754 → Invitation to Alohomora 2021, 3 years ago 0 It can be solved using centroid decomposition and some hardcoding but we don't have enough time to finish the solution.
 On regex0754 → Invitation to Alohomora 2021, 3 years ago +8 Is there any info about prize distribution?
 On eatmore → Google Code Jam 2021, 3 years ago +21 You can't make submissions.
 On maroonrk → AtCoder Regular Contest 112 Announcement, 3 years ago +8 You need to place '#' at (0,0), (h-1,0), (0,w-1), (h-1,w-1) and you will get AC because we can go there from any position.
 On vlchen888 → Quora Programming Challenge 2021, 3 years ago +10 From König's theorem we know that number of vertexes in minimal cover equals to number of edges in maximum matching. So total number of vertex is sum of vertex in minimum cover and maximal independent set so we have this equation.
 On vlchen888 → Quora Programming Challenge 2021, 3 years ago 0 Maximum independent set = total vertexes — edges in maximum matching
 +22 +
 On IgorI → Codeforces Round #696 (Div. 2), 3 years ago +7 IgorI orz
 On 300iq → Invitation to CodeChef November Lunchtime 2020, 3 years ago +1 Spent two and a half hours figuring out that a fake eulerian cycle edge can be between vertices in the same component. :(
 On BledDest → Kotlin Heroes 5: ICPC Round Announcement, 4 years ago +15 And these two accounts have the same code for all the problems of practice contest.... Now it's obvious that it's cheating.
 On BledDest → Kotlin Heroes 5: ICPC Round Announcement, 4 years ago +1 98219728 and 98220972 . There are two same codes, that are not trivia, so maybe you used ideon of smth.
 +5 Oh, I checked your code and you have changed if(k&(1ll<
 0 For sure, you have overflow with (1ll<
 On YouKn0wWho → Invitation to CodeChef October Cook-Off 2020, 4 years ago 0 1427C - The Hard Work of Paparazzi
 On maroonrk → ACL Contest 1 Announcement, 4 years ago 0 What is "doubling" from problem D's editorial?
 On yashChandnani → Invitation to CodeChef August Lunchtime 2020, 4 years ago +8 One of them is me) Actually I would be able to finish with full solution, if I know that my approach passes first subtask, but anyway I'm happy with 6th place)
 On LoneFox → Facebook Hacker Cup 2020: Round 2, 4 years ago 0 There was one more day later :)
 0 There are no hacks at Codejam so you can't solve this problem like this
 On BledDest → Kotlin Heroes: Episode 4, 4 years ago +8 I wish to have at least one more round summertime
 On chokudai → AtCoder Beginner Contest 166 Announcement, 4 years ago +6 Got 457 lines of code in F)
 On chokudai → AtCoder Beginner Contest 165 Announcement, 4 years ago 0 It's actually the same because $\binom{n}{k}=\binom{n}{n-k}$
 On chokudai → AtCoder Beginner Contest 165 Announcement, 4 years ago +21 Observe, that if you pick set of numbers, there can be only one possible array, so you just need to count number to choose n elements from 1 to m, it is exactly $\binom{n+m-1}{n}\le 92378$
 On hmehta → TCO20 Round 1B, 4 years ago +5 1e10 I guess, because you need to pass at least 1e8 numbers (to get out from 99XXXXXXXX and 100XXXXXXXX)
 +10 Yours cool too!
 +10 More participants make pretests weaker
 0 Sorry, I forgot what the taks is, I counted all the subsequences that equal to given string
 +1 24 I guess
 On awoo → Educational Codeforces Round 80 [Rated for Div. 2], 4 years ago +1 There was systesting
 On awoo → Educational Codeforces Round 80 [Rated for Div. 2], 4 years ago +3 Let dp[k][i][j] will be number of valid arrays with length k and with a[k]=i and b[k]=j; So to get dp[k][i][j] we need all the dp[k-1][l][r] with l<=i and r>=j. How can we calculate it fast? Let's do 2*D prefix sums on dp[k-1][i][j] for all possible i and j. So formula is: dp[k][i][j]=pref[i][n]-pref[i][j-1]. Where pref[x][y] is sum of all dp[k-1][i][j] where i<=x and j<=y. https://codeforces.com/contest/1288/submission/68798026
 On awoo → Educational Codeforces Round 80 [Rated for Div. 2], 4 years ago +9 Am I the only one who did C with 2-D prefix sums?)
 On chokudai → AtCoder Beginner Contest 151 Announcement, 4 years ago 0 I guess bfs from all vertixes has O(n^2) complexity, because we have linear number of total edges. (Each vertex has no more than 4 edges, so there are no more than 2*n edges)
 On chokudai → AtCoder Beginner Contest 151 Announcement, 4 years ago 0 It works only for tree
 On tourist → AtCoder Grand Contest 041, 4 years ago +16 Very sad, that the only wrong answer of my solution for C is n=5 :(
 +45 Can you, please, open test's verdicts
 +4 String's beauty is number of minimal balances, if balance of all string is 0; (Balance is number of '(' on prefix minus number of ')' on prefix)
 On fcspartakm → Codeforces Round #592 (Div. 2), 5 years ago 0 If y=k*w+r and x=x0 — solution, so: y=r and x=x0+k*d — solution too, because: r + (x0+k*d)
 On rotavirus → Codeforces Round #581 (div. 2), 5 years ago +3 string *_*
 On SPatrik → Codeforces Round #577 (Div 2) Editorial, 5 years ago 0 1 2 3 6 8 -> 1 2 3 0 2 -> 1 1 2 0 2 -> 0 0 0 0 0 // done
 On Um_nik → Round #576 Editorial, 5 years ago 0 Solution got TL on tests with large input, so the problem is how to read a lot of data fast. You can read how the thing above optimizes the time here: https://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio (Using of printf and scanf usually fixes all the issues connected with input/output, so by using them you can protect yourself from stupid TLs)
 On Um_nik → Round #576 Editorial, 5 years ago +3 No
 On arsijo → Codeforces Round #571 (Div. 2) , 5 years ago +3 Hey, I have one strange question for problem D. Is it not ok that my solution doesn't submit because it prints -0 instead of 0, or i should remember this feature of C++ for the next time? Here is the code: https://codeforces.com/contest/1186/submission/56215735 (Please rejudge it if it was unexpected mistake)