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 kostka 164
8 errorgorn 164
8 SecondThread 164
View all →
 
 
→ Find user
 
 
→ Recent actions
  • Please_Read → Need guidance from Codeforces Expert   New comment(s)
  • DishonoredRighteous → Codeforces Round #791 (Div. 2) Editorial   New comment(s)
  • fvogel → IOI 2022 Keyboards   New comment(s)
  • kostka → Unofficial list of IOI 2022 participants   New comment(s)
  • BERNARB.01 → [Discussion] APIO 2022   New comment(s)
  • swapnil07 → Newton's Coding Challenge May 2022 Invite   New comment(s)
  • nor → InterviewForces Contest #1 (Div. 7) Editorial with Behind The Scenes and Bonus Problems   New comment(s)
  • __shivam_kumar → I want to practice dynamic programming   New comment(s)
  • errorgorn → Catalan Numbers and Generating Uniform Balanced Bracket Sequences   New comment(s)
  • antontrygubO_o → Editorial of Codeforces Round 794   New comment(s)
  • FieryPhoenix → Codeforces Round #638 (Div. 2) Editorial   New comment(s) Necropost
  • Lord_David → Finally reaching Specialist   Text created or updated
  • xdfactor2034 → An alternative solution to IOI 2012 Day1 Q3 using Persistent Segment Tree   New comment(s)
  • Omar_Hafez → New stress test tool in the competitive programming tool   New comment(s)
  • nor → InterviewForces Contest #1 (Div. 7)   Text created or updated
  • ljsh_king → problem with counting coprime pairs in an array   New comment(s)
  • BledDest → Codeforces Round #760 (Div. 3) Editorial   New comment(s)
  • sslotin → Modular inverse, Montgomery multiplication, and integer factorization   New comment(s)
  • antontrygubO_o → Codeforces Round 794 Announcement   New comment(s)
  • creep → topcoder wtf   New comment(s)
  • mahmoudbadawy → APIO 2022 Open Contest Invitation   New comment(s)
  • Okrut → Codeforces Round #647 Editorial   New comment(s) Necropost
  • rivalq → Codeforces Round #793 (Div. 2) Editorial   Text created or updated
  • MikeMirzayanov → Rule about third-party code is changing   New comment(s) Necropost
  • kostka → Wow, I didn't expect Pixar to make a movie based on coding competitions   New comment(s)
Detailed →
  • Kinan
  • Blog
  • Teams
  • Submissions
  • Groups
  • Contests
 
 
 
 
Expert

Kinan

kinan saad, Homs, Syria
From IT Faculity, Al-Baath University
  • User''s contest rating in Codeforces community Contest rating: 1764 (max. expert, 1777)
  • User''s contribution into Codeforces community Contribution: +4
  • Friend of: 174 users
  • Last visit: online now
  • Registered: 6 years ago
  • Kinan's blog Blog entries (0), comments
  • Your talks with Kinan Talks | Send message
 
 
 
 
Click on the graph to enable the zoom feature.
 
 
 
 
2920 problems
solved for all time
323 problems
solved for the last year
24 problems
solved for the last month
26 days
in a row max.
11 days
in a row for the last year
2 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/27/2022 15:14:26 (f1).
Desktop version, switch to mobile version.
Privacy Policy
Supported by
Telegram ИТМО
 
 
 
 
User lists
 
 
Name