Hi! Codeforces Community. Many a times while practicing problems or in contest we get few problems that take hours of struggle but at the end leave us with something new, some brillaint concept, idea or trick. Just wanted to know about "Special Problems" that you may have come across, that had taught you something great! Please, forgive me for any mistake!
→ Обратите внимание
До соревнования
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
35:38:28
Зарегистрироваться »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
35:38:28
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 05:56:34 (k2).
Десктопная версия, переключиться на мобильную.
При поддержке
This problem (but with O(NlogN)) really helped me understand
slope trick
Thanks for this!
This is a very novice problem that many people come across in the beginning of their journey. Basically , it asks you to compute factorials of larger numbers like 100! (No modulo, the exact no) . To solve this (C++ at least) one has to do manual multiplication on strings from 1 to n and get the final result.
I found this problem quite interesting back when I was relatively new to coding.
https://www.spoj.com/problems/FCTRL2/
https://leetcode.com/problems/stone-game-v/ made me learn that sometimes recursive dp is better than iterative dp. Because in this problem the time limit was strict and while calculating answer with iterative dp we have to calculate all states which lead to TLE while in recursive dp a lot of states which were never going to be used were ignored & giving AC
Looking forward to many more great problems from this blog
Problem 1
Problem 2
Problem 3
Problem 4
Problem 5
Problem 6
What are these problems based on ?
These are my starred problems. I learnt something new from them. One problem is about rerooting technique, one is modifying regular dsu a little bit, one might be small to large trick. Try these and see for yourself.
as I'm a beginner I cant give much advice on this topic I just wanted too thank you for creating such a nice blog the answers will benefit a lot of people(myself as an example)
Welcome :)
I think for me it was this one- ABC165 — C
I learnt how to use
dfs for brute force
from this question and also the calculation for the time complexity of this question taught me about a new concept... it is called stars and sticks something. You should try this question out!