結果
問題 | No.16 累乗の加算 |
ユーザー |
![]() |
提出日時 | 2020-02-07 17:34:49 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 32 ms / 5,000 ms |
コード長 | 2,850 bytes |
コンパイル時間 | 1,652 ms |
コンパイル使用メモリ | 114,580 KB |
実行使用メモリ | 27,212 KB |
最終ジャッジ日時 | 2024-09-25 07:21:43 |
合計ジャッジ時間 | 2,483 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 14 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
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(){int x = Console.ReadLine().Split().Select(int.Parse).First();Console.WriteLine(Console.ReadLine().Split().Select(int.Parse).Select(a => Power(x, a)).Aggregate((a, b) => a + b));}static ModInt Power(ModInt n, long m){ModInt pow = n;ModInt res = 1;while (m > 0){if ((m & 1) == 1) res *= pow;pow *= pow;m >>= 1;}return res;}}struct ModInt{public const int Mod = 1000003;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;}}}