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

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


 
 
→ Pay attention
Before contest
Codeforces Round #847 (Div. 3)
10:21:50
Register now »
 
 
→ Top rated
# User Rating
1 Benq 3813
2 tourist 3768
3 maroonrk 3570
4 Radewoosh 3535
5 fantasy 3526
6 jiangly 3523
7 Um_nik 3522
8 orzdevinwang 3441
9 cnnfls_csy 3427
10 zh0ukangyang 3423
Countries | Cities | Organizations View all →
 
 
→ Top contributors
# User Contrib.
1 awoo 180
2 -is-this-fft- 179
3 nor 169
4 Um_nik 167
5 SecondThread 164
6 maroonrk 162
6 adamant 162
8 kostka 161
9 YouKn0wWho 158
10 errorgorn 155
View all →
 
 
→ Find user
 
 
→ Recent actions
  • cdkrot → Codeforces Round #545 – Editorial   New comment(s) Necropost
  • __Misuki → [tutorial] Bostan-Mori, an elegant algorithm to compute k-th term of linear recurrence in O(dlgdlgk)   New comment(s)
  • tejas10p → Invitation to CodeChef Starters 75 (Rated till 6-stars) - 26th January   New comment(s)
  • Kaleem_Raza_Syed → A new algorithm   Text created or updated
  • dimss → Centroid decomposition on a graph with cycles   New comment(s)
  • adamant → Unlabeling combinatorial species (cycle index series)   New comment(s)
  • Kaleem_Raza_Syed → Can you solve this?   New comment(s)
  • awoo → Educational Codeforces Round 142 Editorial   New comment(s)
  • adamant → CDQ convolution (online FFT) generalization with Newton method   New comment(s)
  • Vladosiya → Codeforces Round #847 (Div. 3)   New comment(s)
  • ChthollyNotaSeniorious → Polynomial Round 2022 (Div. 1 + Div. 2) Editorial   New comment(s)
  • __MOUGOUPAN_22 → Another Math problem   New comment(s)
  • karthiksing05 → Question about time complexity for a certain piece of code:   New comment(s)
  • n0sk1ll → Editorial for Hello 2023   New comment(s)
  • iAngkur → Need Help in solving Extended Euclidean / Diophantine Equation   Text created or updated
  • vovuh → Codeforces Round #667 (Div. 3) Editorial   New comment(s) Necropost
  • abhijeet.fasate21 → Number Theory   New comment(s)
  • I_love_IldarKA → Unofficial list of IZhO 2023 participants   New comment(s)
  • YouKn0wWho → The Ultimate Topic List (with Resources, Problems and Templates)   New comment(s) Necropost
  • AndreyPavlov → Codeforces Round #846 (Div. 2) — Tutorial   New comment(s)
  • 998batrr → IZhO 2022   New comment(s)
  • Everule → How to prove your solutions in Competitive Programming   New comment(s)
  • nor → Insights from testing and preparing contests, and why problemsetting trends need to change   New comment(s)
  • tourist → Codeforces Round #740 Editorial   New comment(s) Necropost
  • sahal → ICPC Dhaka Regional and Preliminary Problemset and Editorials   New comment(s)
Detailed →
  • VeryGoodVeryGood
  • Blog
  • Teams
  • Submissions
  • Contests
 
 
 
 
Pupil

VeryGoodVeryGood

  • User''s contest rating in Codeforces community Contest rating: 1219 (max. specialist, 1450)
  • User''s contribution into Codeforces community Contribution: 0
  • Friend of: 4 users
  • Last visit: 8 months ago
  • Registered: 3 years ago
  • VeryGoodVeryGood's blog Blog entries (2), comments
  • Your talks with VeryGoodVeryGood Talks | Send message
 
 
 
 
Click on the graph to enable the zoom feature.
 
 
 
 
307 problems
solved for all time
0 problems
solved for the last year
0 problems
solved for the last month
17 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-2023 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jan/27/2023 07:13:11 (f1).
Desktop version, switch to mobile version.
Privacy Policy
Supported by
TON ИТМО
 
 
 
 
User lists
 
 
Name