1637A - Sorting Parts - CodeForces Solution


brute force sortings *800

Please click on ads to support us..

Python Code:

for s in[*open(0)][2::2]:
        print('YNEOS'[sorted(a:=s.split(),key=int)==a::2])

C++ Code:

#include<iostream>
using namespace std;
bool sorted(long int a[],int n){
    bool tf=true;
    for(int i=0;i<n-1;i++){
        if(a[i]>a[i+1]) tf=false;
    }
    return tf;
}
int main()
{
    int t;
    cin>>t;
    while(t--){
        int n;
        cin>>n;
        long int a[n];
        for(int i=0;i<n;i++) cin>>a[i];
        if(sorted(a,n)){
            cout<<"NO"<<endl;
        }
        else cout<<"YES"<<endl;
    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

1029A - Many Equal Substrings
1675D - Vertical Paths
1271C - Shawarma Tent
805A - Fake NP
1163A - Eating Soup
787A - The Monster
807A - Is it rated
1096A - Find Divisible
1430C - Numbers on Whiteboard
1697B - Promo
208D - Prizes Prizes more Prizes
659A - Round House
1492C - Maximum width
171B - Star
1512B - Almost Rectangle
831B - Keyboard Layouts
814A - An abandoned sentiment from past
268C - Beautiful Sets of Points
1391C - Cyclic Permutations
11A - Increasing Sequence
1406A - Subset Mex
1365F - Swaps Again
50B - Choosing Symbol Pairs
1719A - Chip Game
454B - Little Pony and Sort by Shift
1152A - Neko Finds Grapes
1719B - Mathematical Circus
1719C - Fighting Tournament
1642A - Hard Way
285C - Building Permutation