/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 320.0 KiB
#2 Accepted 2ms 556.0 KiB
#3 Time Exceeded ≥1092ms ≥804.0 KiB
#4 Time Exceeded ≥1093ms ≥532.0 KiB

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-11-11 03:18:03
Judged By
Score
40
Total Time
≥1093ms
Peak Memory
≥804.0 KiB