/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 332.0 KiB
#2 Wrong Answer 2ms 540.0 KiB
#3 Accepted 2ms 476.0 KiB
#4 Wrong Answer 3ms 584.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];
        for(int i = 0;i < n;i++)
        {
            arr[i] = i+1;
        }
        if(n % 2 == 0)
        cout<<(n / 2)<<endl;
        else
            cout<<1<<endl;
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1052 Yet Another Array Partition
Contest
Brain Booster #3
Language
C++20 (G++ 13.2.0)
Submit At
2024-05-06 15:44:44
Judged At
2024-11-11 03:33:55
Judged By
Score
10
Total Time
3ms
Peak Memory
584.0 KiB