# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
811760 | 2023-08-07T05:43:57 Z | enerelt14 | Newspapers (CEOI21_newspapers) | C++14 | 0 ms | 0 KB |
#include <algorithm> #include <array> #include <bitset> #include <cassert> #include <chrono> #include <climits> #include <cmath> #include <complex> #include <cstring> #include <functional> #include <iomanip> #include <iostream> #include <map> #include <numeric> #include <queue> #include <random> #include <set> #include <vector> using namespace std; int n, m; vector<int> adj[1005]; int main() { cin >> n >> m; if(m >= n) { cout << "NO\n"; return 0; } else { cout << "YES\n"; return 0; } for(int i = 0; i < m; i++) { int u, v; cin >> u >> v; adj[u].pb(v); adj[v].pb(u); } }