Bash has set out on a journey to become the greatest Pokemon master. To get his first Pokemon, he went to Professor Zulu's Lab. Since Bash is Professor Zulu's favourite student, Zulu allows him to take as many Pokemon from his lab as he pleases.
But Zulu warns him that a group of k > 1 Pokemon with strengths {s1, s2, s3, ..., sk} tend to fight among each other if gcd(s1, s2, s3, ..., sk) = 1 (see notes for gcd definition).
Bash, being smart, does not want his Pokemon to fight among each other. However, he also wants to maximize the number of Pokemon he takes from the lab. Can you help Bash find out the maximum number of Pokemon he can take?
Note: A Pokemon cannot fight with itself.
The input consists of two lines.
The first line contains an integer n (1 ≤ n ≤ 105), the number of Pokemon in the lab.
The next line contains n space separated integers, where the i-th of them denotes si (1 ≤ si ≤ 105), the strength of the i-th Pokemon.
Print single integer — the maximum number of Pokemons Bash can take.
3 2 3 4
2
5 2 3 4 6 7
3
gcd (greatest common divisor) of positive integers set {a1, a2, ..., an} is the maximum positive integer that divides all the integers {a1, a2, ..., an}.
In the first sample, we can take Pokemons with strengths {2, 4} since gcd(2, 4) = 2.
In the second sample, we can take Pokemons with strengths {2, 4, 6}, and there is no larger group with gcd ≠ 1.
题目大意:
让你在N个数中,让你寻找一个子序列b1,b2,b3..........bn,使得:gcd(b1,b2,b3,............bn)!=1;
并且使得这个子序列中的数字尽可能的多,问最多可以有多少个数。
思路:
直接线性筛即可。
我们处理过程中,维护基数的倍数的个数。
注意,因为题干中说明,至少要拿一个数,那么虽然gcd(1)=1,但是我们对于这种情况,也需要进行特殊判定,其答案也是1。
Ac代码:
#include<stdio.h>
#include<iostream>
#include<string.h>
#include<math.h>
using namespace std;
int Is_or[100050];
int vis[106000];
int ans[106000];
void init()
{
memset(ans,0,sizeof(ans));
memset(Is_or,0,sizeof(Is_or));
for(int i=2;i<100040;i++)
{
if(Is_or[i]==0)
{
if(vis[i]>0)
ans[i]+=vis[i];
for(int k=i*2;k<=100040;k+=i)
{
if(vis[k]>0)ans[i]+=vis[k];
Is_or[k]=1;
}
}
}
}
int main()
{
int n;
while(~scanf("%d",&n))
{
memset(vis,0,sizeof(vis));
for(int i=0;i<n;i++)
{
int x;
scanf("%d",&x);
vis[x]++;
}
init();
int output=1;
for(int i=1;i<=100040;i++)
{
output=max(output,ans[i]);
}
printf("%d\n",output);
}
}