#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(x) (x).begin(), (x).end()
int main() {
cin.tie(0)->sync_with_stdio(false);
int n, m;
cin >> n >> m;
if (m == n - 1)
cout << "YES" << '\n' << 1 << ' ' << 1 << '\n';
else
cout << "NO" << '\n';
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Partially correct |
1 ms |
500 KB |
Failed to provide a successful strategy. |
3 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
4 |
Partially correct |
1 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 |
1 ms |
344 KB |
Failed to provide a successful strategy. |
7 |
Correct |
1 ms |
344 KB |
Output is correct |
8 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
9 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Partially correct |
1 ms |
344 KB |
Failed to provide a successful strategy. |
3 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
4 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
5 |
Partially correct |
1 ms |
344 KB |
Failed to provide a successful strategy. |
6 |
Partially correct |
0 ms |
344 KB |
Failed to provide a successful strategy. |
7 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
8 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
9 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
10 |
Partially correct |
1 ms |
344 KB |
Failed to provide a successful strategy. |
11 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
12 |
Partially correct |
1 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 |
344 KB |
Failed to provide a successful strategy. |
15 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
16 |
Partially correct |
1 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 |
1 ms |
344 KB |
Failed to provide a successful strategy. |
19 |
Partially correct |
1 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 |
1 ms |
500 KB |
Failed to provide a successful strategy. |
3 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
4 |
Partially correct |
1 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 |
1 ms |
344 KB |
Failed to provide a successful strategy. |
7 |
Correct |
1 ms |
344 KB |
Output is correct |
8 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
9 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |