九度OJ题目1442：A sequence of numbers

最新推荐文章于 2026-06-19 13:07:49 发布

原创最新推荐文章于 2026-06-19 13:07:49 发布 · 363 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

九度OJ

本文介绍了一种算法，用于解决已知序列前三项时如何快速计算第K项的问题，并提供了一个C++实现示例。该算法区分算术序列和几何序列进行处理，通过模运算确保结果范围。

题目1442：A sequence of numbers

时间限制：1 秒

内存限制：128 兆

特殊判题：否

题目描述：

Xinlv wrote some sequences on the paper a long time ago, they might be arithmetic or geometric sequences. The numbers are not very clear now, and only the first three numbers of each sequence are recognizable. Xinlv wants to know some numbers in these sequences, and he needs your help.

输入：

The first line contains an integer N, indicting that there are N sequences. Each of the following N lines contain four integers. The first three indicating the first three numbers of the sequence, and the last one is K, indicating that we want to know the K-th numbers of the sequence.

You can assume 0 < K <= 10^9, and the other three numbers are in the range [0, 2^63). All the numbers of the sequences are integers. And the sequences are non-decreasing.

输出：

Output one line for each test case, that is, the K-th number module (%) 200907.

样例输入：

2
1 2 3 5
1 2 4 5

样例输出：

5
16

#include <iostream> 
using namespace std;
long long pow(long long a,long long x);
 
int main(){
    int n,k;
    long long buf[10];
    long long answer;
    while (cin>>n){
        for (int time=0;time<n;time++){
            //initiate
            //input
            for (int i=0;i<3;i++)
                cin>>buf[i];
            cin>>k;
            if (buf[1]-buf[0]==buf[2]-buf[1])//arithmetic 
                answer=(buf[0]%200907+( (buf[1]-buf[0])%200907 )*( (k-1)%200907 ))%200907;
            else{//geometric 
                answer=(buf[0]%200907*(pow(buf[2]/buf[1],k-1)%200907))%200907;
            }
            cout<<answer<<endl;
        }
    }
    return true;
}
long long pow(long long a,long long x){
    long long pro=1;
    while(x>0){
        if (x%2==1){
            pro*=a;
            pro%=200907;
        }
        x/=2;
        a*=a;
        a%=200907;
    }
    return pro;
}
/**************************************************************
    Problem: 1442
    User: zpy
    Language: C++
    Result: Accepted
    Time:10 ms
    Memory:1520 kb
****************************************************************/

标签

#九度OJ #二分求幂