Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //Timus 1880
- #include <iostream>
- using namespace std;
- int main()
- {
- int n1, n2, n3, all, nn[12001], answ=0, sub, ch=0;
- cin >> n1;
- for(int i=0;i<n1;i++)
- {
- cin >> nn[i];
- }
- cin >> n2;
- for(int i=n1;i<(n1+n2);i++)
- {
- cin >> nn[i];
- }
- cin >> n3;
- all = n1+n2+n3;
- for(int i=(n1+n2);i<all;i++)
- {
- cin >> nn[i];
- }
- for(int i=0;i<all;i++)
- {
- for(int y=0;y<all-1;y++)
- {
- if(nn[y]>nn[y+1])
- {
- sub = nn[y];
- nn[y] = nn[y+1];
- nn[y+1] = sub;
- }
- }
- }
- for(int i=0;i<all;i++)
- {
- if(nn[i] == nn[i+1] && nn [i+1] == nn[i+2])
- {
- answ++;
- }
- }
- cout << answ;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement