# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | -is-this-fft- | 148 |
5 | atcoder_official | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
9 | TheScrasse | 144 |
Разбор задач Codeforces Round #734 (Div.3)
Идеи задач: MikeMirzayanov.
#include <bits/stdc++.h>
int main() {
int t;
std::cin >> t;
while (t--) {
int n;
std::cin >> n;
int c2 = n / 3;
int c2_ = c2 + 1;
int c1 = n - 2 * c2;
int c1_ = n - 2 * c2_;
if (std::abs(c1 - c2) > std::abs(c1_ - c2_)) {
c1 = c1_;
c2 = c2_;
}
std::cout << c1 << ' ' << c2 << '\n';
}
return 0;
}
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en3 |
![]() |
MrPaul_TUser | 2021-07-24 14:22:01 | 23 | ||
en2 |
![]() |
MrPaul_TUser | 2021-07-24 12:15:21 | 0 | (published) | |
ru8 |
![]() |
MrPaul_TUser | 2021-07-24 12:14:48 | 0 | (опубликовано) | |
en1 |
![]() |
MrPaul_TUser | 2021-07-24 12:13:10 | 7789 | Initial revision for English translation (saved to drafts) | |
ru7 |
![]() |
MrPaul_TUser | 2021-07-24 12:11:25 | 33 | Мелкая правка: 'N][MAX_N]; // viewed, taken -> fixed-points\nint a[MA' -> 'N][MAX_N];\nint a[MA' | |
ru6 |
![]() |
MrPaul_TUser | 2021-07-24 12:09:34 | 16 | Мелкая правка: 'Разбор">\n\n</spoile' -> 'Разбор">\n[tutorial:1551F]\n</spoile' | |
ru5 |
![]() |
MrPaul_TUser | 2021-07-24 12:09:14 | 30 | ||
ru4 |
![]() |
MrPaul_TUser | 2021-07-24 12:08:45 | 6 | Мелкая правка: '\n\ntest\n\n' -> '\n\ntest\ntest\n\n' | |
ru3 |
![]() |
MrPaul_TUser | 2021-07-24 12:07:38 | 10 | Мелкая правка: '7-24].\n\n[probl' -> '7-24].\n\ntest\n\n[probl' | |
ru2 |
![]() |
MrPaul_TUser | 2021-07-24 12:03:14 | 7978 | ||
ru1 |
![]() |
MrPaul_TUser | 2021-07-24 11:43:14 | 667 | Первая редакция (сохранено в черновиках) |
Name |
---|