Enter
|
Register
Home
Top
Catalog
Contests
Gym
Problemset
Groups
Rating
Edu
API
Calendar
Help
Infused
Blog
Teams
Submissions
Groups
Contests
Expert
Infused
Omar Muhammetkulyyev
From
KAIST 어린이집
Contest rating:
1702
(max.
expert,
1723
)
Contribution:
0
Friend of: 65 users
[email protected]
Last visit:
5 months ago
Registered:
10 years ago
Blog entries (0)
,
comments
Talks
|
Send message
Click on the graph to enable the zoom feature.
Only rated
All
Choose year
2020
2019
2018
2017
2016
2015
2014
→ Pay attention
Before contest
Educational Codeforces Round 165 (Rated for Div. 2)
22:02:42
Register now »
→ Streams
CF Edu Round #165 Solution Discussion
By
aryanc403
Before stream
24:12:41
Educational Round 165 Solution Discussion (with myself)
By
Shayan
Before stream
24:12:41
View all →
→ Top rated
#
User
Rating
1
e
cnerwala
3649
2
B
enq
3581
3
j
iangly
3578
4
o
rzdevinwang
3570
5
G
eothermal
3569
5
c
nnfls_csy
3569
7
t
ourist
3565
8
m
aroonrk
3531
9
R
adewoosh
3521
10
U
m_nik
3482
Countries
|
Cities
|
Organizations
View all →
→ Top contributors
#
User
Contrib.
1
maomao90
174
2
awoo
164
3
adamant
161
4
TheScrasse
159
5
nor
158
6
m
aroonrk
156
7
-is-this-fft-
152
8
SecondThread
146
8
orz
146
10
pajenegod
145
View all →
→ Find user
Handle:
→ Recent actions
jdurie
→
Codeforces Round #941 (Div. 1, Div. 2) Editorial
rui_er
→
Codeforces Round 942 (Div. 1, Div. 2)
Cauchico
→
Helvetic Coding Contest 2024 — Online Mirror
Artyom123
→
Codeforces Round 924 Editorial
nocriz
→
Longest break in codeforces participation
awoo
→
Educational Codeforces Round 165 [Rated for Div. 2]
tkien1707
→
I have a problem with a DSU problem:
Beknur-Tumen-045-26
→
Why is it so hard??
ppavic
→
Croatian Olympiad in Informatics (COI) 2024
Traverser_25
→
Solving 8000 problems in 10 days...
atcoder_official
→
AtCoder Beginner Contest 351 Announcement
Le_Gusto
→
Specialist rank celebration!
Termodinamico
→
We say thank you to MikeMirzayanov
SuperJ6
→
Ad-Hoc is Not Real
humbertoyusta
→
[Tutorial] Dp with connected components, a simple way to understand it.
jdurie
→
Codeforces Round #941 (Div. 1, Div. 2)
Serikbay777
→
300iq scam by 300iq
sdyakonov
→
Make proofs
aropan
→
CLIST News
001-Mansur-B-2028
→
TEA IS SUPERIOR
akasakaR
→
Please Help with this MLE in 21D
wuhudsm
→
Invitation to TheForces Round #30 (Good-Forces,TheForces Rated,Prizes!)
Timosh
→
I want to test
Tatsugiri
→
How to calculate shortest path from start to end visiting a certain node
adamant
→
ICPC Swiss Subregional 2023-2024 in gym
Detailed →
User lists
Name