Submission #1686328

---

Source Code Expand

#include <bits/stdc++.h>

typedef long long LL;

const int maxn = 1e5 + 100;

int n, ans;
LL a[maxn];
std::map<LL, int> M;

int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; ++i) {
		scanf("%lld", a + i);
		for(LL y = 2; y * y * y <= a[i]; ++y) {
			while(a[i] % (y * y * y) == 0) {
				a[i] /= (y * y * y);
			}
		}
		if(M.find(a[i]) == M.end()) {
			M[a[i]] = 0;
		}
		++M[a[i]];
	}
	for (int i = 1; i <= n; ++i) {
		if(M.find(a[i]) == M.end()) {
			continue;
		}
		if(a[i] == 1) {
			++ans;
			M.erase(a[i]);
			continue;
		}
		LL m = a[i];
		LL y = 1;
		for (LL x = 2; x <= 2500; ++x) {
			if(a[i] % x == 0) {
				a[i] /= x;
				if(y > 10000000000ll / x) {
					y = 10000000001ll;
					break;
				}
				y *= x;
				if(a[i] % x == 0) {
					a[i] /= x;
				}
				else {
					y *= x;
				}
			}
		}
		if(y > 10000000000ll) {
			ans += M[m];
			M.erase(m);
			continue;
		}
		if(a[i] > 1) {
			LL x = (LL)(sqrt(1. * a[i]));
			while(x * x <= a[i]) {
				++x;
			}
			while(x * x > a[i]) {
				--x;
			}
			if(x * x != a[i]) {
				x = a[i];
			}
			if(y > 10000000000ll / x) {
				ans += M[m];
				M.erase(m);
				continue;
			}
			y *= x;
		}
		if(M.find(y) != M.end()) {
			ans += std::max(M[m], M[y]);
			M.erase(y);
			M.erase(m);
		}
		else {
			ans += M[m];
			M.erase(m);
		}
	}
	printf("%d\n", ans);
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:12:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
./Main.cpp:14:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", a + i);
                       ^

Judge Result