A sequence of numbers

博客围绕求解序列第K个数并取模的问题展开。输入包含序列数量N,后续每行有四个整数,前三个是序列前三项,最后一个是K。输出为每个序列第K个数对200907取模的结果,同时提醒运算过程中要取模,否则会出错。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Problem Description
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.

Input
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
Output one line for each test case, that is, the K-th number module (%) 200907.

Sample Input
2
1 2 3 5
1 2 4 5

Sample Output
5
16

注意点
计算res *= a;a*=a后(运算过程中),都要记得模m,否则会WA

代码

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>

using namespace std;

#define m 200907

long long cal(long long a, long long b){
    //二分求幂 a^b
    long long res = 1;

    //31
    while(b){

        //该位为1
        if(b%2 == 1){
            res *= a;    //* 2 * (2^2) * (2^4) * (2^8) * (2^16) = 2^(1+2+4+8+16) = 2^31
            res %= m;
        }
        a *= a;          //2^2 2^4 2^8 2^16 2^32
        a %= m;
        b /= 2;          //15 7 3 1 0
    }
    return res;

}

int main(){
    int N;
    cin >> N;

    long long a,b,c,k;
    long long ans;

    for(int i=0;i<N;i++){
        cin >> a >> b >> c >> k;
        if(b-a == c-b){
            //等差数列
            ans = (a + (k-1) * (b-a))% m;
        }
        else{
            //等比数列
            //q0 * q ^ (k-1)
            //q0 = a, q = b/a
            ans = (a * cal(b/a,k-1)) % m;
        }
        cout << ans << endl;
    }
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值