# | User | Rating |
---|---|---|

1 | tourist | 3757 |

2 | jiangly | 3647 |

3 | Benq | 3581 |

4 | orzdevinwang | 3570 |

5 | Geothermal | 3569 |

5 | cnnfls_csy | 3569 |

7 | Radewoosh | 3509 |

8 | ecnerwala | 3486 |

9 | jqdai0815 | 3474 |

10 | gyh20 | 3447 |

# | User | Contrib. |
---|---|---|

1 | maomao90 | 171 |

2 | awoo | 164 |

2 | adamant | 164 |

4 | TheScrasse | 159 |

5 | nor | 154 |

5 | maroonrk | 154 |

7 | -is-this-fft- | 152 |

8 | Petr | 147 |

9 | orz | 146 |

10 | pajenegod | 145 |

Comments

0
Sir can you explain In problem D why we will count no of submasks present in an array.Basically I didn't understand the getmaxlength() function |

0
Problem B can also be solved by dp. My submission https://mirror.codeforces.com/contest/1937/submission/24898172.First we create most optimal string and then apply dp for how many ways we can create this string.(Basically number of paths). |

0
https://mirror.codeforces.com/contest/1917/submission/238696258 Can anyone tell why my sol gives wrong answer |

0
Still I didn't understand it |

0
Can anyone explain the concept behind problem D.I didnt understand the editorial |

0
can anyone give the implementation of problem "D".It will be really helpful. |

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/30/2024 07:31:32 (l3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|