Submission #1521103

---

Source Code Expand

#include<iostream>
#include<fstream>
#include<sstream>
#include<algorithm>
#include<cstdio>
#include<cctype>
#include<cassert>
#include<cmath>
#include<ctime>
#include<cstdlib>
#include<cstring>
#include<string>
#include<queue>
#include<vector>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<iomanip>
#include<utility>
using namespace std;
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define rg register
#define il inline
#define lch(x) ((x)<<1)
#define rch(x) ((x)<<1^1)
#define eprintf(...) fprintf(stderr,__VA_ARGS__)
#define rep0(i,n) for(register int i=0;i<(n);++i)
#define per0(i,n) for(register int i=(n)-1;i>=0;--i)
#define rep(i,st,ed) for(register int i=(st);i<=(ed);++i)
#define per(i,ed,st) for(register int i=(ed);i>=(st);--i)
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef double dbl;
typedef long double ldb;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<typename T> il T qmin(const T &a,const T &b){return a<b?a:b;}
template<typename T> il T qmax(const T &a,const T &b){return a>b?a:b;}
template<typename T> il void getmin(T &a,const T &b){if(a>b) a=b;}
template<typename T> il void getmax(T &a,const T &b){if(a<b) a=b;}
il void fileio(string s){
	freopen((s+".in").c_str(),"r",stdin);
	freopen((s+".out").c_str(),"w",stdout);
}
 
const int inf=(int)1e9+7;
const ll linf=(ll)1e17+7;
const int N=1e5+7;
const int M=2161;
 
ll a[N],need[N],rest[N]; 
int prime[M],tot;
map<pll,int> cnt;
int n;
 
il void init(){
	static bool kicked[M];
	rep(i,2,M-1){
		if(!kicked[i]) prime[++tot]=i;
		rep(j,1,tot){
			if(i*prime[j]>=M) break;
			kicked[i*prime[j]]=true;
			if(i%prime[j]==0) break;
		}
	}
}
 
int main(){
	init();
	scanf("%d",&n);
	rep(i,1,n){
		scanf("%lld",a+i);
		need[i]=rest[i]=1;
		ll tmp=a[i];
		rep(j,1,tot){
			int v=prime[j];
			if(tmp%v!=0) continue;
			int times=0;
			while(tmp%v==0) tmp/=v,++times;
			times%=3;
			if(times==1){
				rest[i]*=v;
				need[i]*=v*v; 
			}else if(times==2){
				rest[i]*=v*v;
				need[i]*=v;
			}
		}
		if(tmp>1){
			ll v=floor(sqrt(tmp));
			if(v*v==tmp){
				rest[i]*=tmp;
				need[i]*=v;
			}else{
				rest[i]*=tmp;
				need[i]*=tmp*tmp;
			}
		}
	//	cerr<<need[i]<<" "<<rest[i]<<endl;
		++cnt[mp(rest[i],need[i])];
	}
	int ans=0;
	while(cnt.begin()!=cnt.end()){
		pll p=cnt.begin()->X,q=mp(p.Y,p.X);
		if(p.X==1) ++ans;
		else{
			ans+=qmax(cnt[p],cnt[q]);
			cnt.erase(q);
		}
		cnt.erase(cnt.begin());
	}
	printf("%d\n",ans);
	return 0;
}

Submission Info

Compile Error

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

Judge Result