CF757B: Bash's Big Day(分解质因子)
2017-01-17 23:40
323 查看
B. Bash's Big Day
time limit per test
2 seconds
memory limit per test
512 megabytes
input
standard input
output
standard output
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.
Input
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.
Output
Print single integer — the maximum number of Pokemons Bash can take.
Examples
input
output
input
output
Note
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,最后遍历数组统计最大值即可,注意处理数为1的情况。
# include <stdio.h>
# include <string.h>
# define MAXN 100000
int max(int a, int b){return a>b?a:b;}
int main()
{
int i, j, n, imax, num, len=0, p[MAXN+1], c[MAXN+1], a[MAXN+1];
memset(p, 0, sizeof(p));
for(i=2; i<=MAXN; ++i)
if(!p[i])
{
c[++len] = i;//记录质数
for(j=i; j<=MAXN; j+=i)
p[j] = 1;
}
while(~scanf("%d",&n))
{
memset(a, 0, sizeof(a));
imax = -1;
while(n--)
{
scanf("%d",&num);
if(num==1)
a[1] = 1;
for(i=1; c[i]*c[i]<=num && i<=len; ++i)//分解质因子
{
if(!(num%c[i]))
{
++a[c[i]];
for(;!(num%c[i]);num/=c[i]);
}
}
if(num != 1)
++a[num];
}
for(i=1; i<=MAXN; ++i)
imax = max(imax, a[i]);
printf("%d\n",imax);
}
return 0;
}
time limit per test
2 seconds
memory limit per test
512 megabytes
input
standard input
output
standard output
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.
Input
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.
Output
Print single integer — the maximum number of Pokemons Bash can take.
Examples
input
3 2 3 4
output
2
input
5 2 3 4 6 7
output
3
Note
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,最后遍历数组统计最大值即可,注意处理数为1的情况。
# include <stdio.h>
# include <string.h>
# define MAXN 100000
int max(int a, int b){return a>b?a:b;}
int main()
{
int i, j, n, imax, num, len=0, p[MAXN+1], c[MAXN+1], a[MAXN+1];
memset(p, 0, sizeof(p));
for(i=2; i<=MAXN; ++i)
if(!p[i])
{
c[++len] = i;//记录质数
for(j=i; j<=MAXN; j+=i)
p[j] = 1;
}
while(~scanf("%d",&n))
{
memset(a, 0, sizeof(a));
imax = -1;
while(n--)
{
scanf("%d",&num);
if(num==1)
a[1] = 1;
for(i=1; c[i]*c[i]<=num && i<=len; ++i)//分解质因子
{
if(!(num%c[i]))
{
++a[c[i]];
for(;!(num%c[i]);num/=c[i]);
}
}
if(num != 1)
++a[num];
}
for(i=1; i<=MAXN; ++i)
imax = max(imax, a[i]);
printf("%d\n",imax);
}
return 0;
}
相关文章推荐
- Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined) -- B. Bash's Big Day (唯一分解定理)
- 【codeforces 757B】 Bash's Big Day
- Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined) B - Bash's Big Day 枚举
- Codeforces 757 B Bash's Big Day
- Codeforces 757 B Bash's Big Day
- codeforces-757-B Bash's Big Day(简单题)
- Codeforces Round #391 -B. Bash's Big Day
- 【Codeforces 757 Bash's Big Day】+ 手速
- Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined) B. Bash's Big Day(分拆素因子+求最多的公因子)
- codeforces 757 B. Bash's Big Day
- Codeforces Round #326 (Div. 2) B. Duff in Love (分解质因子)
- AYIT2016省赛集训第五周 K - Minimum Sum LCM(分解质因子)
- HDU5428 The Factor【分解质因子】
- HDU 5428 The Factor(分解质因子)
- POJ-1730 Perfect Pth Powers 分解质因子
- Uva 10780 Again Prime? No Time.(分解质因子)
- 快速分解质因子
- poj_1142_Smith Numbers(分解质因子)
- CCNU第五周赛前练习:将一个数分解成质因子相乘的形式
- zzuli OJ 1071: 分解质因子