/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 476.0 KiB
#2 Accepted 2ms 540.0 KiB
#3 Accepted 2ms 412.0 KiB
#4 Accepted 2ms 796.0 KiB
#5 Time Exceeded ≥1025ms ≥608.0 KiB
#6 Time Exceeded ≥1087ms ≥568.0 KiB
#7 Time Exceeded ≥1004ms ≥584.0 KiB
#8 Accepted 602ms 628.0 KiB

Code

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

#define ll long long
#define endl '\n'

void solve(int cs){
    int n;cin>>n;
    
    int ans = 1;
    for(int i = 2; i*i <= n; i++){
        if(n%i == 0){
            ans = max({ans,i,n/i});
        }
    }
    cout<<ans<<endl;

}
   
int main()
{

    ios_base::sync_with_stdio(false);cin.tie(0);
    int t=1,cs=0;
    cin >> t;
    while(t--)
    {
        solve(++cs);
    }

    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 15:12:47
Judged At
2024-10-03 13:52:43
Judged By
Score
45
Total Time
≥1087ms
Peak Memory
≥796.0 KiB