/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 552.0 KiB
#2 Accepted 2ms 532.0 KiB

Code

#include <iostream>
#include <cmath>
#include<map>
using namespace std;

#define endl "\n"
#define int long long
/*
int prime(int a)
{
    int t = 0;
    for(int i = 2;i < a;i++)
    {
        if(a % i == 0)
        {
            t = a;
            break;
        }
    }
    return t;
}
*/
int32_t main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        int arr[n];
        int total = 0;
        int total2 = 0;
        for(int i = 0;i < n;i++)
        {
            cin>>arr[i];
            total += arr[i];
        }
        for(int i = 1;i <= n;i++)
        {
            total2 += i;
        }
        if(total == total2)
            cout<<"YES"<<endl;
        else
            cout<<"NO"<<endl;
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1055 Array Permutation
Contest
Brain Booster #3
Language
C++17 (G++ 13.2.0)
Submit At
2024-05-06 15:17:49
Judged At
2024-10-03 13:52:30
Judged By
Score
100
Total Time
2ms
Peak Memory
552.0 KiB