Alien Invasion

#include <iostream>
#include <vector>
 
const int N = 1e7;
int divs[N];
std::vector<int> primes;
 
bool sqr(long long v) {
	long long low = 0;
	long long high = 10 + (int)1e9;
	while(low != high) {
		long long mid = (low + high) >> 1;
		long long val = mid * mid;
		if (val < v) {
			low = mid + 1;
		} else {
			high = mid;
		}
	}
	return (low * low == v);
}
 
int main() {
	for (int i = 0; i < N; ++i) divs[i] = -1;
	for (int i = 2; i < N; ++i) {
		if (divs[i] == -1) {
			divs[i] = primes.size();
			primes.push_back(i);
		}
		for (int j = 0; j <= divs[i]; ++j) {
			int t = i * primes[j];
			if (t >= N) break;
			divs[t] = j;
		}
	}
	
	long long n;
	std::cin >> n;
 
	bool even = false;
	for (auto p : primes) {
		int k = 1;
		while(n % p == 0) {
			++k;
			n /= p;
		}
		if (k % 2 == 0) even = true;
	}
	if (n >= N) {
		if (! sqr(n)) {
			even = true;
		}
	}
	if (even) {
		std::cout << "even\n";
	} else {
		std::cout << "odd\n";
	}
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED