#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
typedef long long ll;
void speed()
{
ios_base::sync_with_stdio(NULL);
cin.tie(NULL);
cout.tie(NULL);
}
int n, m;
void solve()
{
cin >> n >> m;
cout << "YES" << endl;
cout << n << endl;
for (int i = 1; i <= n; i ++)
if (i % 2 == 1)
cout << i << " ";
for (int i = 1; i <= n; i ++)
if (i % 2 == 0)
cout << i << " ";
cout << endl;
}
int main()
{
solve();
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
3 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
4 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
5 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
6 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
7 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
3 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
4 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
5 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
6 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
7 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
8 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
9 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
10 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
11 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
12 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
13 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
14 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
15 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
16 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
17 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
18 |
Partially correct |
0 ms |
344 KB |
Failed to provide a successful strategy. |
19 |
Partially correct |
0 ms |
344 KB |
Failed to provide a successful strategy. |
20 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
3 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
4 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
5 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
6 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
7 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |