# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
594332 | keta_tsimakuridze | Newspapers (CEOI21_newspapers) | C++14 | 1 ms | 308 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pii pair<int,int>
#define ll long long
const int N = 2e5 + 5, mod = 1e9 + 7;
int t;
main() {
/*
7 6
1 2
1 3
1 4
1 5
1 6
1 7 */
int n, m;
cin >> n >> m;
cout << (m == n - 1 ? "YES" : "NO") << endl;
int x = m;
while(m--) {
int u, v;
cin >> u >> v;
}
if(x == n - 1) {
cout << 1 << " " << 1 << endl;}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |