Hi every one. Happy new year! I wish you all the best in 2023.
What do you think will be the most important event of 2023?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 168 |
2 | awoo | 163 |
3 | adamant | 162 |
4 | maroonrk | 152 |
5 | nor | 151 |
5 | -is-this-fft- | 151 |
7 | atcoder_official | 147 |
7 | TheScrasse | 147 |
9 | Petr | 145 |
10 | pajenegod | 144 |
Hi every one. Happy new year! I wish you all the best in 2023.
What do you think will be the most important event of 2023?
Hi!
How to solve the following problem if each enemy be a circle with a known radius.
In that case the enemy will be killed if we shot any part of its body.
I want a greedy and a divide and conquer algorithm.
Hi everybody! Can any one help me solving this problem.
Given an array of n integers in range 1 to 106 (1 ≤ n ≤ 103), find the minimum steps to make the absolute difference of every two numbers less than or equal to one?
At each step we can subtract 1 from one number and add 1 to an adjacent number.
For example if we do one step on 2nd element of this array: 1,2,3. It can become 2,1,3 or can become 1,1,4 ?
Название |
---|