Submission #1837818

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <map>
#include <vector>
#define pb push_back

using namespace std;

typedef long long ll;
typedef pair<int,int> abcd;

const int N=100010;

int n,p[N];
ll a[N],b[N],c[N];

inline void Pre(){
  for(int i=2;i<=100000;i++){
    if(!p[i]) p[++*p]=i;
    for(int j=1;j<=*p && 1LL*p[j]*i<=100000;i++){
      p[p[j]*i]=1; if(i%p[j]==0) break;
    }
  }
}

map<ll,int> vis,ct;

inline char nc(){
  static char buf[100000],*p1=buf,*p2=buf;
  return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}

inline void read(ll &x){
  char c=nc(); x=0;
  for(;c>'9'||c<'0';c=nc());for(;c>='0'&&c<='9';x=x*10+c-'0',c=nc());
}

inline void read(int &x){
  char c=nc(); x=0;
  for(;c>'9'||c<'0';c=nc());for(;c>='0'&&c<='9';x=x*10+c-'0',c=nc());
}

int main(){
  scanf("%d",&n); Pre();
  for(int i=1;i<=n;i++) {
    scanf("%lld",&a[i]); b[i]=1; c[i]=1;
    for(int j=1;j<=*p && 1LL*p[j]*p[j]<=a[i];j++)
      if(a[i]%p[j]==0){
	int cnt=0; while(a[i]%p[j]==0) a[i]/=p[j],cnt++;
	cnt%=3; for(int k=1;k<=cnt;k++) c[i]*=p[j];
	if(cnt) for(int k=cnt+1;k<=3;k++) b[i]*=p[j];
      }
    c[i]*=a[i];
    if(a[i]<=100000) b[i]*=a[i]*a[i];
    ct[c[i]]++;
  }
  int ans=1; vis[1]=1;
  for(int i=1;i<=n;i++){
    if(vis[c[i]]) continue;
    ans+=max(ct[c[i]],ct[b[i]]);
    vis[c[i]]=vis[b[i]]=1;
  }
  printf("%d\n",ans);
  return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:45:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&n); Pre();
                 ^
./Main.cpp:47:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld",&a[i]); b[i]=1; c[i]=1;
                        ^

Judge Result