Submission #1837812


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;

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];
    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

Submission Time
Task A - Wanna go back home
User SBP
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1028 Byte
Status WA
Exec Time 2 ms
Memory 640 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:30:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&n); Pre();
                 ^
./Main.cpp:32: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

Set Name Sample All
Score / Max Score 0 / 0 0 / 200
Status
WA × 4
WA × 15
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt, s4.txt
All 01.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 13.txt, 15.txt, s1.txt, s2.txt, s3.txt, s4.txt
Case Name Status Exec Time Memory
01.txt WA 2 ms 640 KB
04.txt WA 2 ms 640 KB
05.txt WA 2 ms 640 KB
06.txt WA 2 ms 640 KB
07.txt WA 2 ms 640 KB
08.txt WA 2 ms 640 KB
09.txt WA 2 ms 640 KB
10.txt WA 2 ms 640 KB
11.txt WA 2 ms 640 KB
13.txt WA 2 ms 640 KB
15.txt WA 2 ms 640 KB
s1.txt WA 2 ms 640 KB
s2.txt WA 2 ms 640 KB
s3.txt WA 2 ms 640 KB
s4.txt WA 2 ms 640 KB