Hackerrank/sherlock-and-gcd.cpp at master · shklqm/Hackerrank · GitHub

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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int gcd(int a, int b)
{
	if( a == 0)
		return b;
	return gcd(b%a, a);
}

void sherlock(vector<int> &real)
{
	int sum = 0;
	int n = real.size();
	bool flag = false;


	if(n == 1)
	{
		//flag remains false
	}
	else if(n == 2)
	{
		sum = gcd(real[0], real[1]);

		if( sum == 1)
			flag = true;
	}
	else
	{
		int f1, f2;

		f1 = real[0];
		f2 = real[1];

		sum = gcd(f1, f2);

		if( sum == 1)
			flag = true;

		if(!flag)
		{

			for(int i=2; i<n; i++)
			{
				int next;
				next = real[i];
				sum = gcd(sum, next);

				if( sum == 1)
				{
					flag = true;
					break;
				}
				n--;
			}
		}
	}


	if(flag)
		cout<<"YES"<<endl;
	else
		cout<<"NO"<<endl;

}

int main() {
    int T;

    cin>>T;

	while(T > 0)
	{

		vector<int> all, real;
		int n;
		cin>>n;

		for(int i=0; i<n; i++)
		{
			int temp;
			cin>>temp;
			all.push_back(temp);
		}

		sort(all.begin(), all.end());

		int temp = -1;

		for(int i=0; i<n; i++)
		{
			if(all[i] != temp)
			{
				temp = all[i];
				real.push_back(temp);
			}
		}

		sherlock(real);
		T--;
	}


    return 0;
}