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

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


→ Pay attention
Before contest
Codeforces Round (Div. 2)
4 days
→ Top rated
# User Rating
1 Benq 3783
2 jiangly 3666
3 tourist 3611
4 Um_nik 3536
5 inaFSTream 3477
6 fantasy 3468
7 maroonrk 3464
8 QAQAutoMaton 3428
9 ecnerwala 3427
10 Ormlis 3396
Countries | Cities | Organizations View all →
→ Top contributors
# User Contrib.
1 Um_nik 185
2 adamant 177
2 awoo 177
4 nor 169
5 maroonrk 165
6 -is-this-fft- 164
7 antontrygubO_o 154
8 ko_osaga 151
9 dario2994 150
10 SecondThread 149
View all →
→ Find user
→ Recent actions
  • hxu10 → It's time to say goodbye, but not fairwell, to codeforces   New comment(s)
  • AJ__20 → NEED OPTIMAL SOLUTION   New comment(s)
  • minhcool → IOI 2023 teams   New comment(s)
  • letsJustDoIt → [Help] Is there something like Competitive Programing Handbook in PYTHON ?   New comment(s)
  • BledDest → 2022-2023 Southern And Volga Russian Regional - Editorial   New comment(s)
  • n1k1450 → Guidance for solving more or equal to R1500 problem   New comment(s)
  • 0-jij-0 → [C++ Question] Reading Compile Time Constants   Text created or updated
  • Loserinlife → Choose k elements fromff an array so that the GCD is maximise.   New comment(s)
  • Brovko → Codeforces Round #823 — editorial   New comment(s)
  • visheshgautam.official → How can we avoid memory limit execeeded errors?   New comment(s)
  • gjaiswal108 → Minimum number of operations to convert array A to array B by adding an integer into a subarray.   New comment(s) Necropost
  • practice080 → A difficult tree problem   New comment(s)
  • awoo → Educational Codeforces Round 149 Editorial   New comment(s)
  • FelixMP → Spain Olympiad in Informatics 2023 Online Mirror   New comment(s)
  • anshukumar_729 → Empowering Competitive Programmers with Codeforces Helper   New comment(s)
  • bigSchrodinger → What is wrong with Codechef?   New comment(s)
  • Gheal → Codeforces Round #875 (Div.1 + Div. 2) Editorial   New comment(s)
  • Ma7moud → How to compute NCr % mod when mod is a prime power   New comment(s)
  • NaZaR.IO → CPython Intermediate Contest #9 | CPython.uz   Text created or updated
  • rash42 → Prefix Array   New comment(s) Necropost
  • diskoteka → Codeforces Round #867 (Div. 3) Editorial   New comment(s)
  • ayonokoji → need help with a div3 problem   New comment(s)
  • Chilli → C++ STL: Order of magnitude faster hash tables with Policy Based Data Structures   New comment(s) Necropost
  • awoo → Educational Codeforces Round 131 Editorial   New comment(s)
  • pabloskimg → Find an odd-length cycle in an undirected graph?   New comment(s) Necropost
Detailed →
  • RecursiveCo
  • Blog
  • Teams
  • Submissions
  • Contests
Expert

RecursiveCo

Geneva, Switzerland
From Swiss Olympiad in Informatics
  • User''s contest rating in Codeforces community Contest rating: 1794 (max. expert, 1794)
  • User''s contribution into Codeforces community Contribution: +12
  • Friend of: 17 users
  • Last visit: 26 hours ago
  • Registered: 7 months ago
  • RecursiveCo's blog Blog entries (0), comments
  • Your talks with RecursiveCo Talks | Send message
Click on the graph to enable the zoom feature.
252 problems
solved for all time
252 problems
solved for the last year
26 problems
solved for the last month
8 days
in a row max.
8 days
in a row for the last year
4 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: May/30/2023 21:24:47 (j2).
Desktop version, switch to mobile version.
Privacy Policy
Supported by
TON ИТМО
 
 
 
 
User lists
 
 
Name