/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 536.0 KiB
#2 Accepted 2ms 516.0 KiB
#3 Accepted 2ms 324.0 KiB
#4 Accepted 8ms 352.0 KiB
#5 Time Exceeded ≥1085ms ≥320.0 KiB
#6 Time Exceeded ≥1093ms ≥320.0 KiB
#7 Time Exceeded ≥1089ms ≥512.0 KiB
#8 Time Exceeded ≥1091ms ≥532.0 KiB

Code

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

long long int max_div(long long int num){
    long long int largest = 1; 
    if (num % 2 == 0)
        return num / 2;
    for (long long int i = num/2; i >= 1; i--){
        if (num % i == 0){
            largest = i;
            break;
        }
    }
    return largest;
}

int main() {
    long long int t;
    cin >> t;
    while (t--) {
        long long int n;
        cin >> n;
        cout << max_div(n) << endl;
    }
    return 0;
}

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 17:31:27
Judged At
2024-10-03 13:48:29
Judged By
Score
25
Total Time
≥1093ms
Peak Memory
≥536.0 KiB