SRM 387 DIV2 [250]

TopCoder SRM 专栏收录该内容
11 篇文章 0 订阅
#include < iostream >
#include
< vector >
using   namespace  std;

class  GuessingNextElement
{
public:
    
int guess(vector<int> A)
    
{
        
if (A[1]-A[0]==A[2]-A[1]){
            
return A[A.size()-1]+A[1]-A[0];
        }

        
else
            
return A[A.size()-1]*(A[1]/A[0]);
    }

}
;

Problem Statement

    

An integer arithmetic progression is a sequence defined by two positive integers, p and q, where p is the first element in the sequence, and all other elements are obtained by adding q to the previous element. For example, if p = 1 and q = 2, the sequence would be: 1, 3, 5, 7, ...

An integer geometric progression is a sequence defined by two positive integers, p and q, where p is the first element in the sequence, and all other elements are obtained by multiplying the previous element by q. For example, if p = 3 and q = 2, the sequence would be: 3, 6, 12, ...

You are given a vector <int> A, which contains either an integer arithmetic or geometric progression. Determine which one it is and return the next element in the sequence. It is guaranteed that A will uniquely represent either an arithmetic or geometric progression and that result will fit in a 32-bit signed integer.

Definition

    
Class: GuessingNextElement
Method: guess
Parameters: vector <int>
Returns: int
Method signature: int guess(vector <int> A)
(be sure your method is public)
    
 

Constraints

- A will contain between 3 and 50 elements, inclusive.
- Each element of A will be between 1 and 10^6, inclusive.
- A will be sorted in ascending order.
- A will uniquely represent either an arithmetic or geometric progression.

Examples

0)  
    
{364,843,1322,1801}
Returns: 2280
This sequence represents an arithmetic progression where p = 364 and q = 479. The next element is 1801 + 479 = 2280.
1)  
    
{394,1172,1950,2728,3506,4284,5062,5840}
Returns: 6618
 
2)  
    
{13,117,1053,9477,85293}
Returns: 767637
This sequence represents a geometric progression where p = 13 and q = 9. The next element is 85293 * 9 = 76737.
3)  
    
{22,220,2200,22000}
Returns: 220000
 
4)  
    
{250000, 500000, 1000000}
Returns: 2000000
 

This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2003, TopCoder, Inc. All rights reserved.

  • 0
    点赞
  • 0
    评论
  • 0
    收藏
  • 一键三连
    一键三连
  • 扫一扫,分享海报

©️2021 CSDN 皮肤主题: 大白 设计师:CSDN官方博客 返回首页
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、C币套餐、付费专栏及课程。

余额充值