2021牛客寒假算法基础集训营1_A_串——递推

题目

https://ac.nowcoder.com/acm/contest/9981/A

分析

代码

#include<bits/stdc++.h>
using namespace std;
#define MAX_N 1000009
const long long mod = 1e9+7;
long long dpu[MAX_N], dps[MAX_N], m26[MAX_N], cnt = 0;
int main(){
    int n;
    m26[0] = 1, dps[0] = 0, dpu[1] = 0;
    scanf("%d", &n);
    for(int i = 1; i <= n; i++) m26[i] = (m26[i-1]*26)%mod;
    for(int i = 1; i <= n; i++) dps[i] = (25*dps[i-1] + m26[i-1])%mod;
    for(int i = 1; i <= n; i++) dpu[i] = (25*dpu[i-1] + dps[i-1])%mod;
    for(int i = 1; i <= n; i++) cnt = (cnt+dpu[i])%mod;
    printf("%lld\n",  cnt);
    return 0;
}