BestCoder Round #38 1002——数学——Greatest Greatest Common Divisor
2015-04-19 20:42
337 查看
Problem Description
Pick two numbers ai,aj(i≠j) from a sequence to maximize the value of their greatest common divisor.
Input
Multiple test cases. In the first line there is an integer T, indicating the number of test cases. For each test cases, the first line contains an integer n, the size of the sequence. Next line contains n numbers, from a1 to an. 1≤T≤100,2≤n≤105,1≤ai≤105. The case for n≥104 is no more than 10.
Output
For each test case, output one line. The output format is Case #x: ans, x is the case number, starting from 1, ans is the maximum value of greatest common divisor.
Sample Input
Sample Output
大意:最大公约数得一种求法,以i为最大公约数,如果i*j存在的话说明这个数被i整除,只要看有多少个数符合这个条件那么i就是这个最大公约数
View Code
Pick two numbers ai,aj(i≠j) from a sequence to maximize the value of their greatest common divisor.
Input
Multiple test cases. In the first line there is an integer T, indicating the number of test cases. For each test cases, the first line contains an integer n, the size of the sequence. Next line contains n numbers, from a1 to an. 1≤T≤100,2≤n≤105,1≤ai≤105. The case for n≥104 is no more than 10.
Output
For each test case, output one line. The output format is Case #x: ans, x is the case number, starting from 1, ans is the maximum value of greatest common divisor.
Sample Input
2 4 1 2 3 4 3 3 6 9
Sample Output
Case #1: 2 Case #2: 3
大意:最大公约数得一种求法,以i为最大公约数,如果i*j存在的话说明这个数被i整除,只要看有多少个数符合这个条件那么i就是这个最大公约数
#include<cstdio> #include<cstring> #include<algorithm> using namespace std; const int MAX = 100010; int a[MAX]; int num[MAX]; int main() { int temp = 1; int n,T; scanf("%d",&T); while(T--){ int max1 = 0; memset(a,0,sizeof(a)); memset(num,0,sizeof(num)); scanf("%d",&n); for(int i = 1; i <= n ; i++) scanf("%d",&a[i]); for(int i = 1; i <= n ; i++) num[a[i]]++; for(int i = 1; i <= 100000; i++){ int tot = 0; for(int j = 1 ; i*j <= 100000;j++) tot += num[i*j]; if(tot >= 2) max1 = max(max1,i); } printf("Case #%d :%d\n",temp++,max1); } return 0; }
View Code
相关文章推荐
- hdu 5207 Greatest Greatest Common Divisor 数学
- BestCoder Round #38 1002.Greatest Greatest Common Divisor
- BestCoder Round 38-1002 Greatest Greatest Common Divisor
- hdu 5207 Greatest Greatest Common Divisor
- Algorithms - 最大公约数(greatest common divisor)-欧几里得(Euclid) 算法 及 代码
- GCD (Greatest Common Divisor)
- hdu 5207 Greatest Greatest Common Divisor(筛法求公约数)
- [计算最大公因子]Finding the greatest common divisor (gcd) of 2 numbers
- Greatest common divisor
- hdu 5207 Greatest Greatest Common Divisor
- Calculate the Greatest Commom Divisor (GCD) and Lowest Common Multiple (LCP) of Two Integers
- 最大公约数(Greatest Common Divisor ) 与 最小公倍数(Lowest Common Multiple )
- The Greatest Common Divisor
- hdu 5207 Greatest Greatest Common Divisor(数论)
- 最大公约数GCD(Greatest Common Divisor)算法小结
- HDU 5207 Greatest Greatest Common Divisor
- find the greatest common divisor
- HDOJ 5207 Greatest Greatest Common Divisor 暴力枚举
- Greatest Common Divisor(GCD) of Two Numbers
- getGreatestCommonDivisor