/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 320.0 KiB
#2 Accepted 2ms 324.0 KiB
#3 Accepted 2ms 324.0 KiB
#4 Accepted 2ms 324.0 KiB
#5 Accepted 222ms 624.0 KiB
#6 Time Exceeded ≥1092ms ≥544.0 KiB
#7 Time Exceeded ≥1092ms ≥552.0 KiB
#8 Accepted 167ms 604.0 KiB

Code

#include <bits/stdc++.h>
using namespace std;

int main() {
    long long t;
    cin >> t;
    while(t--)
    {
        long long n;
        cin>>n;
        int x;
        int flag = 1;
        for(int i=2; i<=sqrt(n)+1; i++)
        {
            if(n%i==0)
            {
                x = i;
                flag = 0;
                break;
            }
        }
        if(n==2 || n==3)
        {
            cout<<1<<endl;
        }
        else if(flag == 1)
        {
            cout<<1<<endl;
        }
        else{
            cout<<n/x<<endl;
        }
        

    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1052 Yet Another Array Partition
Contest
Brain Booster #3
Language
C++17 (G++ 13.2.0)
Submit At
2024-05-06 17:12:48
Judged At
2024-10-03 13:49:03
Judged By
Score
60
Total Time
≥1092ms
Peak Memory
≥624.0 KiB