# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 151 |
Разбор задач 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 |
---|