結果

問題 No.1275 綺麗な式
コンテスト
ユーザー sapphire__15
提出日時 2020-10-30 22:03:53
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 6,832 bytes
コンパイル時間 1,196 ms
コンパイル使用メモリ 112,144 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-07-22 00:40:07
合計ジャッジ時間 3,005 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 60
権限があれば一括ダウンロードができます

ソースコード

diff # 

// #include "pch.h"
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <string>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <ctime>
#include <cassert>
#include <fstream>
#include <stack>
#include <random>

typedef long long ll;
typedef std::pair<int, int> Pii;
typedef std::pair<long long, long long> Pll;
typedef std::pair<double, double> Pdd;

#define rip(i, n, ss) for (int i = (ss);i < (int)( n ); i++)
#define all(a) a.begin(), a.end()
#define MM << " " <<

template<typename T>
using MaxHeap = std::priority_queue<T>;
template<typename T>
using MinHeap = std::priority_queue<T, std::vector<T>, std::greater<T>>;

template<typename T>
inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template<typename T>
inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

# ifndef ONLINE_JUDGE
template<typename T>
void vdeb(std::vector<T> &bb) {
    for (int i = 0;i < bb.size();i++) {
        if (i == bb.size() - 1) std::cout << bb[i];
        else std::cout << bb[i] << ' ';
    }
    std::cout << '\n';
}
template<typename T>
void vdeb(std::vector<std::vector<T>> &bb) {
    for (int i = 0;i < bb.size();i++) {
        std::cout << i << ' ';
        vdeb(bb[i]);
    }
    std::cout << '\n';
}
# endif

long long pow(long long n, long long p, long long k) {//n^k(mod p)
    if (!k) return 1;
    long long a = pow(n,p, k>>1);
    a = a * a%p;
    if (k & 1) a = a * n%p;
    return a;
}
void euclid(long long &a, long long &b, long long p) { // a>=b A*b+B*(a-a/b*b)=1
    if (a == 1) {
        a = 1;
    }
    else {
        long long A = b, B = a % b;
        euclid(A, B, p);
        b = (A - (p + a / b) % p * B % p + p) % p;
        a = B;
    }
}
long long rev(long long n, long long p) {// n*x-p*y=1
    //long long q = p;
    //euclid(p, n, p);
    //return n % q;
    return pow(n,p,p-2);
}
long long bino(long long n, long long m, long long p) {//nCm(mod p)
    long long ans = 1, div = 1;
    for(int i = 0;i < m; i++){
        ans = (n - i) * ans % p;
        div = div * (i +1) % p;
    }
    return ans * rev(div, p) % p;
}
struct modint {
    long long num;
    long long p;
    modint() {
        num = 0;
        p = 1000000007;
    }
    modint(long long x) {
        p = 1000000007;
        num = x % p;
        if(num < 0) num += p;
    }
    modint inv()const{return rev(num, p);}
    modint operator-() const{return modint(p-num);}
    modint& operator+=(const modint &other){
        num = (num + other.num) % p;
        return *this;
    }
    modint& operator-=(const modint &other){
        num = (num - other.num + p) % p;
        return *this;
    }
    modint& operator*=(const modint &other){
        num = (num * other.num) % p;
        return *this;
    }
    modint& operator/=(const modint &other){
        (*this) *= other.inv();
        return *this;
    }
    modint& operator+=(const long long &other){
        num = (num + other) % p;
        return *this;
    }
    modint& operator-=(const long long &other){
        num = (num - other + p) % p;
        return *this;
    }
    modint& operator*=(const long long &other){
        num = (num * other) % p;
        return *this;
    }
    modint& operator/=(const long long &other){
        (*this) *= rev(other, p);
        return *this;
    }
    modint& operator++(){return *this += 1;}
    modint& operator--(){return *this -= 1;}
    modint& operator=(const long long &other){return (*this) = modint(other);}
    modint operator+(const modint &other) const{return modint(*this) += other;}
    modint operator-(const modint &other) const{return modint(*this) -= other;}
    modint operator*(const modint &other) const{return modint(*this) *= other;}
    modint operator/(const modint &other) const{return modint(*this) /= other;}
    modint operator+(const long long &other) const{return modint(*this) += other;}
    modint operator-(const long long &other) const{return modint(*this) -= other;}
    modint operator*(const long long &other) const{return modint(*this) *= other;}
    modint operator/(const long long &other) const{return modint(*this) /= other;}
    bool operator==(const modint &other) const{return num == other.num;}
};
std::istream& operator>>(std::istream &is, const modint x) {
    std::cin >> x.num;
    return is;
}
std::ostream& operator<<(std::ostream &os, const modint &x){
    std::cout << x.num;
    return os;
}

using namespace std;
#include <vector>
using namespace std;

template<typename T>
struct matrix{
    int size;
    vector<vector<T> > table;
    matrix(int n){
        size=n;
        table=vector<vector<T> >(n,vector<T>(n));
    }
    matrix<T> operator*(const matrix<T> &othor){
        matrix<T> ret(size);
        for(int i=0;i<size;i++){
            for(int j=0;j<size;j++){
                for(int k=0;k<size;k++){
                    ret.table[i][j]+=table[i][k]*othor.table[k][j];
                }
            }
        }
        return ret;
    }
    matrix<T> operator+(const matrix<T> &other){
        matrix<T> ret(size);
        for(int i=0;i<size;i++){
            for(int j=0;j<size;j++){
                ret[i][j] = table[i][j] + other.table[i][j];
            }
        }
        return ret;
    }
    
    matrix<T> operator-(const matrix<T> &other){
        matrix<T> ret(size);
        for(int i=0;i<size;i++){
            for(int j=0;j<size;j++){
                ret[i][j] = table[i][j] - other.table[i][j];
            }
        }
        return ret;
    }
    T trace(T num){
        T ret = num;
        for(int i=0;i<size;i++){
            ret += table[i][i];
        }
        return ret;
    }
    T all_sum(){
        T ret = table[0][0];
        for(int i=1;i<size;i++){
            ret+=table[0][i];
        }
        for(int i=1;i<size;i++){
            for(int j=0;j<size;j++){
                ret+=table[i][j];
            }
        }
        return ret;
    }
};

template<typename T>
void power(T x, ll n, T &ret) {
    while(n) {
        if(n&1) ret =ret *  x;
        x = x*x;
        n >>= 1;
    }
}

int main() {
    ll a, b, n; cin >> a >> b >> n;
    if(n  > 1) {
        matrix<modint> da(2), ret(2);
        da.table[0][0] = modint(2*a);
        da.table[0][1] = modint(b-a*a);
        da.table[1][0] = modint(1);
        da.table[1][1] = modint(0);
        ret.table[0][0] = modint(1);
        ret.table[0][1] = modint(0);
        ret.table[1][0] = modint(0);
        ret.table[1][1] = modint(1);
        power(da, n, ret);
        cout << ret.table[1][0] * 2 * a + ret.table[1][1]*2 << '\n';
    }
    else if(n == 0) {
        cout << 2 << '\n';
    }
    else {
        cout << 2*a%1000000007 << endl;
    }
}
0