#include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define fi first
#define se second
using namespace std;
map<int,set<int>> adj;
int main() {
int n, m; cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b; char c;
cin >> a >> b >> c;
adj[a].insert(b);
adj[b].insert(a);
}
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (adj[i].size() == n-1) cnt++;
}
cout << cnt;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |