Comments
+16

Oh no, we can't have another sorry_dreamoon then!
+3

Could someone please explain why in the last part of the tutorial of Div1D "there is a unique way to decompose each segment"?
0

It should have been exponential. It appears that the compiler optimizes the repeated calls to f(i+1) so they are not called twice. If you print something inside it, then the function has to do that and is not optimized.
+10

When did you edit your comment though

I just made it look like a weird conversation xD
+7

The problem comes from this line:

int a[n][m] = {0};

I'm not sure how it works, but it just wouldn't initialize all elements to 0 properly.
+12

After I saw the announcement, I added if(n==1)cout<<1<<endl; to my code.

I have perfectly reached top stupidity.
On kiyotaka → Codeforces Global Round 3, 7 years ago
+24

This comment has been edited and I sincerely apologize for my lack of knowledge about this great anime
On mnbvmar → Codeforces Round #556, 7 years ago
+22

Div2 B is the same as 389B
+39

Weebforces
+11

At the last minute I decided to submit an extraordinarily crappy solution of problem F and it passed......

Can anyone explain why this passed?
On KAN → Codeforces Global Round 1, 7 years ago
+113

Great, I've finally learned something other than сука блять.
+3

No, but nice one :)
+8

Codeforces: announces new round name

Flat earthers: *TRIGGERED*

Edit: Wow I really do suck at jokes...
0

That's great. But also, you should not expect an O(n^2) solution to pass anyways.
0

The "segments" the problem is referring to contains all integers from l to r. For example, for this case:

2
1 3
2 4

The two segments intersect, therefore the answer should be -1.
0

I think you misunderstood the problem.
0

Thanks but I already figured it out before getting accepted lol
On majk → Good Bye 2018 — Editorial, 7 years ago
+3

But the time complexity is O(N^2log(N^2)), wouldn't that be a little too slow?
On majk → Good Bye 2018, 7 years ago
+81

Problem B: "As everyone knows, the world is a two-dimensional plane."

So the earth is flat?
+3

I think memset is still quite important sometimes. Just need to evaluate better next time!
-8

Never mind, just got accepted. Never thought memset would pose a problem though.
0

Why did this get TLE?
On JATC → Codeforces Round #520, 7 years ago
0

here
On patience → dsu, 7 years ago
+9

Nah the OP's got patience
+16

Umm so you have to go to school on weekends...?
+29

May I ask why high school students there can't use computers between 10 and 10:30? Just curious.
0

Quotation marks, for quoting the above comment.
0

No, alexa play despacito
0

I see that Test #11 says "ok found '621354311564.2196000', expected '621354311564.2170400', error '0.0000000'". Umm why is this? Edit: Sorry for the mistake, I just found out that it is the relative error.