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)
03:48:46
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
  • Shefin_ → Codeforces Round #848 (Div. 2)   New comment(s)
  • nitin12384 → Can someone explain Um_nik's elegant approach in an easy 1400 rated DP problem ?   Text created or updated
  • HappyNewYearGoodYear → CP Algorithms and Techniques   New comment(s)
  • adamant → Unlabeling combinatorial species (cycle index series)   Text created or updated
  • awoo → Educational Codeforces Round 141 [Rated for Div. 2]   Text created or updated
  • awoo → Educational Codeforces Round 142 Editorial   New comment(s)
  • sahal → ICPC Dhaka Regional and Preliminary Problemset and Editorials   Text created or updated
  • Vladosiya → Codeforces Round #847 (Div. 3)   New comment(s)
  • Everule → How to prove your solutions in Competitive Programming   New comment(s)
  • pranshukas → Sublime Text is Taking too much time to Compile. Please Help Fixing it !   New comment(s) Necropost
  • AndreyPavlov → Codeforces Round #846 (Div. 2) — Tutorial   New comment(s)
  • tejas10p → Invitation to CodeChef Starters 75 (Rated till 6-stars) - 26th January   New comment(s)
  • Kaleem_Raza_Syed → A new algorithm   New comment(s)
  • arjun95 → segment tree space complexity   New comment(s) Necropost
  • karthiksing05 → Question about time complexity for a certain piece of code:   New comment(s)
  • __Misuki → [tutorial] Bostan-Mori, an elegant algorithm to compute k-th term of linear recurrence in O(dlgdlgk)   Text created or updated
  • TimeWarp101 → Codeforces Round #845 (Div. 2) and ByteRace 2023   New comment(s)
  • cdkrot → Codeforces Round #545 – Editorial   New comment(s) Necropost
  • dimss → Centroid decomposition on a graph with cycles   New comment(s)
  • Kaleem_Raza_Syed → Can you solve this?   New comment(s)
  • adamant → CDQ convolution (online FFT) generalization with Newton method   New comment(s)
  • ChthollyNotaSeniorious → Polynomial Round 2022 (Div. 1 + Div. 2) Editorial   New comment(s)
  • __MOUGOUPAN_22 → Another Math problem   New comment(s)
  • n0sk1ll → Editorial for Hello 2023   New comment(s)
  • vovuh → Codeforces Round #667 (Div. 3) Editorial   New comment(s) Necropost
Detailed →
  • Teja-Smart
  • Blog
  • Teams
  • Submissions
  • Groups
  • Contests
 
 
 
 
Master

Teja-Smart

TEJA DRONADULA, Nellore, India
From Indian Institute of Technology Madras
  • User''s contest rating in Codeforces community Contest rating: 2136 (max. master, 2136)
  • User''s contribution into Codeforces community Contribution: +33
  • Friend of: 364 users
  • Last visit: online now
  • Registered: 2 years ago
  • Teja-Smart's blog Blog entries (0), comments
  • Your talks with Teja-Smart Talks | Send message
 
 
 
 
Click on the graph to enable the zoom feature.
 
 
 
 
1601 problems
solved for all time
684 problems
solved for the last year
31 problems
solved for the last month
29 days
in a row max.
17 days
in a row for the last year
5 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 13:46:16 (g1).
Desktop version, switch to mobile version.
Privacy Policy
Supported by
TON ИТМО
 
 
 
 
User lists
 
 
Name