HPU第七周周练 A
来源:互联网 发布:手机淘宝如何联系卖家 编辑:程序博客网 时间:2024/05/19 13:44
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 thei-th of them denotes si (1 ≤ si ≤ 105), the strength of thei-th Pokemon.
Print single integer — the maximum number of Pokemons Bash can take.
32 3 4
2
52 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个数,让你求n个数之中的gcd最大为多少。。。。。。。
思路:统计每个数的因子个数就行了。。。注意1 1这个数据,输出为1;
下面附上代码:
#include<bits/stdc++.h>using namespace std;const int MAXN=100005;int a[MAXN],b[MAXN];bool cmp(int a,int b){return a>b;}int main(){int n;while(cin>>n){memset(b,0,sizeof(b));memset(a,0,sizeof(a));for(int i=0;i<n;i++){cin>>a[i];if(a[i]==1) {b[1]=1;continue;}for(int j=1;j<=sqrt(a[i]);j++){if(a[i]%j==0){if(j>1) b[j]++;if(j!=a[i]/j) b[a[i]/j]++;}}}//for(int i=1;i<=k;i++)//printf("%d ",b[i]);sort(b,b+MAXN,cmp);printf("%d\n",b[0]); } return 0;}
- HPU第七周周练 A
- HPU第七周周练 I
- 【第二周周练 H 】
- 【第二周周练 E 】
- HPU A
- 第七周周报
- 实验室第七周周工作总结
- 第七周周工作表
- 第七周周总结
- 第七周周总结
- 第七周周报
- 第七周周四总结
- 第七周周中总结
- 第七周周末总结
- 第七周周总结
- HPU第七次测试1002
- AYIT606第七周周赛(动态规划) A - How many ways
- hpu暑假训练A
- str .list.touple.dict 类的某些功能
- python scrapy框架爬取知乎动态页面
- win10下安装python、numpy、opencv2和tensorflow
- Python大牛之路所需技术和工具
- VS C工程【建立空工程】【打开VC6++工程:警告1 warning C4996: 'scanf': This function or variable may be】【C语言运行窗口复制粘贴编辑】
- HPU第七周周练 A
- Maven私服的搭建
- Nginx安装手册
- babyos2(1)——boot
- Matrix Factorization: A Simple Tutorial and Implementation in Python
- Linux安装ftp组件
- 关于父类静态方法能不能被子类重写详细
- ArrayList分析
- webpack:使用expose-loader 解决第三方库的插件依赖问题