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

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


 
 
→ Pay attention
Before contest
Codeforces Round #848 (Div. 2)
05:30:15
Register now »
*has extra registration
 
 
→ 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- 178
3 nor 169
4 Um_nik 168
5 SecondThread 164
6 maroonrk 163
7 adamant 162
8 kostka 161
9 YouKn0wWho 158
10 antontrygubO_o 154
View all →
 
 
→ Find user
 
 
→ Recent actions
  • awoo → Educational Codeforces Round 142 Editorial   New comment(s)
  • AndreyPavlov → Codeforces Round #846 (Div. 2) — Tutorial   New comment(s)
  • Sammarize → Codeforces Beta Round 79, editoral   New comment(s) Necropost
  • newplayer5 → dp is hard?   New comment(s)
  • rsj → TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!)   New comment(s)
  • Shefin_ → Codeforces Round #848 (Div. 2)   New comment(s)
  • DON_F → Permutation question   New comment(s)
  • xiaowuc1 → USACO 2022-2023 Second Contest   New comment(s)
  • awoo → Educational Codeforces Round 140 Editorial   New comment(s)
  • MaithiliSude → Explore PANDORA   Text created or updated
  • this.is.shivamsingh → Why the rating changes are rolled back for contest TYPEDB FORCES 2023   New comment(s)
  • chenye3N → How Can I Persuade My Mother to Join Codeforces Contest?   New comment(s)
  • okayabedin → Common Pitfalls to Watch Out for in Competitive Programming   New comment(s)
  • __Noice__ → How to get started with dp problems?   New comment(s)
  • BledDest → 2022-2023 Southern And Volga Russian Regional - Editorial   New comment(s)
  • Tima → IZHO 2017 Problems   New comment(s) Necropost
  • okayabedin → Greedy Algorithm: An Efficient Approach to Problem Solving   New comment(s)
  • Boranno_Golder → Codeforces Rating Issue   New comment(s)
  • SuperSheep → [Help] How do you recover a set of edges that form the minimum cut after running maximum flow?   New comment(s)
  • Noble_Mushtak → Every Technique and Algorithm I Used to Become Grandmaster   New comment(s)
  • chokudai → UNIQUE VISION Programming Contest 2023 New Year (AtCoder Beginner Contest 287) Announcement   New comment(s)
  • snowmanonahoe → Simpler unhackable random numbers   New comment(s)
  • MPatil123 → CodeHive Contest | Alien Mass Communication   New comment(s)
  • rsj → TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) Editorial   New comment(s)
  • sahaun → Invitation to the Replay of AUST CSE Carnival 1.0 Programming Contest   Text created or updated
Detailed →
  • ad1tya_kumar
  • Blog
  • Teams
  • Submissions
  • Groups
  • Contests
 
 
 
 
Pupil

ad1tya_kumar

Aditya Kumar, Ranchi, India
From Indian Institute of Information Technology, Ranchi
  • User''s contest rating in Codeforces community Contest rating: 1205 (max. pupil, 1205)
  • User''s contribution into Codeforces community Contribution: 0
  • Friend of: 14 users
  • Last visit: 51 minute(s) ago
  • Registered: 6 months ago
  • ad1tya_kumar's blog Blog entries (0), comments
  • Your talks with ad1tya_kumar Talks | Send message
 
 
 
 
Click on the graph to enable the zoom feature.
 
 
 
 
134 problems
solved for all time
134 problems
solved for the last year
63 problems
solved for the last month
11 days
in a row max.
11 days
in a row for the last year
11 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: Feb/01/2023 12:04:45 (f1).
Desktop version, switch to mobile version.
Privacy Policy
Supported by
TON ИТМО
 
 
 
 
User lists
 
 
Name