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

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


→ Pay attention
Before contest
Codeforces Round (Div. 1, based on COMPFEST 15 - Final Round)
4 days
Register now »
*has extra registration
Before contest
Codeforces Round (Div. 2, based on COMPFEST 15 - Final Round)
4 days
Register now »
*has extra registration
→ Top rated
# User Rating
1 tourist 3775
2 Benq 3724
3 orzdevinwang 3697
4 Radewoosh 3651
5 jiangly 3632
6 cnnfls_csy 3620
7 -0.5 3545
8 inaFSTream 3478
9 fantasy 3468
10 Rebelz 3415
Countries | Cities | Organizations View all →
→ Top contributors
# User Contrib.
1 adamant 178
2 awoo 167
3 BledDest 165
4 Um_nik 163
5 maroonrk 162
6 SecondThread 159
7 nor 158
8 -is-this-fft- 153
9 kostka 146
10 TheScrasse 144
View all →
→ Find user
→ Recent actions
  • A7med_Nageh → Unused accounts with special handles   New comment(s)
  • GeZhiyuan → Codeforces Round 901 (Div. 1, Div. 2) Editorial   New comment(s)
  • Hosen_ba → Help needed in cses problem   Text created or updated
  • flame_boy → How to solve this problem of dynamic programming?   Text created or updated
  • n4bu → Noob Diaries -02   Text created or updated
  • Mong_Mang → How to compile fast for Facebook Hacker Cup?   New comment(s)
  • Supermagzzz → Codeforces Round #693 (Div. 3) Editorial   New comment(s) Necropost
  • Onur_Ilgaz → Ctrl+X and CTRL+V question n=9 worst case (need help from good mathematicians)   New comment(s)
  • Epilogue → Dominant Path Queries   New comment(s)
  • MikeMirzayanov → Rule about third-party code is changing   New comment(s) Necropost
  • sdnr1 → [Tutorial] Searching Binary Indexed Tree in O(log(N)) using Binary Lifting   New comment(s) Necropost
  • Dinocoder → Can anyone help me solve this problem?   Text created or updated
  • Dinocoder → Can you please help me in solving this problem   New comment(s)
  • Abanoub_Ashraf → How to sort points (x,y) in clockwise ?   New comment(s)
  • Gagandeep98 → Stuck On CSES Problem Counting Paths: Please Provide Any Hint   New comment(s) Necropost
  • faiyaz26 → why submissions are skipped?   New comment(s) Necropost
  • stdfloat → Unexpected Full Score   Text created or updated
  • Pyqe → Codeforces Round #902 (Div. 1, Div. 2, based on COMPFEST 15 — Final Round)   New comment(s)
  • qwerty29 → Help needed with Tree Matching problem on CSES!   New comment(s) Necropost
  • Mtaylor → A Simple Approach to Solving Bitwise OR and Bitwise AND Path Queries in a Tree Data Structure   New comment(s)
  • str3ss → thinking of selling my soul to improve my CP skills   New comment(s)
  • DhruvBohara → Can anyone help me solve this problem?   New comment(s)
  • farmerboy → Ask for solution of problem M of 2014 Winter Programming School, Kharkiv, day 1 contest   Text created or updated
  • flash_7 → Digit DP   New comment(s) Necropost
  • eleganc → Make array positive!   New comment(s)
Detailed →
  • Nisanth
  • Blog
  • Teams
  • Submissions
  • Groups
  • Contests
Master

Nisanth

Nisanth D, Chennai, India
From Indian Institute of Technology Madras
  • User''s contest rating in Codeforces community Contest rating: 2271 (max. master, 2292)
  • User''s contribution into Codeforces community Contribution: 0
  • Friend of: 262 users
  • Last visit: online now
  • Registered: 3 years ago
  • Nisanth's blog Blog entries (0), comments
  • Your talks with Nisanth Talks | Send message
Click on the graph to enable the zoom feature.
1514 problems
solved for all time
398 problems
solved for the last year
49 problems
solved for the last month
28 days
in a row max.
10 days
in a row for the last year
7 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: Oct/04/2023 22:20:56 (k2).
Desktop version, switch to mobile version.
Privacy Policy
Supported by
TON ИТМО
 
 
 
 
User lists
 
 
Name