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

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


 
 
→ Pay attention
Before contest
CodeCraft-22 and Codeforces Round #795 (Div. 2)
4 days
 
 
→ Top rated
# User Rating
1 tourist 3764
2 slime 3592
3 maroonrk 3535
4 Benq 3513
5 jiangly 3509
6 ecnerwala 3508
7 MiracleFaFa 3466
8 ksun48 3452
9 Um_nik 3426
10 greenheadstrange 3393
Countries | Cities | Organizations View all →
 
 
→ Top contributors
# User Contrib.
1 awoo 192
2 -is-this-fft- 191
3 Monogon 184
4 YouKn0wWho 182
5 Um_nik 181
6 antontrygubO_o 173
7 maroonrk 168
8 errorgorn 165
9 kostka 164
9 SecondThread 164
View all →
 
 
→ Find user
 
 
→ Recent actions
  • zekigurbuz → Unexpected appearance of the Codeforces logo   New comment(s)
  • dushenkov → How to become black?   New comment(s)
  • kazama460 → CodeNCode channel update   New comment(s)
  • TheScrasse → I'm painfully slow in implementation   New comment(s)
  • antontrygubO_o → Editorial of Codeforces Round 794   New comment(s)
  • Omar_Hafez → Explanation for the mathematical solution of atcoder problem E — Σ[k=0..10^100]floor(X/10^k)   New comment(s)
  • BanazadehAria → Binary Search on real and float numbers   New comment(s) Necropost
  • adamant → Hadamard product and binomial convolution of linear recurrences   New comment(s)
  • fvogel → IOI 2022 Keyboards   New comment(s)
  • Vladosiya → Codeforces Round #776 (Div. 3)   New comment(s)
  • __shivam_kumar → I want to practice dynamic programming   New comment(s)
  • kevin → TJIOI 2022   Text created or updated
  • NotLinux → I have problems in Proving the question   New comment(s)
  • Omar_Hafez → New stress test tool in the competitive programming tool   Text created or updated
  • swapnil07 → Newton's Coding Challenge May 2022 Invite   New comment(s)
  • Lord_David → Finally reaching Specialist   New comment(s)
  • Ahmadsm2005 → Fundraising for IIOT team   New comment(s)
  • Abhyudai_Mishra_2024 → Please guide me or review my profile to reach Pupil   New comment(s)
  • antontrygubO_o → Codeforces Round 794 Announcement   New comment(s)
  • vaibhavmisra → WA in memory efficient Dijkstra using set   New comment(s)
  • mahmoudbadawy → APIO 2022 Open Contest Invitation   New comment(s)
  • SlavicG → Codeforces Round #790 (Div. 4) Editorial   New comment(s)
  • awoo → Educational Codeforces Round 128 Editorial   New comment(s)
  • is-this-dp- → minimum number of steps   New comment(s)
  • ygd161837jn2n313 → How can we solve this by using dp?   New comment(s)
Detailed →
  • tender
  • Blog
  • Teams
  • Submissions
  • Contests
  • Problemsetting
 
 
 
 
Specialist

tender

Xi'an, China
From Shaanxi Normal University
  • User''s contest rating in Codeforces community Contest rating: 1556 (max. specialist, 1556)
  • User''s contribution into Codeforces community Contribution: 0
  • Friend of: 54 users
  • Last visit: 12 months ago
  • Registered: 4 years ago
  • tender's blog Blog entries (0), comments
  • Your talks with tender Talks | Send message
 
 
 
 
Click on the graph to enable the zoom feature.
 
 
 
 
250 problems
solved for all time
0 problems
solved for the last year
0 problems
solved for the last month
8 days
in a row max.
0 days
in a row for the last year
0 days
in a row for the last month

Codeforces (c) Copyright 2010-2022 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: May/28/2022 04:07:58 (g2).
Desktop version, switch to mobile version.
Privacy Policy
Supported by
Telegram ИТМО
 
 
 
 
User lists
 
 
Name