/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Wrong Answer 1ms 320.0 KiB
#2 Wrong Answer 2ms 532.0 KiB
#3 Accepted 2ms 532.0 KiB
#4 Wrong Answer 2ms 532.0 KiB
#5 Wrong Answer 211ms 656.0 KiB
#6 Time Exceeded ≥1086ms ≥572.0 KiB
#7 Time Exceeded ≥1094ms ≥564.0 KiB
#8 Wrong Answer 158ms 620.0 KiB

Code

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define f(i,n) for(ll i=0;i<n;i++)
#define m(a,b,c) max(a,max(b,c))
#define N ll n;cin >> n;
#define Nk ll n,k;cin >> n >> k;
#define A ll a[n];f(i,n) cin >> a[i];
#define FAST_IO ios_base::sync_with_stdio(false), cin.tie(nullptr);
#define YES cout<<"YES"<<endl;
#define NO cout<<"NO"<<endl;
#define S string s;cin>>s;
#define pb push_back

int main()
{
   FAST_IO;
   ll t;
   cin>>t;
   while(t--)
   {
       N;
       ll c=n;
       for(ll i=2;i*i<=n;i++)
       {
           if(n%i==0)
           {
               c=n/i;
               break;
           }
       }
       cout<<c<<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 15:20:11
Judged At
2024-10-03 13:52:22
Judged By
Score
5
Total Time
≥1094ms
Peak Memory
≥656.0 KiB