/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 540.0 KiB
#2 Accepted 1ms 332.0 KiB
#3 Accepted 1ms 540.0 KiB
#4 Accepted 1ms 540.0 KiB
#5 Accepted 20ms 856.0 KiB
#6 Accepted 299ms 788.0 KiB
#7 Accepted 299ms 588.0 KiB
#8 Accepted 15ms 796.0 KiB

Code

// BISMILLAH

#include "bits/stdc++.h"

#define fastIO std::ios::sync_with_stdio(0);std::cin.tie(0)
#define ll long long int
#define flush fflush(stdout)
// #define int ll

using pii = std::pair<int,int>;

const int MOD = 1000000007;
// const int MOD = 998244353;
const int mxN = 500005, inf = 1000000005;

signed main() {
	// fastIO;
	int testCases=1;
	scanf("%lld",&testCases);
	// std::cin >> testCases;
	
	for (int T = 1; T <= testCases; T++) {
        int N;
        scanf("%d", &N);
        if (N&1) {
            int div = N;
            for (int i = 3; i*i <= N; i += 2) {
                if (N%i == 0) {
                    div = i;
                    break;
                }
            }
            printf("%d\n", N / div);
        } else {
            printf("%d\n", N / 2);
        }
    }
	
	return 0;
}

/*

*/

Information

Submit By
Type
Submission
Problem
P1052 Yet Another Array Partition
Language
C++17 (G++ 13.2.0)
Submit At
2024-05-07 10:01:31
Judged At
2024-05-07 10:01:31
Judged By
Score
100
Total Time
299ms
Peak Memory
856.0 KiB