1750A - Indirect Sort - CodeForces Solution

constructive algorithms math

Please click on ads to support us..

Python Code: 

for jj in range(int(input())):
    n = int(input())
    a = [int(i) for i in input().split()]
    if a[0] == 1:
        print('YES')
    else:
        print('NO')

C++ Code: 

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int n;
	cin>>n;
	for(int i=0;i<n;i++)
	{
		int a,b=0;
		cin>>a;
		int arr[a];
		for(int j=0;j<a;j++)
		{
			cin>>arr[j];
		}
		if(arr[0]==1)
		{
			cout<<"Yes"<<endl;
		}
		else
		{
			cout<<"No"<<endl;
		}
	}
	return 0;
}


Comments

Submit
0 Comments
More Questions

Missing numbers
Maximum sum
13 Reasons Why
Friend's Relationship
Health of a person
Divisibility
A. Movement
Numbers in a matrix
Sequences
Split houses
Divisible
Three primes
Coprimes
Cost of balloons
One String No Trouble
Help Jarvis!
Lift queries
Goki and his breakup
Ali and Helping innocent people
Book of Potion making
Duration
Birthday Party
e-maze-in
Bricks Game
Char Sum
Two Strings
Anagrams
Prime Number
Lexical Sorting Reloaded
1514A - Perfectly Imperfect Array