GCD Reduce
来源:互联网 发布:长春玛雅软件培训 编辑:程序博客网 时间:2024/05/17 06:49
Description
You are given a sequence {A1, A2, ..., AN}. You task is to change all the element of the sequence to 1 with the following operations (you may need to apply it multiple times):
- choose two indexes i and j (1 ≤ i < j ≤ N);
- change both Ai and Aj to gcd(Ai, Aj), where gcd(Ai, Aj) is the greatest common divisor of Ai and Aj.
You do not need to minimize the number of used operations. However, you need to make sure that there are at most 5N operations.
Input
Input will consist of multiple test cases.
The first line of each case contains one integer N (1 ≤ N ≤ 105), indicating the length of the sequence. The second line contains Nintegers, A1, A2, ..., AN (1 ≤ Ai ≤ 109).
Output
For each test case, print a line containing the test case number (beginning with 1) followed by one integer M, indicating the number of operations needed. You must assure that M is no larger than 5N. If you cannot find a solution, make M equal to -1 and ignore the following output.
In the next M lines, each contains two integers i and j (1 ≤ i < j ≤ N), indicating an operation, separated by one space.
If there are multiple answers, you can print any of them.
Remember to print a blank line after each case. But extra spaces and blank lines are not allowed.
Sample Input
42 2 3 442 2 2 2
Sample Output
Case 1: 31 31 21 4Case 2: -1
题意:给出n个数,试着求出这n个数最后的最大公约数是否为1;若果为1,那么给出两两匹配的顺序(次数不能超出5*n);反之,输出-1;
我们先判断n个数的最大公约数是否为1.即一个数与其他所有数求公约数;看最后是否是1.若果为1那么最后输出的时候。输出两遍即可;输出的次数为2*n-2;输出格式不唯一;
标程:
# include <iostream># include <cstdio>using namespace std;const int maxn = 1e5 + 10;int a[maxn];int gcd(int a,int b){ if(b) return gcd(b,a%b); //如果b不为0; return a;}int main(){ int kase=0,n; while(~scanf("%d",&n)){ for(int i = 0; i < n;i++) scanf("%d",&a[i]); int temp = a[0]; for(int i = 1;i < n;i++) temp = gcd(temp,a[i]); //找出所有数的最大公约数; printf("Case %d: ",++kase); if(temp != 1){ puts("-1"); puts(""); } else{ printf("%d\n",2*n-2); for(int i=1;i<n;i++) printf("1 %d\n",i+1); for(int i=1;i<n;i++) printf("1 %d\n",i+1); puts(""); } } return 0;}
- GCD Reduce
- ZOJ 3846 GCD Reduce
- ZOJ3846 GCD Reduce 数论
- zoj 3846 GCD Reduce
- ZOJ :: GCD Reduce
- Zoj 3846-GCD Reduce(数论)
- ZOJ 3846GCD Reduce(数学)
- ZOJ 4846 GCD Reduce (数学分析题)
- zoj 3846 GCD Reduce(数论)
- ZOJ(3846)——GCD Reduce
- 【ZOJ】4846 GCD Reduce(求n个数的最大公约数)
- reduce
- reduce()
- reduce( )
- gcd
- GCD
- GCD
- GCD
- [leetcode oj 171] Excel Sheet Column Number
- linux mysql定时备份并压缩
- 计算安全和无条件安全
- 【机房重构】——报表实现
- vim配置
- GCD Reduce
- sizeof 简单分析
- 字符串移位包含的问题——解题笔记
- 人生的真相是什么???
- “分布式哈希”和“一致性哈希”
- 感悟
- 深入理解Linux网络技术内幕——设备的注册与初始化(二)
- LeetCode OJ 之 Scramble String
- Java:对象排序