結果

問題 No.557 点対称
ユーザー はまやんはまやん
提出日時 2017-08-13 09:29:37
言語 C++14
(gcc 9.3.0)
結果
AC  
実行時間 6 ms / 2,000 ms
コード長 2,977 Byte
コンパイル時間 1,382 ms
使用メモリ 8,948 KB
最終ジャッジ日時 2020-05-28 20:40:12

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 2 ms
6,896 KB
testcase_01 AC 2 ms
8,940 KB
testcase_02 AC 3 ms
8,940 KB
testcase_03 AC 2 ms
6,896 KB
testcase_04 AC 2 ms
8,944 KB
testcase_05 AC 3 ms
6,896 KB
testcase_06 AC 3 ms
6,900 KB
testcase_07 AC 2 ms
8,944 KB
testcase_08 AC 2 ms
6,900 KB
testcase_09 AC 2 ms
8,944 KB
testcase_10 AC 3 ms
6,896 KB
testcase_11 AC 3 ms
6,904 KB
testcase_12 AC 6 ms
8,944 KB
testcase_13 AC 2 ms
6,900 KB
testcase_14 AC 2 ms
8,940 KB
testcase_15 AC 2 ms
8,896 KB
testcase_16 AC 2 ms
8,940 KB
testcase_17 AC 2 ms
6,896 KB
testcase_18 AC 2 ms
8,896 KB
testcase_19 AC 2 ms
6,904 KB
testcase_20 AC 2 ms
6,896 KB
testcase_21 AC 2 ms
6,900 KB
testcase_22 AC 2 ms
8,948 KB
testcase_23 AC 2 ms
8,940 KB
testcase_24 AC 3 ms
6,896 KB
testcase_25 AC 3 ms
8,944 KB
testcase_26 AC 2 ms
6,900 KB
testcase_27 AC 3 ms
8,900 KB
testcase_28 AC 3 ms
6,900 KB
testcase_29 AC 2 ms
8,900 KB
権限があれば一括ダウンロードができます

ソースコード

diff #
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
//---------------------------------------------------------------------------------------------------
template<int MOD> struct ModInt {
    static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
    ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return ModInt(u); }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
typedef ModInt<1000000007> mint;
/*---------------------------------------------------------------------------------------------------
            ∧_∧  
      ∧_∧  (´<_` )  Welcome to My Coding Space!
     ( ´_ゝ`) /  ⌒i     
    /   \     | |     
    /   / ̄ ̄ ̄ ̄/  |  
  __(__ニつ/     _/ .| .|____  
     \/____/ (u ⊃  
---------------------------------------------------------------------------------------------------*/



typedef long long ll;
ll N;
//---------------------------------------------------------------------------------------------------
void _main() {
    cin >> N;

    if (N == 1) {
        printf("2\n");
        return;
    }

    mint ans = 4;
    N -= 2;
    if (N % 2 == 1) {
        ans *= 3;
        ans *= mint(5) ^ ((N - 1) / 2);
    } else ans *= mint(5) ^ (N / 2);

    

    cout << ans << endl;
}
0