結果
問題 | No.793 うし数列 2 |
ユーザー |
|
提出日時 | 2019-02-22 21:39:07 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
CE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 1,045 bytes |
コンパイル時間 | 698 ms |
コンパイル使用メモリ | 75,388 KB |
最終ジャッジ日時 | 2024-11-14 21:15:25 |
合計ジャッジ時間 | 1,299 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp:16:39: error: '::numeric_limits' has not been declared 16 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208; | ^~~~~~~~~~~~~~ main.cpp:16:55: error: expected primary-expression before '>' token 16 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208; | ^ main.cpp:16:61: error: no matching function for call to 'max()' 16 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208; | ~~~~~^~ In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/string:50, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/locale_classes.h:40, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/ios_base.h:41, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ios:42, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ostream:38, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/iostream:39, from main.cpp:1: /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:254:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)' 254 | max(const _Tp& __a, const _Tp& __b) | ^~~ /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:254:5: note: template argument deduction/substitution failed: main.cpp:16:61: note: candidate expects 2 arguments, 0 provided 16 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208; | ~~~~~^~ /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:300:5: note: candidate: 'templat
ソースコード
#include <iostream>#include <algorithm>#include <iomanip>#include <map>#include <set>#include <queue>#include <stack>#include <numeric>#include <bitset>#include <assert.h>static const int MOD = 1000000007;using ll = int64_t;using namespace std;template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;template<typename T>T extgcd(T a, T b, T &x ,T &y){for (T u = y = 1, v = x = 0; a; ) {ll q = b/a;swap(x -= q*u, u);swap(y -= q*v, v);swap(b -= q*a, a);}return b;}template<typename T>T mod_inv(T x, T m){T s, t;extgcd(x, m, s, t);return (m+s)% m;}template <class T>T pow_ (T x, T n, T M){uint64_t u = 1, xx = x;while (n > 0){if (n&1) u = u * xx % M;xx = xx * xx % M;n >>= 1;}return static_cast<T>(u);};int main() {ll n;cin >> n;ll k = 1 + mod_inv(3, MOD);(k *= pow_((ll)10, n, (ll)MOD)) %= MOD;cout << (k + MOD - mod_inv(3, MOD)) % MOD << "\n";return 0;}