-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathA_Games.cpp
More file actions
45 lines (36 loc) · 777 Bytes
/
A_Games.cpp
File metadata and controls
45 lines (36 loc) · 777 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
////https://codeforces.com/contest/268/problem/A
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int N = 1e5 + 5;
void solve(){
int n; cin >> n;
vector<pair<int,int>> v;
for(int i=0;i<n;i++){
int a,b; cin >> a >> b;
v.push_back({a,b});
}
int ans=0;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(i==j) continue;
if(v[i].first==v[j].second) ans++;
}
}
cout<<ans<<endl;
}
int main() {
solve();
}
// #include <bits\stdc++.h>
// using namespace std;
// int main()
// {
// int i,n=0,m=0,x=3;
// cin>>n;
// int a[n],b[n];
// for(i=0;i<n;i++) cin>>a[i]>>b[i];
// for(i=0;i<n;i++) m+=count(a,a+n,b[i]);
// cout<<m;
// }