Submission #848321

---

Source Code Expand

#include <bits/stdc++.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define RI(X) scanf("%d", &(X))
#define RII(X, Y) scanf("%d%d", &(X), &(Y))
#define RIII(X, Y, Z) scanf("%d%d%d", &(X), &(Y), &(Z))
#define DRI(X) int (X); scanf("%d", &X)
#define DRII(X, Y) int X, Y; scanf("%d%d", &X, &Y)
#define DRIII(X, Y, Z) int X, Y, Z; scanf("%d%d%d", &X, &Y, &Z)
#define RS(X) scanf("%s", (X))
#define CASET int ___T, case_n = 1; scanf("%d ", &___T); while (___T-- > 0)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define PII pair<int,int>
#define VI vector<int>
#define VPII vector<pair<int,int> >
#define PLL pair<long long,long long>
#define VPLL vector<pair<long long,long long> >
#define F first
#define S second
typedef long long LL;
using namespace std;
const int MOD = 1e9+7;
const int SIZE = 1e5+10;
bool p[SIZE];
VI pp;
int main(){
 REPP(i,2,SIZE){
  if(!p[i])pp.PB(i);
  for(int j=i+i;j<SIZE;j+=i)p[j]=1;
 }
 DRI(N);
 map<LL,int>H;
 int one=1,an=0;
 REP(tt,N){
  LL x,me=1,you=1;
  cin>>x;

  for(int i=0;pp[i]*(LL)pp[i]<=x;++i){
   if(x%pp[i]==0){
    int cc=0;
    while(x%pp[i]==0){
      x%=pp[i];cc++;
     }
    cc%=3;
     if(cc==1)me*=pp[i],you*=pp[i]*(LL)pp[i];
     else if(cc==2)you*=pp[i],me*=pp[i]*(LL)pp[i];
   }
 }
 if(x!=1)me*=x,you*=x*x;
  if(me==1)one=1;
  else{
   if(H[you])H[you]--,an++;
   else H[me]++;
  }
 }
 for(map<LL,int>::iterator it=H.begin();it!=H.end();it++)an+=it->S;
 cout<<an+one<<endl; 
 return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:37:8: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  DRI(N);
        ^

Judge Result