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)
25:30:38
 
 
→ 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 179
7 Ashishgup 177
8 maroonrk 172
8 vovuh 172
8 antontrygubO_o 172
View all →
 
 
→ Find user
 
 
→ Recent actions
  • unt311 → writing dfs as a lambda function   New comment(s)
  • ExeW → Wrong answer in problem 469A?   Text created or updated
  • dakuchidiya → Best Chrome Extensions for competitive Programming   New comment(s)
  • venti → Open-and-close-interval DP doubt   New comment(s)
  • Dream_Coder10 → Help!!! (Moduler Multiplecative Inverse)!!..   Text created or updated
  • Kuroni → Codeforces Round #715   New comment(s)
  • Ari → Codeforces Round #715 Editorial   Text created or updated
  • Petr → A yuri week   New comment(s)
  • smit_123 → A Random Thought to stop injustice occurring through codechef long challenge   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)
  • radoslav11 → Invitation to CodeChef April Cook-Off 2021   Text created or updated
  • 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
  • ajit → Divide by Zero 2021 and Codeforces Round #714 (Div. 2) Editorial   Text created or updated
  • piloop → Codeforces Round #119 — Editorial   Text created or updated Necropost
  • deepkamal → How to find total number of simple paths b/w every pair of nodes in polynomial time for directed graph ?   Text created or updated
  • subodhk → Dynamic A2OJ is back!!!   New comment(s) Necropost
  • Vahagn_Grigoryan → C++ Question   New comment(s)
  • awoo → Educational Codeforces Round 95 Editorial   New comment(s)
  • mohammedehab2002 → Codeforces Round #716 (Div.2)   New comment(s)
  • awoo → Educational Codeforces Round 107 Editorial   New comment(s)
  • Sereja → Codeforces Round #160 tutorial   New comment(s) Necropost
  • Samsam → Binomial coefficients with mod   New comment(s) Necropost
Detailed →
  • freakbuoyancy
  • Blog
  • Teams
  • Submissions
  • Contests
 
 
 
 
Pupil

freakbuoyancy

  • User''s contest rating in Codeforces community Contest rating: 1249 (max. pupil, 1392)
  • User''s contribution into Codeforces community Contribution: 0
  • Friend of: 2 users
  • Last visit: 15 hours ago
  • Registered: 10 months ago
  • freakbuoyancy's blog Blog entries (0), comments
  • Your talks with freakbuoyancy Talks | Send message
 
 
 
 
Click on the graph to enable the zoom feature.
 
 
 
 
152 problems
solved for all time
152 problems
solved for the last year
27 problems
solved for the last month
5 days
in a row max.
5 days
in a row for the last year
3 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 15:04:23 (h3).
Desktop version, switch to mobile version.
Privacy Policy
Supported by
Telegram ИТМО
 
 
 
 
User lists
 
 
Name