In the meta hackercup t shirt delivery option why india and european countries are not listed . There is no way to claim the t shirt even after qualifying ? SecondThread
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
In the meta hackercup t shirt delivery option why india and european countries are not listed . There is no way to claim the t shirt even after qualifying ? SecondThread
could anyone tell me why i am getting tle on test case 41? my solution is of o(nlogn) {if i am not wrong} . and by seeing constraints it should pass the testcases?. anyone?
sumbission link :- https://codeforces.me/contest/1902/submission/256209886
Is there any way to tell the no of subsequences of a given string with all unique elements.. I had used recursion but gets TLE. anyone have any optimal answer?
Is anyone have recursive dp solution of div2 892D?
In codeforces Educational Codeforces Round 123, C question (Increase Subarray Sum) , problem link :- https://codeforces.me/contest/1644/problem/C . i was getting TLE when i was using maps for hashing , but when i use vector for hashing for same code the solution got accepted . can anyone tell me why??
Hi, everyone. I am getting TLE in test case 11 in Codeforces Round 888 (Div. 3) E (Nastya and Potions) . i have applied recursion to get solution for each potions. can i anyone tell me how can i fix this error??
sumbission link:- https://codeforces.me/contest/1851/submission/215759218
| Name |
|---|


