Hi I am Pretest2. I hit 1800 recently. AMA.
→ Обратите внимание
До соревнования
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
32:50:45
Зарегистрироваться »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
32:50:45
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 22.11.2024 08:44:17 (l1).
Десктопная версия, переключиться на мобильную.
При поддержке
congrats !! can you suggest me some roadmap ... i really want to become green :(
Solving a2oj problem b ladder would be a good step ahead
Please Forgive me for i have failed you 😔
why are you always so annoying
Get better.
Give me tricks to pass you.
Solve more problems diligently
Sorry, posted reply on wrong comment... Now I can't delete it .
what will you do on 22 jan?
Celebrate
Go get a shower
Thanks! can you suggest to me how to do well in the contest..? I want to become green'
Focus on Problem B of past 100 contests maybe.
thank you brother, most of the time ididn't well understand in read question! how to adjust it
Congrats on 1800. Any good suggestions for solving problems of each rating ?
How does it feel knowing that I failed you in life? I am sorry, I am trying my best
I am trying my best to not fail myself.
Why you always get on our nerves during contests?
Sorry
Don't you think the Tenjiku Arc should have a better ending?
True
Don't you have something better to do?
Nope
Hello. Can you give us your location, so that we can send a nuke eliminating you from existence?
pretest1 vs Pretest2 vs pretest3 vs pretest4
Here they are, the codeforces authorities. Who is your favorite?
accepted
i have posted a question in my blog can you solve that for me
Here's where you born (first WA on test 2 in first codeforces contest):
I've seen Edvard on lichess.org
Why do you always give me FST?
Because sometimes I feel weak
For reference:(Question link)
I need proof for this: The idea is to apply Moore’s Voting algorithm, as there can be at max k – 1 elements present in the array which appears more than n/k times so there will be k – 1 candidates. When we encounter an element that is one of our candidates then increment the count else decrement the count.
Can you help? and Consider me a beginner.
Please suggest me a roadmap. I want to be Specialist.
First, try to not lose Pupil