Accepted
Code
#include <iostream>
using namespace std;
int countPairs(int N)
{
return (N - 1) / 2;
}
int main()
{
int T;
cin >> T;
while (T--)
{
int N;
cin >> N;
cout << countPairs(N) << endl;
}
return 0;
}
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:23:52
- Judged At
- 2024-11-11 03:14:54
- Judged By
- Score
- 100
- Total Time
- 202ms
- Peak Memory
- 1.426 MiB