#include<iostream>
using namespace std;
int main(){
int n,m,a[21],b[401];
int cnt = 0;
cin >> n >> m;
if(m <= 2 && m != 0) cnt = 1;
for(int i = 0; i < m; i++){
cin >> a[i] >> b[i];
for(int j = i-1; j >= 0; j--){
if(a[i] != a[j] || b[i] != b[j]){
cnt++;
}
}
}
cout << n*(n-1)+1-cnt;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
248 KB |
Output isn't correct |
2 |
Incorrect |
2 ms |
484 KB |
Output isn't correct |
3 |
Incorrect |
2 ms |
588 KB |
Output isn't correct |
4 |
Incorrect |
2 ms |
608 KB |
Output isn't correct |
5 |
Incorrect |
2 ms |
700 KB |
Output isn't correct |
6 |
Incorrect |
2 ms |
700 KB |
Output isn't correct |
7 |
Incorrect |
2 ms |
700 KB |
Output isn't correct |
8 |
Incorrect |
2 ms |
700 KB |
Output isn't correct |
9 |
Incorrect |
1 ms |
700 KB |
Output isn't correct |
10 |
Incorrect |
2 ms |
824 KB |
Output isn't correct |