Codeforces892C Pride


You have an array a with length n, you can perform operations. Each operation is like this: choose two adjacent elements from a, say x and y, and replace one of them with gcd(x, y), where gcd denotes the greatest common divisor.

What is the minimum number of operations you need to make all of the elements equal to 1?


The first line of the input contains one integer n (1 ≤ n ≤ 2000) — the number of elements in the array.

The second line contains n space separated integers a1, a2, ..., an (1 ≤ ai ≤ 109) — the elements of the array.


Print -1, if it is impossible to turn all numbers to 1. Otherwise, print the minimum number of operations needed to make all numbers equal to 1.

2 2 3 4 6
2 4 6 8
2 6 9

In the first sample you can turn all numbers to 1 using the following 5 moves:

  • [2, 2, 3, 4, 6].
  • [2, 1, 3, 4, 6]
  • [2, 1, 3, 1, 6]
  • [2, 1, 1, 1, 6]
  • [1, 1, 1, 1, 6]
  • [1, 1, 1, 1, 1]

We can prove that in this case it is not possible to make all numbers one using less than 5 moves.

题意:一个数列, 相邻两个数求gcd, 然后用gcd代替其中一个数, 问操作几次可使得所有数都变为1, 若不能输出-1;

#include <iostream>
#include <algorithm>
using namespace std;
long long gcd(long long a, long long b){
	return b==0?a:gcd(b, a%b);
long long g[2005][2004];
const long long maxn=1e9+5;
int main(){
	int n, num=0;
	cin >> n;
	for(int i=1; i<=n; i++){
		cin >> g[0][i];
		if(g[0][i]==1) num++;
		cout << n-num << endl;
		return 0;
	int ans=maxn;
	for(int i=1; i<=n; i++){
		for(int j=1; j<n-i+1; j++){
			g[i][j]=gcd(g[i-1][j], g[i-1][j+1]);
				ans=min(ans, i);
	if(ans==maxn) cout << -1 <<endl;
	else cout << n+ans-1 << endl;	
	return 0;

Monkeys' Pride


DescriptionnnBackground nThere are a lot of monkeys in a mountain. Every one wants to be the monkey king. They keep arguing with each other about that for many years. It is your task to help them solve this problem. nnProblem nMonkeys live in different places of the mountain. Let a point (x, y) in the X-Y plane denote the location where a monkey lives. There are no two monkeys living at the same point. If a monkey lives at the point (x0, y0), he can be the king only if there is no monkey living at such point (x, y) that x>=x0 and y>=y0. For example, there are three monkeys in the mountain: (2, 1), (1, 2), (3, 3). Only the monkey that lives at the point (3,3) can be the king. In most cases, there are a lot of possible kings. Your task is to find out all of them. nInputnnThe input consists of several test cases. In the first line of each test case, there are one positive integers N (1<=N<=50000), indicating the number of monkeys in the mountain. Then there are N pairs of integers in the following N lines indicating the locations of N monkeys, one pair per line. Two integers are separated by one blank. In a point (x, y), the values of x and y both lie in the range of signed 32-bit integer. The test case starting with one zero is the final test case and has no output.nOutputnnFor each test case, print your answer, the total number of the monkeys that can be possible the king, in one line without any redundant spaces.nSample Inputnn3n2 1n1 2n3 3n3n0 1n1 0n0 0n4n0 0n1 0n0 1n1 1n0nSample Outputnn1n2n1


  • 广告
  • 抄袭
  • 版权
  • 政治
  • 色情
  • 无意义
  • 其他