Codeforces
In English По-русски
Enter | Register

 
 
 
 
  • Home
  • Top
  • Contests
  • Gym
  • Problemset
  • Groups
  • Rating
  • Edu
  • API
  • Calendar
  • Help


 
 
→ Pay attention
Before contest
Codeforces Round #716 (Div. 2)
21:46:01
Register now »
*has extra registration
 
 
→ Top rated
# User Rating
1 tourist 3682
2 ecnerwala 3603
3 Benq 3549
4 Radewoosh 3494
5 Petr 3452
6 ksun48 3413
7 maroonrk 3406
8 Miracle03 3314
9 scott_wu 3313
10 Um_nik 3299
Countries | Cities | Organizations View all →
 
 
→ Top contributors
# User Contrib.
1 1-gon 214
2 Errichto 189
3 awoo 188
4 rng_58 187
5 SecondThread 186
6 Um_nik 178
7 Ashishgup 177
8 maroonrk 173
9 antontrygubO_o 172
10 -is-this-fft- 169
View all →
 
 
→ Find user
 
 
→ Recent actions
  • shreya_10 → Why My code give wrong ans on test cases 10 ? i think my code is right. please help me i am new to codeforces. **_- [this is problem](https://codeforces.com/problemset/problem/205/A)_**   New comment(s)
  • maroonrk → AtCoder Regular Contest 117 Announcement   New comment(s)
  • radoslav11 → Invitation to CodeChef April Cook-Off 2021   New comment(s)
  • DMCoder → CP Runner — A script to quickly run and diff your competitive programs   New comment(s)
  • Ari → Codeforces Round #715 Editorial   New comment(s)
  • mohammedehab2002 → Codeforces Round #716 (Div.2)   New comment(s)
  • TheDramaQueen → How hard is it to become red in CF   New comment(s) Necropost
  • ajit → Divide by Zero 2021 and Codeforces Round #714 (Div. 2) Editorial   Text created or updated
  • smit_123 → A Random Thought to stop injustice occurring through codechef long challenge   Text created or updated
  • Dream_Coder10 → Moduler Multiplicative inverse is not working under modulo 1e9+7!!!   Text created or updated
  • hmehta → TCO21 Round 1A   New comment(s)
  • ExeW → Can you help with simple code?   New comment(s)
  • Dream_Coder10 → Help!!! (Moduler Multiplecative Inverse)!!..   New comment(s)
  • deepkamal → How to find total number of simple paths b/w every pair of nodes in polynomial time for directed graph ?   New comment(s)
  • Alikhan_K → What am I doing wrong?   New comment(s)
  • dakuchidiya → Best Chrome Extensions for competitive Programming   New comment(s)
  • unt311 → writing dfs as a lambda function   New comment(s)
  • venti → Open-and-close-interval DP doubt   New comment(s)
  • Kuroni → Codeforces Round #715   New comment(s)
  • Petr → A yuri week   New comment(s)
  • Furko → Analysis of Codeforces Round #186 (Div. 2)   Text created or updated Necropost
  • zucyo05 → [C++] Combinatorics with Explanation for Find XOR Sum of All Pairs Bitwise AND on Leetcode   New comment(s)
  • Enigma27 → Manthan, Codefest'19 Editorial   New comment(s) Necropost
  • chokudai → Japanese Student Championship 2021 Announcement   New comment(s)
  • sharabhagrawal25 → Graph Theory COPS Youtube Channel [HINDI + ENGLISH]   Text created or updated
Detailed →
  • rumman_sust
  • Blog
  • Teams
  • Submissions
  • Groups
  • Contests
 
 
 
 
Expert

rumman_sust

Rumman Mahmud, Bangladesh
From Shahjalal University of Science and Technology
  • User''s contest rating in Codeforces community Contest rating: 1654 (max. expert, 1861)
  • User''s contribution into Codeforces community Contribution: 0
  • Friend of: 556 users
  • Last visit: 8 months ago
  • Registered: 9 years ago
  • rumman_sust's blog Blog entries (9), comments
  • Your talks with rumman_sust Talks | Send message
 
 
 
 
Click on the graph to enable the zoom feature.
 
 
 
 
692 problems
solved for all time
0 problems
solved for the last year
0 problems
solved for the last month
9 days
in a row max.
0 days
in a row for the last year
0 days
in a row for the last month

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Apr/18/2021 18:48:59 (h2).
Desktop version, switch to mobile version.
Privacy Policy
Supported by
Telegram ИТМО
 
 
 
 
User lists
 
 
Name