1603A - Di-visible Confusion - CodeForces Solution


constructive algorithms math number theory *1300

Please click on ads to support us..

C++ Code:

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fastio() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define vi  vector<int>
#define vll vector<ll>
#define fo(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
#define show(x) for(auto ele:x)cout<<ele<<" "
#define input(arr,n) for(int i=0;i<n;i++)cin>>arr[i]
#define pair<int,int> pii;
#define priority_queue< int, vector<int>, greater<int> > pql;

int main()
{
	fastio();
	
    int t;
	cin>>t;
	for(int i=0; i<t; i++)
	{
	    int n;
	    cin>>n;
	    
	    vector<int>v;
	    for(int i=0; i<n; i++)
	    {
	    	int x;
	    	cin>>x;
	    	v.push_back(x);
		}
		int flag=1;
		if(n>=22)
		{
		    n=22;
		}
		for(int j=0; j<n; j++)
		{
			int t=0;
			for(int k=2; k<=j+2; k++)
			{
				if(v[j]%k==0)
				{
					t++;
				}
			}
			if(t==j+1)
			{
				flag=-1;
				break;
			}
		}
		if(flag==-1)
		{
			cout<<"NO"<<endl;
		}
		else
		{
			cout<<"YES"<<endl;
		}
		
	}
	return 0;
}


Comments

Submit
0 Comments
More Questions

479C - Exams
1030A - In Search of an Easy Problem
158A - Next Round
71A - Way Too Long Words
160A - Twins
1A - Theatre Square
1614B - Divan and a New Project
791A - Bear and Big Brother
1452A - Robot Program
344A - Magnets
96A - Football
702B - Powers of Two
1036A - Function Height
443A - Anton and Letters
1478B - Nezzar and Lucky Number
228A - Is your horseshoe on the other hoof
122A - Lucky Division
1611C - Polycarp Recovers the Permutation
432A - Choosing Teams
758A - Holiday Of Equality
1650C - Weight of the System of Nested Segments
1097A - Gennady and a Card Game
248A - Cupboards
1641A - Great Sequence
1537A - Arithmetic Array
1370A - Maximum GCD
149A - Business trip
34A - Reconnaissance 2
59A - Word
462B - Appleman and Card Game