結果
問題 | No.793 うし数列 2 |
ユーザー |
👑 |
提出日時 | 2022-08-18 17:23:35 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 2,155 bytes |
コンパイル時間 | 808 ms |
コンパイル使用メモリ | 68,428 KB |
最終ジャッジ日時 | 2025-01-30 23:52:51 |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 21 |
ソースコード
#include <iostream>using namespace std;const long long MOD = 1000000007;template <int mod>struct ModInt{int n;ModInt():n(0){}ModInt(int n_):n(n_ >= 0 ? n_%mod : mod - ((-n_)%mod) ){}ModInt &operator+=(const ModInt &p){if((n+=p.n) >= mod)n-=mod;return *this;}ModInt &operator-=(const ModInt &p){n+=mod-p.n;if(n >= mod)n-=mod;return *this;}ModInt &operator*=(const ModInt &p){n = (int) ((1LL*n*p.n)%mod);return *this;}ModInt &operator/=(const ModInt &p){*this *= p.inverse();return *this;}ModInt operator-() const {return ModInt(-n);}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 n==p.n;}bool operator<(const ModInt &p) const {return n<p.n;}bool operator>(const ModInt &p) const {return n>p.n;}bool operator>=(const ModInt &p) const {return n>=p.n;}bool operator<=(const ModInt &p) const {return n<=p.n;}bool operator!=(const ModInt &p) const {return n!=p.n;}ModInt inverse() const {int a = n,b = mod,u = 1,v = 0;while(b){int t = a/b;a -= t*b; swap(a,b);u -= t*v; swap(u,v);}return ModInt(u);}ModInt pow(int64_t z) const {ModInt ret(1),mul(n);while(z > 0){if(z & 1) ret *= mul;mul *= mul;z >>= 1;}return ret;}friend ostream &operator<<(ostream &os, const ModInt &p){return os << p.n;}friend istream &operator>>(istream &is, ModInt &a){int64_t t;is >> t;a = ModInt<mod> (t);return (is);}};using mint = ModInt<MOD>;template <typename T>T uPow(T z,T n, T mod){T ans = 1;while(n != 0){if(n%2){ans*=z;if(mod)ans%=mod;}n >>= 1;z*=z;if(mod)z%=mod;}return ans;}int main(){long long n;cin>>n;mint x = (((mint)uPow(10LL,n,MOD)*(mint)4)-(mint)1)/(mint)3;cout << x << endl;}