2018南京Gym - 101981G - Pyramid

https://codeforces.com/gym/101981/attachments

分析:打表找规律。结论:ans=n*(n+1)*(n+2)*(n+3)/24。

#include "bits/stdc++.h"

using namespace std;
const long long mod = 1e9 + 7;

long long qk(long long a, long long b) {
    long long ans = 1;
    while (b) {
        if (b & 1)ans = ans * a % mod;
        b >>= 1;
        a = a * a % mod;
    }
    return ans;
}

int main() {
    long long n, t;
    cin >> t;
    long long inv24 = qk(24, mod - 2);
    while (t--) {
        scanf("%lld",&n);
        printf("%lld\n", n * (n + 1) % mod * (n + 2) % mod * (n + 3) % mod * inv24 % mod);
    }
}

猜你喜欢

转载自blog.csdn.net/qq_42671946/article/details/90140098
今日推荐