#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define endl '\n'
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 37
#endif
template <typename T>
void print(vector<T> v) {
const int n = v.size();
for(int i = 1; i < n; ++i) {
cout << i << " : " << v[i] << '\n';
}cout << "\n";
}
inline void solve(){
int n, m;
cin >> n >> m;
if(m >= n) {
cout << "NO\n";
return;
}
cout << "YES\n"
<< "1\n"
<< "1";
}
signed main(){
#ifdef LOCAL
freopen("test.in", "r", stdin);
freopen("err.txt", "w", stderr);
#endif
ios_base::sync_with_stdio(0);
cin.tie(NULL);
// signed t; cin >> t; while(t--)
solve();
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 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 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 9 |
Incorrect |
0 ms |
600 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 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 |
1 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 |
0 ms |
344 KB |
Failed to provide a successful strategy. |
| 9 |
Partially correct |
0 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 |
1 ms |
344 KB |
Failed to provide a successful strategy. |
| 19 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 20 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 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 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 9 |
Incorrect |
0 ms |
600 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
