Submission #1683926

---

Source Code Expand

//2017-10-14
//miaomiao
//
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <map>

using namespace std;

#define LL long long
#define For(i, a, b) for(int i = (a); i <= (int)(b); ++i)
#define Forr(i, a, b) for(int i = (a); i >= (int)(b); --i)

#define MN (2200+5)
#define N (100000+5)

inline LL Sqr(LL a){return a * a;}
inline LL Sqr3(LL a){return a * a * a;}

struct node{
	LL x, y, tot;
}me[N];

LL a[N];
map<LL, int> ms;
int mn;

int main(){
	int n, nn = 2200;
	LL x, y, tmp, form;

	scanf("%d", &n);
	
	For(i, 1, n){
		scanf("%lld", &a[i]);
		Forr(j, (int)min((LL)pow(a[i], 1/3.0)+5, 1ll*nn), 2)
			while(!(a[i] % Sqr3(j))) a[i] /= Sqr3(j);
	
		if(ms.count(a[i])){
			++me[ms[a[i]]].tot; continue;
		}

		form = a[i]; x = 1; y = 1;
		Forr(j, (int)min((LL)sqrt(a[i]), 1ll*nn), 2)
			while(!(a[i] % Sqr(j))) x *= j, a[i] /= Sqr(j);
		Forr(j, (int)min(a[i], 1ll*nn), 2)
			while(!(a[i] % j)) y *= j, a[i] /= j;
		
	//	printf("tmp[%d] = %lld (%lld %lld)\n", i, a[i], x, y);
		tmp = sqrt(a[i]);
		if(Sqr(tmp) == a[i]) x *= tmp;
		else y *= a[i];

		me[++mn] = (node){x, y, 1}; ms[a[i]=form] = mn;
	}
//	For(i, 1, n) printf("a[%d] = %lld\n", i, a[i]);
	
	int ans = 0, id;
	LL mv, ov;
	if(ms.count(1)) ++ans, ms[1] = -1;

	For(i, 1, n){
		if(ms[mv = a[i]] == -1) continue;	
		
		id = ms[mv]; ov = me[id].x * Sqr(me[id].y);
		if(!ms.count(ov)){ans += me[id].tot; ms[mv] = -1; continue;}

		ans += max(me[id].tot, me[ms[ov]].tot);
		ms[mv] = ms[ov] = -1;
	}

	printf("%d\n", ans);

	return 0;
}

Submission Info

Compile Error

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

Judge Result