Submission #62774914

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <queue>
#include <bitset>
#include <string.h>
#include <set>
using namespace std;
#define MAX_N 200005
#define MAX_M 500005
set<pair<int, int>> s;
int32_t main() {
    int n, m;
    cin >> n >> m;
    for(int i = 0, a, b; i < m; i++){
        cin >> a >> b;
        if(a == b) continue;
        if(a > b) swap(a, b);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <queue>
#include <bitset>
#include <string.h>
#include <set>
using namespace std;
#define MAX_N 200005
#define MAX_M 500005

set<pair<int, int>> s;

int32_t main() {
    int n, m;
    cin >> n >> m;
    for(int i = 0, a, b; i < m; i++){
        cin >> a >> b;
        if(a == b) continue;
        if(a > b) swap(a, b);
        s.insert(pair<int, int>(a, b));
    }
    cout << m - s.size();
    return 0;
}

Submission Info

Judge Result