/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 332.0 KiB
#2 Wrong Answer 2ms 336.0 KiB
#3 Accepted 2ms 476.0 KiB
#4 Wrong Answer 2ms 404.0 KiB
#5 Wrong Answer 323ms 620.0 KiB
#6 Time Exceeded ≥1051ms ≥572.0 KiB
#7 Time Exceeded ≥1077ms ≥560.0 KiB
#8 Wrong Answer 237ms 584.0 KiB

Code

//on the name of Allah:)
#include<bits/stdc++.h>
#define int         long long
#define endl        "\n"
#define pi          2 * acos(0.0)
#define mod         1000000007
#define Mul(a,b)    (a%mod * b%mod)%mod
#define Add(a,b)    (a%mod + b%mod)%mod
#define all(x)      (x).begin(),(x).end()
#define allr(x)     (x).rbegin(),(x).rend()
#define gcd(x, y)   (__gcd(x, y))
#define lcm(x, y)   ((x/gcd(x, y))*y)
#define faster      cin.tie(NULL), cout.tie(NULL);
#define TC          int t ; cin>>t ; while (t--)
const int N = 1e9 + 7;
using namespace std;

int spf(int n)
{

    for(int i = 2 ; i * i <= n ; i++) {
        if(n % i == 0) {
            return i;
        }
    }
}

bool is_prime(int n) {

    for(int i = 2; i * i <=n; i++) {
        if(n%i==0) {
            return false;
        }
    }
    return true;
}


void s()
{
    int n;
    cin >> n;
    if(n%2==0) {
        cout << n/2 << endl;
    }
    else {
        if(is_prime(n)) {
            cout << "1" << endl;
        }
        else {
            cout << spf(n) << endl;
        }
    }
}
int32_t main()
{   ios::sync_with_stdio(false);

    TC
    s();


}




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:18:28
Judged At
2024-10-03 13:52:29
Judged By
Score
10
Total Time
≥1077ms
Peak Memory
≥620.0 KiB