HDOJ 5019 Revenge of GCD
来源:互联网 发布:网络卖淫产业链 编辑:程序博客网 时间:2024/06/12 23:21
第k大GCD = GCD/第K大因子
Revenge of GCD
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 877 Accepted Submission(s): 259
Problem Description
In mathematics, the greatest common divisor (gcd), also known as the greatest common factor (gcf), highest common factor (hcf), or greatest common measure (gcm), of two or more integers (when at least one of them is not zero), is the largest positive integer that divides the numbers without a remainder.
---Wikipedia
Today, GCD takes revenge on you. You have to figure out the k-th GCD of X and Y.
---Wikipedia
Today, GCD takes revenge on you. You have to figure out the k-th GCD of X and Y.
Input
The first line contains a single integer T, indicating the number of test cases.
Each test case only contains three integers X, Y and K.
[Technical Specification]
1. 1 <= T <= 100
2. 1 <= X, Y, K <= 1 000 000 000 000
Each test case only contains three integers X, Y and K.
[Technical Specification]
1. 1 <= T <= 100
2. 1 <= X, Y, K <= 1 000 000 000 000
Output
For each test case, output the k-th GCD of X and Y. If no such integer exists, output -1.
Sample Input
32 3 12 3 28 16 3
Sample Output
1-12
Source
BestCoder Round #10
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <cmath>using namespace std;typedef long long int LL;LL gcd(LL a,LL b){ if(b==0) return a; return gcd(b,a%b);}LL factor[1000100],n;int main(){ int T_T; scanf("%d",&T_T); while(T_T--) { LL x,y,k; cin>>x>>y>>k; LL g=gcd(x,y); LL d=sqrt(g); n=0; for(LL i=1;i<=d;i++) { if(g%i==0) { LL j=g/i; factor[n++]=i; if(j!=i) factor[n++]=j; } } sort(factor,factor+n); if(k>n) puts("-1"); else { cout<<g/factor[k-1]<<endl; } } return 0;}
1 3
- HDOJ 5019 Revenge of GCD
- HDOJ 5019 Revenge of GCD
- hdoj-5019-Revenge of GCD
- 【BestCoder】 HDOJ 5019 Revenge of GCD
- HDOJ-5019-Revenge of GCD 解题报告
- hdu 5019 Revenge of GCD
- hdu 5019 Revenge of GCD
- HDU 5019 - Revenge of GCD
- hdu 5019 Revenge of GCD
- HDU 5019Revenge of GCD
- HDU 5019 Revenge of GCD
- HDU 5019 Revenge of GCD
- HDU 5019 Revenge of GCD (暴力)
- HDU 5019 Revenge of GCD(数学)
- HDU-#5019 Revenge of GCD(枚举)
- HDU——5019 Revenge of GCD
- HDU ACM 5019 Revenge of GCD
- hdu 5018 Revenge of GCD
- hdu 1598 find the most comfortable road
- android scroller类的使用
- 分布式计算(一)基本范型
- 第01课 OpenGL窗口(3)
- 2015年网易校招Java开发工程师(技术架构)在线笔试题(2015年9月20日 18:00—20:00)
- HDOJ 5019 Revenge of GCD
- Apk调试过程细节
- 【面试】经典面试题,你会做几道(持续更新)
- HDU 1839 Delay Constrained Maximum Capacity Path
- HDOJ 5038 Grade
- 唯品会2015校园招聘技术岗附加题解答
- Java垃圾收集器与内存分配策略
- Codeforces Round #268 (Div. 2)
- execv使用