結果

問題 No.1127 変形パスカルの三角形
ユーザー tanimani364
提出日時 2020-08-14 02:12:14
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 12 ms / 1,500 ms
コード長 3,169 bytes
コンパイル時間 2,266 ms
コンパイル使用メモリ 197,060 KB
最終ジャッジ日時 2025-01-12 22:15:52
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;
template <class T>
inline bool chmin(T &a, T b)
{
    if (a > b)
    {
        a = b;
        return true;
    }
    return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
    if (a < b)
    {
        a = b;
        return true;
    }
    return false;
}
ll gcd(ll n, ll m)
{
    ll tmp;
    while (m != 0)
    {
        tmp = n % m;
        n = m;
        m = tmp;
    }
    return n;
}
ll lcm(ll n, ll m)
{
    return abs(n) / gcd(n, m) * abs(m); //gl=xy
}
using namespace std;
template<int mod>
struct Modint{
    int x;
    Modint():x(0){}
    Modint(int64_t y):x((y%mod+mod)%mod){}
    Modint &operator+=(const Modint &p){
            if((x+=p.x)>=mod)
                x -= mod;
            return *this;
        }
        Modint &operator-=(const Modint &p){
            if((x+=mod-p.x)>=mod)
                x -= mod;
            return *this;
        }
        Modint &operator*=(const Modint &p){
            x = (1LL * x * p.x) % mod;
            return *this;
        }
        Modint &operator/=(const Modint &p){
            *this *= p.inverse();
            return *this;
        }
        Modint operator-() const { return Modint(-x); }
        Modint operator+(const Modint &p) const{
            return Modint(*this) += p;
        }
        Modint operator-(const Modint &p) const{
            return Modint(*this) -= p;
        }
        Modint operator*(const Modint &p) const{
            return Modint(*this) *= p;
        }
        Modint operator/(const Modint &p) const{
            return Modint(*this) /= p;
        }
        bool operator==(const Modint &p) const { return x == p.x; }
        bool operator!=(const Modint &p) const{return x != p.x;}
        Modint inverse() const{//非再帰拡張ユークリッド
            int a = x, b = mod, u = 1, v = 0;
            while(b>0){
                int t = a / b;
                swap(a -= t * b, b);
                swap(u -= t * v, v);
            }
            return Modint(u);
        }
        Modint pow(int64_t n) const{//繰り返し二乗法
            Modint ret(1), mul(x);
            while(n>0){
                if(n&1)
                    ret *= mul;
                mul *= mul;
                n >>= 1;
            }
            return ret;
        }
        friend ostream &operator<<(ostream &os,const Modint &p){
            return os << p.x;
        }
};
using modint = Modint<mod>;
template<typename T>
struct Combination{
  //Modint用
  //構築O(N),クエリO(1)
    vector<T>fact,rfact;
    Combination(int n):fact(n+1),rfact(n+1){
        fact[0]=1;fact[1]=1;
        rfact[n]=1;
        for(int i=2;i<=n;++i){
            fact[i]=fact[i-1]*i;
        }
        rfact[n]/=fact[n];
        for(int i=n-1;i>=0;--i){
            rfact[i]=rfact[i+1]*(i+1);
        }
    }
    T C(int n,int r) const{
        if(r<0 || n<r)return 0;
        return fact[n]*rfact[n-r]*rfact[r];
    }
};
void solve()
{
    ll a,b,n,k;
    cin>>a>>b>>n>>k;
    modint ans=0,res=0;
    Combination<modint>c(3e5);
    ans=c.C(n-1,k-1)*a+c.C(n-1,k-2)*b;
    cout<<ans<<"\n";
    for(int i=1;i<=1+n+1;++i){
        modint x=c.C(n-1,i-1)*a+c.C(n-1,i-2)*b;
        res+=x.pow(2);
    }
    cout<<res<<"\n";
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);
    solve();
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0