| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 152 |
| 3 | Proof_by_QED | 146 |
| 3 | Um_nik | 146 |
| 5 | Dominater069 | 144 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
|
0
Can D be solved using binary search ? If yes can anyone share their approach? |
|
-40
drastogi21 what is the probability that you are not in 98% and in 2% people ?? XD |
|
+2
please make it unrated ! |
|
0
|
|
0
but they have said it will contain all factor , so what will be the answer |
|
+259
It means i will get upvote on my comment now xD |
|
0
thanx got it |
|
0
Look at my rating, i am struggling between newbie and pupil . I think u can help me ? |
|
0
thanx for ur help i got it. |
|
0
and also plz explain when will be the answer not possible |
|
0
how a(4)=s(4)-a(3) ???? cant get this part |
|
0
Can someone explain their easy approach for div2 D with example ? |
|
0
thanx juanigsrz and lantrungseo |
|
0
How to solve Div2 D??? |
|
0
yes i also dont understand the same thing. can anyone explain this ? |
|
0
very good explanation |
|
0
Thanx |
|
0
got it thanx |
|
0
I have no idea how to solve C , can anyone help how to solve ? |
|
0
can u tell me how u derive the 2nd case? |
|
0
The statement is crystal clear if are asking for hint then again it will be your loss even in COMAS codechef have added explanation to decribe what they want to tell us. So please close this blog as all will ask for hint and spam the answer |
|
0
in india its 2:40 a.m xD |
|
0
ohh yes thanx |
|
0
are u sure ? |
|
0
in aaabbaaaabbbaa the answer should be 9+3*4+3*2+4*2? |
|
0
ps : I am weak in combinatorics :( |
|
0
can u explain with an example by telling subsequence ? |
|
0
can anyone explain me div 2 c with example |
|
0
lol |
|
0
yeah thanx |
|
0
can anyone explain d ? |
|
0
. |
|
0
. |
|
0
you can do it with bruteforce also as contraints are low ,by taking 2 nested loop and checking for all pair less than equal to n if the pair satisfy the condition OR solution 2 is if n==1 then no pair else print n n as it satisfy all condition u can check |
|
0
Can someone explain problem D Solution? |
|
0
Can someone explain me D? |
|
0
why ?? only nos starting from 3999?? any logic |
|
0
He had achieved a milestone which some people in world has achieved,which he has shown with picture with first letter black and other letter with red (nutella):p |
|
0
in B question i get the loop part but not able to understand how we are counting inside loop like the expression ((n-i)/m)*((n-j)/m) can someone expalin this to me |
|
0
How to solve B ?? |
|
0
can some one explain c with example and telling all the cases ? |
|
On
majk →
The Lyft Level 5 Challenge 2018 Elimination Round (Div. 1 + Div. 2) Editorial, 8 years ago
0
Thank you :) |
|
On
majk →
The Lyft Level 5 Challenge 2018 Elimination Round (Div. 1 + Div. 2) Editorial, 8 years ago
0
Can anyone explain me problem C ? |
|
+22
Codeforces should take strict steps against both of them. Cheating is such thing that u enjoy in beggining but later when u realize this a lot of time has been wasted.panipuri8 u r doing a good job like a responsible codeforcian person :p |
