/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 328.0 KiB
#2 Accepted 1ms 532.0 KiB
#3 Accepted 812ms 936.0 KiB
#4 Time Exceeded ≥1094ms ≥540.0 KiB

Code

#include <iostream>
using namespace std;

int countPairs(int N)
{
    int count = 0;
    for (int i = 1; i <= N / 2; ++i)
    {
        int j = N - i;
        if (i < j && 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 16:21:19
Judged At
2024-10-03 13:27:25
Judged By
Score
70
Total Time
≥1094ms
Peak Memory
≥936.0 KiB