/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Wrong Answer 2ms 524.0 KiB
#3 Accepted 2ms 516.0 KiB
#4 Wrong Answer 3ms 360.0 KiB
#5 Time Exceeded ≥1096ms ≥764.0 KiB
#6 Time Exceeded ≥1094ms ≥536.0 KiB
#7 Time Exceeded ≥1096ms ≥536.0 KiB
#8 Time Exceeded ≥1082ms ≥484.0 KiB

Code

//Fahmidur Rahman Nafi 62 [i]
#include <bits/stdc++.h>
using namespace std;

int main(){
    int t;
    cin >> t;
    while (t--){
        int n;
        cin >> n;
        //vector <int> lst(n);
        /*
        for (int i = 0; i < n; i++){
            cin >> lst[i];
        }
        */
        if (n % 2 == 0){
            cout << n/2 << endl;
        }
        else{
            int sum = 0;
            for (int i = 1 ; i <= n; i++){
                sum += i;
            }

            if (sum % 2 != 0) cout << 1 << endl;
            else{
                int s1 = sum / n;
                int s2 = s1 / 2;
                cout << s2 << endl;
            }
        }
    }
}

Information

Submit By
Type
Submission
Problem
P1052 Yet Another Array Partition
Contest
Brain Booster #3
Language
C++20 (G++ 13.2.0)
Submit At
2024-05-06 15:49:21
Judged At
2024-10-03 13:51:26
Judged By
Score
10
Total Time
≥1096ms
Peak Memory
≥764.0 KiB