-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy path2.cpp
56 lines (48 loc) · 1.38 KB
/
2.cpp
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
46
47
48
49
50
51
52
#include <bits/stdc++.h>
#define f first
#define s second
#define endl "\n"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
template <typename T1, typename T2>
ostream &operator <<(ostream &os, pair<T1, T2> p){os << p.first << " " << p.second; return os;}
template <typename T>
ostream &operator <<(ostream &os, vector<T> &v){for(T i : v)os << i << ", "; return os;}
template <typename T>
ostream &operator <<(ostream &os, set<T> s){for(T i : s) os << i << ", "; return os;}
template <typename T1, typename T2>
ostream &operator <<(ostream &os, map<T1, T2> m){for(pair<T1, T2> i : m) os << i << endl; return os;}
map<char, int> q;
signed main(){
freopen("input.txt", "r", stdin);
//ios_base::sync_with_stdio(false);
//cin.tie(NULL);
string nxt;
int ans =0;
int cnt = 0;
while(getline(cin, nxt)){
if(nxt == ""){
for(auto it = q.begin(); it != q.end(); it++){
if(it -> second == cnt){
ans++;
}
}
q.clear();
cnt = 0;
}else{
for(char i : nxt){
q[i]++;
}
cnt++;
}
}
for(auto it = q.begin(); it != q.end(); it++){
if(it -> second == cnt){
ans++;
}
}
cout << ans << endl;
return 0;
}