my solution
`#include <bits/stdc++.h>
using namespace std;
int a[100001] = {0};
int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; for(int i = 0; i < n; i++) cin >> a[i];
return 0;
}`
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3843 |
2 | jiangly | 3705 |
3 | Benq | 3628 |
4 | orzdevinwang | 3571 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3530 |
8 | ecnerwala | 3499 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 163 |
3 | adamant | 162 |
4 | TheScrasse | 158 |
5 | nor | 153 |
5 | maroonrk | 153 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
9 | orz | 145 |
10 | pajenegod | 144 |
An unexpectedly difficult problem
`#include <bits/stdc++.h>
using namespace std;
int a[100001] = {0};
int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; for(int i = 0; i < n; i++) cin >> a[i];
return 0;
}`
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en24 |
![]() |
tredsused70 | 2023-01-28 00:38:27 | 5 | (published) | |
en23 |
![]() |
tredsused70 | 2023-01-28 00:38:18 | 1028 | (saved to drafts) | |
en22 |
![]() |
tredsused70 | 2023-01-27 23:56:48 | 0 | Tiny change: 'striction?\n' -> 'striction? There is no restriction to time complexity\n' | |
en21 |
![]() |
tredsused70 | 2023-01-27 22:43:33 | 0 | (published) | |
en20 |
![]() |
tredsused70 | 2023-01-27 22:41:31 | 4 | Tiny change: 'blem of this one.\n\nG' -> 'blem of that one.\n\nG' | |
en19 |
![]() |
tredsused70 | 2023-01-27 22:39:12 | 46 | ||
en18 |
![]() |
tredsused70 | 2023-01-27 22:34:44 | 0 | ||
en17 |
![]() |
tredsused70 | 2023-01-27 22:34:44 | 207 | ||
en16 |
![]() |
tredsused70 | 2023-01-27 22:29:54 | 2 | ||
en15 |
![]() |
tredsused70 | 2023-01-27 22:29:23 | 122 | ||
en14 |
![]() |
tredsused70 | 2023-01-27 22:23:31 | 191 | ||
en13 |
![]() |
tredsused70 | 2023-01-27 22:14:54 | 5 | Tiny change: 'h that $c != b$, and b' -> 'h that $c \ne b$, and b' | |
en12 |
![]() |
tredsused70 | 2023-01-27 22:11:37 | 28 | ||
en11 |
![]() |
tredsused70 | 2023-01-27 22:11:06 | 20 | ||
en10 |
![]() |
tredsused70 | 2023-01-27 22:10:01 | 256 | ||
en9 |
![]() |
tredsused70 | 2023-01-27 22:00:12 | 51 | ||
en8 |
![]() |
tredsused70 | 2023-01-27 21:58:18 | 13 | ||
en7 |
![]() |
tredsused70 | 2023-01-27 21:56:46 | 159 | Tiny change: 'solution">\n~~~~~\n#in' -> 'solution">~~~~~\n#in' | |
en6 |
![]() |
tredsused70 | 2023-01-27 21:51:24 | 66 | ||
en5 |
![]() |
tredsused70 | 2023-01-27 21:50:44 | 49 | Tiny change: '\n\n<spoil' -> '\n~~~~~\nint n = 1;\ncout << n << "\n";\n~~~~~\n\n\n<spoil' | |
en4 |
![]() |
tredsused70 | 2023-01-27 21:50:07 | 5 | ||
en3 |
![]() |
tredsused70 | 2023-01-27 21:48:58 | 25 | ||
en2 |
![]() |
tredsused70 | 2023-01-27 21:47:57 | 256 | ||
en1 |
![]() |
tredsused70 | 2023-01-27 21:46:13 | 122 | Initial revision (saved to drafts) |
Название |
---|