Enter
|
Register
Home
Top
Catalog
Contests
Gym
Problemset
Groups
Rating
Edu
API
Calendar
Help
niyaznigmatul
Blog
Teams
Submissions
Groups
Contests
Problemsetting
International Grandmaster
niyaznigmatul
Niyaz Nigmatullin
From
ITMO University
Contest rating:
2665
(max.
international grandmaster,
2864
)
Contribution:
+14
Friend of: 1,512 users
Last visit:
36 hours ago
Registered:
14 years ago
Blog entries (28)
,
comments
Talks
|
Send message
Click on the graph to enable the zoom feature.
Only rated
All
Choose year
2024
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
2013
2012
2011
2010
→ Pay attention
Before contest
Educational Codeforces Round 165 (Rated for Div. 2)
19:48:16
Register now »
→ Streams
CF Edu Round #165 Solution Discussion
By
aryanc403
Before stream
21:58:16
Educational Round 165 Solution Discussion (with myself)
By
Shayan
Before stream
21:58:16
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
Norp
→
Pupil in 80 days — Day 32-47(Week 5,6)
wuhudsm
→
TheForces Round #30 (Good-Forces) Editorial
aropan
→
CLIST News
EndlessDreams
→
TheForces Rounds Editorials
Le_Gusto
→
Specialist rank celebration!
001-Mansur-B-2028
→
TEA IS SUPERIOR
sdyakonov
→
Make proofs
rui_er
→
Codeforces Round 942 (Div. 1, Div. 2)
Beknur-Tumen-045-26
→
Why is it so hard??
jdurie
→
Codeforces Round #941 (Div. 1, Div. 2) Editorial
awoo
→
Educational Codeforces Round 165 [Rated for Div. 2]
coolboy19521
→
I need help
SuperJ6
→
Ad-Hoc is Not Real
nocriz
→
Longest break in codeforces participation
Cauchico
→
Helvetic Coding Contest 2024 — Online Mirror
wuhudsm
→
Invitation to TheForces Round #30 (Good-Forces,TheForces Rated,Prizes!)
Tatsugiri
→
How to calculate shortest path from start to end visiting a certain node
Artyom123
→
Codeforces Round 924 Editorial
tkien1707
→
I have a problem with a DSU problem:
ppavic
→
Croatian Olympiad in Informatics (COI) 2024
Traverser_25
→
Solving 8000 problems in 10 days...
atcoder_official
→
AtCoder Beginner Contest 351 Announcement
Termodinamico
→
We say thank you to MikeMirzayanov
humbertoyusta
→
[Tutorial] Dp with connected components, a simple way to understand it.
jdurie
→
Codeforces Round #941 (Div. 1, Div. 2)
Detailed →
User lists
Name