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

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


→ Pay attention
Before contest
DeepInfra Round 1 (Codeforces Round 1126, Div. 1 + Div. 2)
30:10:54
Register now »
*has extra registration
→ Top rated
# User Rating
1 jiangly 3810
2 Benq 3676
3 Kevin114514 3655
4 maroonrk 3463
5 strapple 3390
6 Um_nik 3387
7 tourist 3384
8 heuristica 3322
9 turmax 3319
10 jiangbowen 3291
Countries | Cities | Organizations View all →
→ Top contributors
# User Contrib.
1 Qingyu 158
2 nik_exists 150
2 maspy 150
4 Um_nik 143
4 AmShZ 143
6 Errichto 139
7 adamant 137
8 maroonrk 134
9 BledDest 132
10 qwexd 129
View all →
→ Find user
→ Recent actions
  • employed → DeepInfra Round 1 (Codeforces Round 1126, Div. 1 + Div. 2)   New comment(s)
  • sachin0000 → Request for Another Chance to Participate in Codeforces   Text created or updated
  • atcoder_official → AtCoder Beginner Contest 476 Announcement   New comment(s)
  • livenlife453 → Why, Mathematically, There is Someone Out There Who Can Love You   New comment(s)
  • Ahanab → Vietnamese Cheater   New comment(s)
  • orange312 → Appeal for Disabled Account — DimensionFried   Text created or updated
  • K1o0n → Codeforces Round #1125 (Div. 3) Editoral   New comment(s)
  • Timosh → Master in a year, Master for a year   New comment(s)
  • Antar-Saginbek-004-2029 → Who are you?   New comment(s)
  • turmax → Are we ready for AGI?   New comment(s)
  • Hardik120710 → A Friendly Discord Competitive Programming Server (very alive)   Text created or updated
  • ran_by_Dipz → Simple O(1) math trick for A — EduRound 189 (Rated for Div. 2)   New comment(s)
  • ZainUlHaq → Reached expert   New comment(s)
  • Hesham.Elkhatib → AlgorEngine: personalized training plans for Codeforces   New comment(s)
  • Mitpro → Why it is hard to predict rating   New comment(s)
  • K1o0n → Codeforces Round #1125 (Div. 3)   New comment(s)
  • 008-Arsenii-L-2029 → What is the best way to improve rating in Codeforces?   New comment(s)
  • namkhanhvinacon → Is this acceptable?   New comment(s)
  • falcon07 → ICPC Charging too much?   New comment(s)
  • Abdur-Rehman → Congratulations to ZainUlHaq   New comment(s)
  • NagornZ → My O(72) Algorithm On Getting a Girlfriend   New comment(s)
  • Mohammed_Nasserr → Invitation to Eolymp Weekend Practice #29   New comment(s)
  • N_Abubakr09 → Help me find where I can submit the IZhO 2026 tasks for checking   New comment(s)
  • JuanMata → Codeforces Round <span class="tex-span"><b>#258</b></span>   New comment(s) Necropost
  • Qingyu → Today's News: O(n^{2-eps}) algorithm for 3SUMs and APSP is found by Claude   New comment(s)
Detailed →
  • Juhaied_nabid
  • Blog
  • Teams
  • Submissions
  • Contests
Newbie

Juhaied_nabid

Dhaka, Bangladesh
From North South University
  • User''s contest rating in Codeforces community Contest rating: 843 (max. newbie, 1070)
  • User''s contribution into Codeforces community Contribution: 0
  • Friend of: 46 users
  • Last visit: 6 months ago
  • Registered: 6 years ago
  • Juhaied_nabid's blog Blog entries (0), comments
  • Your talks with Juhaied_nabid Talks | Send message
Click on the graph to enable the zoom feature.
1409 problems
solved for all time
11 problems
solved for the last year
0 problems
solved for the last month
72 days
in a row max.
3 days
in a row for the last year
0 days
in a row for the last month

Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/09/2026 11:54:06 (g2).
Desktop version, switch to mobile version.
Privacy Policy | Terms and Conditions
Supported by
Telegram
 
 
 
 
User lists
 
 
Name