Submission #64063603

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<iostream>
#include<string>
#include<vector>
#include<queue>
#include<cmath>
#include<algorithm>
#include<map>
using namespace std;
using ll = long long;
int main() {
  vector<int> a(7);
  for (int i = 0; i < 7; i++) {
    cin >> a[i];
  }
  sort(a.begin(), a.end());
  int maxi = -1;
  for (int i = 0; i <= 4; i++) {
    if (a[i] == a[i + 1] && a[i + 1] == a[i + 2]) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<iostream>
#include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<cmath>
#include<algorithm>
#include<map>

using namespace std;
using ll = long long;

int main() {
	vector<int> a(7);
	for (int i = 0; i < 7; i++) {
		cin >> a[i];
	}
	sort(a.begin(), a.end());
	int maxi = -1;
	for (int i = 0; i <= 4; i++) {
		if (a[i] == a[i + 1] && a[i + 1] == a[i + 2]) {
			maxi = a[i];
		}
	}
	if (maxi == -1)cout << "No" << endl;
	else {
		int q = 0;
		for (int i = 0; i <= 5; i++) {
			if (a[i] != maxi && a[i] == a[i + 1]) {
				q = 1;
			}
		}
		if (q == 1)cout << "Yes" << endl;
		else cout << "No" << endl;
	}
}

Submission Info

Judge Result