题目链接:http://codeforces.com/problemset/problem/757/B
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.
题意:
给你一组数,求出里面最大公约数不为1的最多数量。
思路:把一个个数拿去因式分解,因子最多的那个就是答案。有点类似素数筛选法。第一次做的时候用gcd函数,两个for循环,gcd函数递归华丽丽的超时了
#define _CRT_SBCURE_MO_DEPRECATE
#include<iostream>
#include<stdlib.h>
#include<stdio.h>
#include<cmath>
#include<algorithm>
#include<string>
#include<string.h>
#include<set>
#include<queue>
#include<stack>
#include<functional>
using namespace std;
const int maxn = 1000000 + 10;
const int INF = 0x3f3f3f3f;
typedef long long ll;
int g[maxn];
int n;
int k;
int main() {
scanf("%d", &n);
memset(g, 0, sizeof(0));
for (int i = 0; i < n; i++) {
scanf("%d", &k);
for (int j = 1; j*j <= k; j++) {
if (k%j == 0) {
g[j]++;
if (k / j != j)
g[k / j]++;
}
}
}
int sum = 1;
for (int i = 2; i < maxn; i++)
sum = max(sum, g[i]);
printf("%d\n", sum);
return 0;
}