【CUGBACM15级BC第10场 B】hdu 5019 Revenge of GCD
来源:互联网 发布:三金冠淘宝店值多少钱 编辑:程序博客网 时间:2024/06/06 01:04
Revenge of GCD
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2797 Accepted Submission(s): 808
Total Submission(s): 2797 Accepted Submission(s): 808
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
题意:给你一组数a,b,k让你求出a,b两数中第k大的公约数(它两个的最大公约数是第一个,第二大的是第二个)
首先a,b的公约数是a,b共同因子的相乘,它的最大公约数是所有公共因子相乘,所以,a,b的所有公约数都会被其最大公约数整除,所以判断的时候只需要判断a,b最大公约数的因子即可:
#include <iostream>#include <set>#include <map>#include <stack>#include <cmath>#include <queue>#include <cstdio>#include <bitset>#include <string>#include <vector>#include <iomanip>#include <cstring>#include <algorithm>#include <functional>#define PI acos(-1)#define eps 1e-8#define inf 0x3f3f3f3f#define debug(x) cout<<"---"<<x<<"---"<<endltypedef long long LL;using namespace std;LL pp[1000010];int main(){ int t; cin >> t; while (t--) { LL x, y, k; cin >> x >> y >> k; LL g = __gcd(x, y), n = 0; for (LL i = 1; i <= sqrt(g); i++) { if (g % i == 0) { LL j = g / i; pp[n++] = i; if (j != i) { pp[n++] = j; } } } sort(pp, pp + n); if (k > n) { cout << "-1" << endl; } else { cout << g / pp[k - 1] << endl; } } return 0;}
阅读全文
0 0
- 【CUGBACM15级BC第10场 B】hdu 5019 Revenge of GCD
- 【CUGBACM15级BC第9场 B】hdu 4994 Revenge of Nim
- 【CUGBACM15级BC第10场 A】hdu 5018 Revenge of Fibonacci
- 【CUGBACM15级BC第16场 B】Revenge of LIS II
- 【CUGBACM15级BC第9场 A】hdu 4993 Revenge of ex-Euclid
- 【CUGBACM15级BC第15场 B】hdu 5082 Instruction
- 【CUGBACM15级BC第17场 B】hdu 5101 Select
- 【CUGBACM15级BC第20场 B】hdu 5124 lines
- 【CUGBACM15级BC第26场 B】hdu 5159 Card
- 【CUGBACM15级BC第28场 B】hdu 5167 Fibonacci
- 【CUGBACM15级BC第36场 B】hdu 5199 Gunner
- 【CUGBACM15级BC第16场 A】Revenge of Segment Tree
- 【CUGBACM15级BC第12场 B】hdu 5059 Help him
- 【CUGBACM15级BC第11场 B】hdu 5055 Bob and math problem
- 【CUGBACM15级BC第13场 B】hdu 5063 Operation the Sequence
- 【CUGBACM15级BC第18场 B】hdu 5105 Math Problem
- 【CUGBACM15级BC第22场 B】hdu 5143 NPY and arithmetic progression
- 【CUGBACM15级BC第23场 B】hdu 5147 Sequence II
- hdu6129
- Servlet Response对象输出验证码
- Hbuilder里关于Tab的几个骚操作(快捷)
- 换零钱---背包
- ubuntu上使用网络抓包工具Fiddler查看手机的数据请求
- 【CUGBACM15级BC第10场 B】hdu 5019 Revenge of GCD
- 难点汇总
- 13期9月博客自荐
- JDBC
- 复习java5
- php面试题之四——PHP面向对象(基础部分)
- linux工作中软件运行安装常见问题
- 简单的HTML标签学习
- WKWebView问题小结