Time Exceeded
Code
#include <iostream>
using namespace std;
int countPairs(int N) {
int count = 0;
for (int i = 1; i < N; ++i) { // Start i from 1 since 0 < i < j < N
int j = N - i;
if (i < j && j < N) { // Ensure 0 < i < j < N
count++;
}
}
return count;
}
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 15:41:25
- Judged At
- 2024-10-03 13:30:34
- Judged By
- Score
- 40
- Total Time
- ≥1097ms
- Peak Memory
- ≥820.0 KiB