結果
問題 | No.251 大きな桁の復習問題(1) |
ユーザー | AreTrash |
提出日時 | 2018-03-15 00:52:04 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 4,036 bytes |
コンパイル時間 | 1,909 ms |
コンパイル使用メモリ | 113,368 KB |
実行使用メモリ | 18,944 KB |
最終ジャッジ日時 | 2024-05-07 13:16:06 |
合計ジャッジ時間 | 8,526 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 33 ms
18,944 KB |
testcase_01 | AC | 33 ms
18,816 KB |
testcase_02 | AC | 32 ms
18,688 KB |
testcase_03 | AC | 34 ms
18,944 KB |
testcase_04 | AC | 34 ms
18,944 KB |
testcase_05 | AC | 34 ms
18,816 KB |
testcase_06 | AC | 35 ms
18,944 KB |
testcase_07 | AC | 35 ms
18,816 KB |
testcase_08 | AC | 37 ms
18,944 KB |
testcase_09 | TLE | - |
testcase_10 | -- | - |
testcase_11 | -- | - |
testcase_12 | -- | - |
testcase_13 | -- | - |
testcase_14 | -- | - |
testcase_15 | -- | - |
testcase_16 | -- | - |
testcase_17 | -- | - |
testcase_18 | -- | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.IO; using System.Collections.Generic; using System.Numerics; namespace No251_1 { public class Program { void Solve(StreamScanner ss, StreamWriter sw) { //--------------------------------- ModInt.Mod = 129402307; var N = ss.Next(ModInt.Parse); var M = ss.Next(BigInteger.Parse); sw.WriteLine(N.Pow(M)); //--------------------------------- } static void Main() { var ss = new StreamScanner(new StreamReader(Console.OpenStandardInput())); var sw = new StreamWriter(Console.OpenStandardOutput()) {AutoFlush = false}; new Program().Solve(ss, sw); sw.Flush(); } } public static partial class MathX { public static int GcdEx(int a, int b, out int x, out int y) { if (b == 0) { x = 1; y = 0; return a; } int tx, ty; var gcd = GcdEx(b, a % b, out tx, out ty); x = ty; y = tx - ty * (a / b); return gcd; } } public struct ModInt { public static int Mod = 1000000007; readonly BigInteger value; public int Value { get { return (int)value; } } public ModInt Inverse { get { return GetInverse(); } } public ModInt(BigInteger value) { value %= Mod; this.value = value < 0 ? value + Mod : value; } ModInt GetInverse() { int x, y; if (MathX.GcdEx(Value, Mod, out x, out y) != 1) { throw new InvalidOperationException("'Value' and 'Mod' must be disjoint."); } return x; } public ModInt Square() { return this * this; } public ModInt Pow(BigInteger exp) { if (exp == 0) return 1; if (exp % 2 == 0) return Pow(exp / 2).Square(); return this * Pow(exp - 1); } public static ModInt Parse(string str) { return BigInteger.Parse(str); } public static implicit operator ModInt(long value) { return new ModInt(value); } public static implicit operator ModInt(BigInteger value) { return new ModInt(value); } public static ModInt operator +(ModInt left, ModInt right) { return left.value + right.value; } public static ModInt operator -(ModInt left, ModInt right) { return left.value - right.value; } public static ModInt operator *(ModInt left, ModInt right) { return left.value * right.value; } public static ModInt operator /(ModInt left, ModInt right) { return left * right.Inverse; } public override bool Equals(object obj) { if (!(obj is ModInt)) return false; return value == ((ModInt)obj).value; } public override int GetHashCode() { return value.GetHashCode(); } public override string ToString() { return value.ToString(); } } public class StreamScanner { static readonly char[] Sep = {' '}; readonly Queue<string> buffer = new Queue<string>(); readonly TextReader textReader; public StreamScanner(TextReader textReader) { this.textReader = textReader; } public T Next<T>(Func<string, T> parser) { if (buffer.Count != 0) return parser(buffer.Dequeue()); var nextStrings = textReader.ReadLine().Split(Sep, StringSplitOptions.RemoveEmptyEntries); foreach (var nextString in nextStrings) buffer.Enqueue(nextString); return Next(parser); } } }