Accepted
Code
#include<bits/stdc++.h>
using namespace std;
const int mx=1e7+123;
vector<int>divisors[mx];
#define endl '\n'
#define ll long long int
#define optimize() ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int main()
{
ll n,t;
cin>>t;
while(t--){
cin>>n;
if(n%2==0) cout<<(n/2)-1<<endl;
else cout<<n/2<<endl;
}
}
Information
- Submit By
- Type
- Submission
- Problem
- P1073 Pair Sum
- Contest
- Bangladesh 2.0
- Language
- C++20 (G++ 13.2.0)
- Submit At
- 2024-08-16 16:53:05
- Judged At
- 2024-10-03 13:25:12
- Judged By
- Score
- 100
- Total Time
- 344ms
- Peak Memory
- 1.801 MiB