|
0
That is not O(n^2). If you see he is terminating the 2nd loop if j*i<=3e5 which reduces the time complexity to O(nlogn). |
|
On
expolsion673 →
Abhipsita Das — Legendary Grandmaster of Cheating , PhD in Cheating Technology, 23 months ago
0
Bruhhhh This guy posted the same thing again again and again and again |
|
0
SHITT POST |
|
0
Damnnnn Is Sashi Tharoor ur dad ??? |
|
0
and the problem is back |
|
-43
I fear, one day chatgpt will beat you :| |
|
+1
No wayyy. He did more than 100 submissions in a day. |
|
-20
This contest was easy. |
|
0
Happy New Year Codeforces |
|
-7
Shit Never really thought about that |
|
0
B was really frustrating.But one who set those examples did a great job by giving a big value. Otherwise we would have end up getting lots of wrong submissions. |
|
0
I think the contest is now unrated |
|
0
Has the ratings rolled back?? |
|
+2
Yesterdays contest was good Though I am going to get a negative But it was fun :) :) :) :) |
|
+7
But u gave no contest |