結果

問題 No.557 点対称
ユーザー はまやんはまやん
提出日時 2017-08-13 09:29:37
言語 C++14
(gcc 7.2.0)
結果
AC  
実行時間 4 ms
コード長 2977 Byte
コンパイル時間 1880 ms
使用メモリ 1516 KB

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
Gen_case1.txt AC 3 ms
1516 KB
Gen_case2.txt AC 3 ms
1512 KB
Gen_case3.txt AC 4 ms
1512 KB
Gen_case4.txt AC 3 ms
1508 KB
Gen_case5.txt AC 3 ms
1516 KB
Gen_case6.txt AC 3 ms
1516 KB
Gen_case7.txt AC 3 ms
1512 KB
Gen_case8.txt AC 3 ms
1512 KB
Gen_case9.txt AC 3 ms
1508 KB
Gen_case10.txt AC 3 ms
1508 KB
Gen_case11.txt AC 3 ms
1512 KB
Gen_case12.txt AC 3 ms
1508 KB
Gen_case13.txt AC 3 ms
1512 KB
Gen_case14.txt AC 4 ms
1512 KB
Gen_case15.txt AC 4 ms
1512 KB
Gen_case16.txt AC 4 ms
1512 KB
Gen_case17.txt AC 3 ms
1516 KB
Gen_case18.txt AC 3 ms
1516 KB
Gen_case19.txt AC 3 ms
1508 KB
Gen_case20.txt AC 3 ms
1512 KB
Gen_case21.txt AC 3 ms
1516 KB
Gen_case22.txt AC 3 ms
1512 KB
Gen_case23.txt AC 3 ms
1512 KB
Maximam_1_.txt AC 4 ms
1512 KB
Maximum_2_.txt AC 4 ms
1512 KB
Sample_01.txt AC 3 ms
1500 KB
Sample_02.txt AC 3 ms
1512 KB
Sample_03.txt AC 3 ms
1512 KB
Sample_04.txt AC 3 ms
1512 KB
Sample_05.txt AC 4 ms
1496 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