Enter
|
Register
Home
Top
Catalog
Contests
Gym
Problemset
Groups
Rating
Edu
API
Calendar
Help
aash8a9
Blog
Teams
Submissions
Groups
Contests
Expert
aash8a9
Aashirwad Mishra,
Bengaluru
,
India
From
IIT Kharagpur
Contest rating:
1688
(max.
expert,
1836
)
Contribution:
+6
Friend of: 91 users
Last visit:
22 hours ago
Registered:
15 months ago
Blog entries (0)
,
comments
Talks
|
Send message
Click on the graph to enable the zoom feature.
Only rated
All
Choose year
2024
2023
→ Pay attention
Before contest
Codeforces Round 953 (Div. 2)
4 days
Register now »
*has extra registration
→ Top rated
#
User
Rating
1
t
ourist
3843
2
j
iangly
3705
3
B
enq
3628
4
o
rzdevinwang
3571
5
G
eothermal
3569
5
c
nnfls_csy
3569
7
j
qdai0815
3530
8
e
cnerwala
3499
9
g
yh20
3447
10
R
ebelz
3409
Countries
|
Cities
|
Organizations
View all →
→ Top contributors
#
User
Contrib.
1
maomao90
171
2
awoo
164
3
adamant
162
4
TheScrasse
159
5
m
aroonrk
154
5
nor
154
7
-is-this-fft-
152
8
P
etr
147
9
orz
145
10
pajenegod
144
View all →
→ Find user
Handle:
→ Recent actions
MahmytM
→
How to solve this kind of problem???
cry
→
Codeforces Round 952 (Div. 4)
PeruvianCartel
→
In Div 4 contests on Codeforces, why is the system testing phase and queue so long?
cry
→
Codeforces Round 952 (Div. 4) Editorial
null_awe
→
Codeforces Global Round 26 Editorial
maomao90
→
Hello 2024
DonSilvio
→
Is I/O TL still a thing? If so, what is the ultimate way to avoid it?
telegram_cheaters
→
Please take down this cheating community made by Master 1_2_3_4_5_9 aka Abhipsita Das
tafsiruzzaman
→
How to Find a Safe High-Value and Avoid Overflow in Binary Search
jamjury
→
Memory-mapped i/o
Whitewiz
→
Regarding the problem F of yesterday's contest
maomao90
→
I am top 1 contributor. AMA!
adamant
→
Double-ended eertree
Rising-coder
→
Should I go back ?
adamant
→
I'm adamant, AMA
To_catch_a_cheater
→
Just Reporting Some Cheaters
Lakh
→
Minimum no. of operations to make array strictly increasing
maomao90
→
Editorial for Hello 2024
mesanu
→
Codeforces Round 944 (Div. 4) Editorial
Sammmmmmm
→
Shuffling cards queries.
NBAH
→
Codeforces Round #367 (Editorial)
miniluigi
→
Time Complexity of floor and log2
tfg
→
A notorious coincidence (1854E)
rangerscowboys
→
Any tips for avoiding WA and having speed on easier problems and approaches to easier problems?
awoo
→
Educational Codeforces Round 165 Editorial
Detailed →
User lists
Name