結果

問題 No.557 点対称
ユーザー claw88
提出日時 2017-08-12 00:06:45
言語 C#
(csc 3.4.0-beta4-19569-03)
結果
AC  
実行時間 31 ms
コード長 2,329 Byte
コンパイル時間 938 ms
使用メモリ 10,540 KB
最終ジャッジ日時 2019-12-29 01:32:53

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
Gen_case1.txt AC 30 ms
10,512 KB
Gen_case2.txt AC 30 ms
10,532 KB
Gen_case3.txt AC 30 ms
10,528 KB
Gen_case4.txt AC 30 ms
10,524 KB
Gen_case5.txt AC 30 ms
10,520 KB
Gen_case6.txt AC 29 ms
10,520 KB
Gen_case7.txt AC 30 ms
10,528 KB
Gen_case8.txt AC 31 ms
10,524 KB
Gen_case9.txt AC 29 ms
10,532 KB
Gen_case10.txt AC 29 ms
10,520 KB
Gen_case11.txt AC 29 ms
10,524 KB
Gen_case12.txt AC 30 ms
10,524 KB
Gen_case13.txt AC 29 ms
10,532 KB
Gen_case14.txt AC 29 ms
10,520 KB
Gen_case15.txt AC 29 ms
10,520 KB
Gen_case16.txt AC 30 ms
10,516 KB
Gen_case17.txt AC 29 ms
10,520 KB
Gen_case18.txt AC 29 ms
10,528 KB
Gen_case19.txt AC 30 ms
10,516 KB
Gen_case20.txt AC 30 ms
10,524 KB
Gen_case21.txt AC 29 ms
10,516 KB
Gen_case22.txt AC 30 ms
10,520 KB
Gen_case23.txt AC 30 ms
10,520 KB
Maximam_1_.txt AC 29 ms
10,536 KB
Maximum_2_.txt AC 30 ms
10,540 KB
Sample_01.txt AC 29 ms
10,532 KB
Sample_02.txt AC 29 ms
10,524 KB
Sample_03.txt AC 30 ms
10,524 KB
Sample_04.txt AC 30 ms
10,524 KB
Sample_05.txt AC 29 ms
10,520 KB
テストケース一括ダウンロード
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.3.1-beta4-19462-11 (66a912c9)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff #
using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Globalization;
using System.Diagnostics;
using static System.Console;
using Pair = System.Collections.Generic.KeyValuePair<int, int>;
//using System.Numerics;

class Program
{
    static void Main()
    {
        //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    Scanner cin = new Scanner();
    Random rnd = new Random();
    Stopwatch sw = new Stopwatch();
    readonly int[] dd = { 0, 1, 0, -1, 0 };
    readonly int mod = 1000000007;
    readonly string alfa = "abcdefghijklmnopqrstuvwxyz";
    readonly string ALFA = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";

    long N;
    void solve()
    {
        N = cin.nextlong;
        if(N == 1)
        {
            WriteLine(2);
            return;
        }
        long ans = 1;
        if (N % 2 == 1) ans *= 3;
        ans *= 4;
        ans *= Powmod(5, N / 2 - 1, mod);
        ans += mod;
        ans %= mod;
        WriteLine(ans);
    }
    //a^b(mod p) solution works in O(logb).
    long Powmod(long a, long b, long p)
    {
        if (b == 0) return 1;
        if (b % 2 == 0)
        {
            long d = Powmod(a, b / 2, p);
            return d * d % p;
        }
        else
        {
            return a * Powmod(a, b - 1, p) % p;
        }
    }

}

class Scanner
{
    string[] s; int i;
    char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan { get { return ReadLine().Split(); } }
    public int[] scanint { get { return Array.ConvertAll(scan, int.Parse); } }
    public long[] scanlong { get { return Array.ConvertAll(scan, long.Parse); } }
    public double[] scandouble { get { return Array.ConvertAll(scan, double.Parse); } }
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint { get { return int.Parse(next); } }
    public long nextlong { get { return long.Parse(next); } }
    public double nextdouble { get { return double.Parse(next); } }
}
0