結果

問題 No.1049 Zero (Exhaust)
ユーザー keymoonkeymoon
提出日時 2020-05-08 21:34:37
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 269 ms / 2,000 ms
コード長 2,890 bytes
コンパイル時間 1,052 ms
コンパイル使用メモリ 113,068 KB
実行使用メモリ 27,212 KB
最終ジャッジ日時 2024-07-04 00:06:26
合計ジャッジ時間 5,848 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 30 ms
27,136 KB
testcase_01 AC 29 ms
24,952 KB
testcase_02 AC 29 ms
25,260 KB
testcase_03 AC 191 ms
24,660 KB
testcase_04 AC 30 ms
25,228 KB
testcase_05 AC 163 ms
24,916 KB
testcase_06 AC 268 ms
24,912 KB
testcase_07 AC 60 ms
24,880 KB
testcase_08 AC 100 ms
27,076 KB
testcase_09 AC 208 ms
27,212 KB
testcase_10 AC 224 ms
26,996 KB
testcase_11 AC 225 ms
27,212 KB
testcase_12 AC 256 ms
25,040 KB
testcase_13 AC 81 ms
27,080 KB
testcase_14 AC 131 ms
24,964 KB
testcase_15 AC 196 ms
25,040 KB
testcase_16 AC 164 ms
25,088 KB
testcase_17 AC 170 ms
25,040 KB
testcase_18 AC 228 ms
27,008 KB
testcase_19 AC 197 ms
24,912 KB
testcase_20 AC 98 ms
25,080 KB
testcase_21 AC 202 ms
27,208 KB
testcase_22 AC 126 ms
24,960 KB
testcase_23 AC 269 ms
26,952 KB
testcase_24 AC 268 ms
25,352 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Text;
using System.Text.RegularExpressions;
using System.Threading.Tasks;
using static System.Math;

public static class P
{
    public static void Main()
    {
        var pk = Console.ReadLine().Split().Select(long.Parse).ToArray();
        var p = pk[0];
        var k = pk[1];
        ModInt zero = 1;
        ModInt nonZero = 0;
        for (int i = 0; i < k; i++)
        {
            var newZero = nonZero * 1 + zero * 1 + nonZero * 1 + zero * p;
            var newNonZero = nonZero * (p - 1) + zero * (p - 1) + nonZero * (p - 1);
            zero = newZero;
            nonZero = newNonZero;
        }
        Console.WriteLine(zero);
    }
}

struct ModInt
{
    public const int Mod = 1000000007;
    const long POSITIVIZER = ((long)Mod) << 31;
    long Data;
    public ModInt(long data) { if ((Data = data % Mod) < 0) Data += Mod; }
    public static implicit operator long(ModInt modInt) => modInt.Data;
    public static implicit operator ModInt(long val) => new ModInt(val);
    public static ModInt operator +(ModInt a, int b) => new ModInt() { Data = (a.Data + b + POSITIVIZER) % Mod };
    public static ModInt operator +(ModInt a, long b) => new ModInt(a.Data + b);
    public static ModInt operator +(ModInt a, ModInt b) { long res = a.Data + b.Data; return new ModInt() { Data = res >= Mod ? res - Mod : res }; }
    public static ModInt operator -(ModInt a, int b) => new ModInt() { Data = (a.Data - b + POSITIVIZER) % Mod };
    public static ModInt operator -(ModInt a, long b) => new ModInt(a.Data - b);
    public static ModInt operator -(ModInt a, ModInt b) { long res = a.Data - b.Data; return new ModInt() { Data = res < 0 ? res + Mod : res }; }
    public static ModInt operator *(ModInt a, int b) => new ModInt(a.Data * b);
    public static ModInt operator *(ModInt a, long b) => a * new ModInt(b);
    public static ModInt operator *(ModInt a, ModInt b) => new ModInt() { Data = a.Data * b.Data % Mod };
    public static ModInt operator /(ModInt a, ModInt b) => new ModInt() { Data = a.Data * GetInverse(b) % Mod };
    public static bool operator ==(ModInt a, ModInt b) => a.Data == b.Data;
    public static bool operator !=(ModInt a, ModInt b) => a.Data != b.Data;
    public override string ToString() => Data.ToString();
    public override bool Equals(object obj) => (ModInt)obj == this;
    public override int GetHashCode() => (int)Data;
    static long GetInverse(long a)
    {
        long div, p = Mod, x1 = 1, y1 = 0, x2 = 0, y2 = 1;
        while (true)
        {
            if (p == 1) return x2 + Mod; div = a / p; x1 -= x2 * div; y1 -= y2 * div; a %= p;
            if (a == 1) return x1 + Mod; div = p / a; x2 -= x1 * div; y2 -= y1 * div; p %= a;
        }
    }
}
0