Wrong Answer
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];
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:31:14
- Judged At
- 2024-11-11 03:34:11
- Judged By
- Score
- 10
- Total Time
- 2ms
- Peak Memory
- 536.0 KiB