Codeforces 328A-IQ Test(数列)

最新推荐文章于 2022-03-27 22:58:09 发布

aofan9566

最新推荐文章于 2022-03-27 22:58:09 发布

阅读量111

点赞数

原文链接：http://www.cnblogs.com/lcchuguo/p/4050236.html

版权

Petya is preparing for IQ test and he has noticed that there many problems like: you are given a sequence, find the next number. Now Petya can solve only problems with arithmetic or geometric progressions.

Arithmetic progression is a sequence a1, a1 + d, a1 + 2d, ..., a1 + (n - 1)d, where a1 and d are any numbers.

Geometric progression is a sequence b1, b2 = b1q, ..., bn = bn - 1q, where b1 ≠ 0, q ≠ 0, q ≠ 1.

Help Petya and write a program to determine if the given sequence is arithmetic or geometric. Also it should found the next number. If the sequence is neither arithmetic nor geometric, print 42 (he thinks it is impossible to find better answer). You should also print 42 if the next element of progression is not integer. So answer is always integer.

Input

The first line contains exactly four integer numbers between 1 and 1000, inclusively.

Output

Print the required number. If the given sequence is arithmetic progression, print the next progression element. Similarly, if the given sequence is geometric progression, print the next progression element.

Print 42 if the given sequence is not an arithmetic or geometric progression.

     Sample test(s) 
   

       input 
     
836 624 412 200

       output 
     
-12

       input 
     
1 334 667 1000

       output 
     
1333题意： 给4个数，推断是否为等差或等比数列（等比数列的定义与高中同样可是公比不能为1，公比为1事实上就是等差数列了。。）假设是等比或等差数列，输入其下一项，否则输入“42”。假设下一项不是整数也输出“42”#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <cctype>
#include <cstdlib>
#include <set>
#include <map>
#include <vector>
#include <string>
#include <queue>
#include <stack>
#include <cmath>
using namespace std;
const int INF=0x3f3f3f3f;
#define LL long long
double a[5];
double is_dc()
{
	for(int i=1;i<3;i++)
		if(a[i]-a[i-1]!=a[i+1]-a[i])
		return INF;
	return a[1]-a[0];
}
double is_db()
{
	for(int i=1;i<3;i++)
		if(a[i]/a[i-1]!=a[i+1]/a[i])
		return INF;
	return a[1]/a[0];
}
int main()
{
	while(scanf("%lf%lf%lf%lf",a,a+1,a+2,a+3)!=EOF)
	{
		if(is_dc()!=INF)
		{
			printf("%.0lf\n",a[3]+is_dc());
		}
		else if(is_db()!=INF)
		{
			double t=is_db()*a[3];
			if(t-floor(t)==0)
			{
				printf("%.0lf\n",t);
			}
			else
				puts("42");
		}
		else
			puts("42");
	}
	return 0;
}