/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 324.0 KiB
#2 Accepted 1ms 516.0 KiB
#3 Accepted 1ms 768.0 KiB
#4 Accepted 1ms 532.0 KiB
#5 Accepted 57ms 536.0 KiB
#6 Accepted 928ms 576.0 KiB
#7 Accepted 941ms 612.0 KiB
#8 Accepted 44ms 624.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define dbg(a,b,c,d) cerr<<a<<"  "<<b<<"  "<<c<<"  "<<d<<endl;
#define kill(a) {cout<<a<<endl;continue;}
#define KILL(a) {cout<<a<<endl;return 0;}
#define debug cerr<<"Error Found"<<endl;
#define mem(a,b) memset(a,b,sizeof(a))
#define lcm(a, b) (a/__gcd(a,b))*b
#define w(t) cin>>t;while(t--)
#define pi  2 * acos(0.0)
#define ll long long int
#define endl "\n"
#define INF (1LL<<61)
int t, cs = 0;
const int mxn = 2e6 + 5, mod = 1e9 + 7;

int32_t main()
{
    fast;
    w(t){
    int n;
    cin >> n;
    bool f = true;
    int ans = 1;
    for(int i = 2; i * i <= n and f; i++)
    {
        if(n % i == 0)f = false, ans = n / i;
    }
    cout << ans << endl;
    }
}

Information

Submit By
Type
Submission
Problem
P1052 Yet Another Array Partition
Language
C++20 (G++ 13.2.0)
Submit At
2024-05-15 14:23:27
Judged At
2024-11-11 03:30:07
Judged By
Score
100
Total Time
941ms
Peak Memory
768.0 KiB