結果
問題 | No.16 累乗の加算 |
ユーザー |
![]() |
提出日時 | 2019-12-25 13:44:26 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 26 ms / 5,000 ms |
コード長 | 6,667 bytes |
コンパイル時間 | 1,926 ms |
コンパイル使用メモリ | 114,904 KB |
実行使用メモリ | 27,956 KB |
最終ジャッジ日時 | 2024-09-24 23:39:31 |
合計ジャッジ時間 | 3,017 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
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.Generic;using System.Linq;class Program{static void Main(string[] args){var X = sc.ReadInt();var N = sc.ReadInt();var A = sc.ReadIntArray(N);ModInt ans = 0;for (int i = 0; i < N; i++){ans += ModInt.Pow(X, A[i]);}Console.WriteLine(ans);}public struct ModInt{public const long Mod = 1000003;public long num;public ModInt(long n) { num = n; }public override string ToString() { return num.ToString(); }public static ModInt operator +(ModInt l, ModInt r) { l.num += r.num; if (l.num >= Mod) l.num -= Mod; return l; }public static ModInt operator -(ModInt l, ModInt r) { l.num -= r.num; if (l.num < 0) l.num += Mod; return l; }public static ModInt operator *(ModInt l, ModInt r) { return new ModInt(l.num * r.num % Mod); }public static ModInt operator /(ModInt l, ModInt r) { return l * Inverse(r); }public static implicit operator ModInt(long n) { n %= Mod; if (n < 0) n += Mod; return new ModInt(n); }public static ModInt Pow(ModInt v, long k) { return Pow(v.num, k); }public static ModInt Pow(long v, long k){long ret = 1;for (k %= Mod - 1; k > 0; k >>= 1, v = v * v % Mod)if ((k & 1) == 1) ret = ret * v % Mod;return new ModInt(ret);}public static ModInt Inverse(ModInt v) { return Pow(v, Mod - 2); }private static List<ModInt> Facs = new List<ModInt> { 1 };public static ModInt Fac(int n){for (int i = Facs.Count; i <= n; i++){Facs.Add(i * Facs[i - 1]);}return Facs[n];}public static ModInt nCr(int n, int r){if (n < r) return 0;if (n == r) return 1;//var b = new BinomialCoefficient(n);//return b[n, r];return Fac(n) / (Fac(r) * Fac(n - r));}}public class BinomialCoefficient{public ModInt[] fact, ifact;public BinomialCoefficient(int n){fact = new ModInt[n + 1];ifact = new ModInt[n + 1];fact[0] = 1;for (int i = 1; i <= n; i++)fact[i] = fact[i - 1] * i;ifact[n] = ModInt.Inverse(fact[n]);for (int i = n - 1; i >= 0; i--)ifact[i] = ifact[i + 1] * (i + 1);ifact[0] = ifact[1];}public ModInt this[int n, int r]{get{if (n < 0 || n >= fact.Length || r < 0 || r > n) return 0;return fact[n] * ifact[n - r] * ifact[r];}}public ModInt RepeatedCombination(int n, int k){if (k == 0) return 1;return this[n + k - 1, k];}}static Scanner sc = new Scanner();}class Scanner{string[] S = new string[0];int Index = 0;char[] Separators = new char[] { ' ' };public string Next(){if (this.Index < this.S.Length) return this.S[this.Index++];var line = "";while (line == "") line = Console.ReadLine();this.S = line.Split(this.Separators, StringSplitOptions.RemoveEmptyEntries);if (this.S.Length == 0) return this.Next();this.Index = 0;return this.S[this.Index++];}public string ReadStr(){return this.Next();}public char ReadChar(){return this.Next()[0];}public int ReadInt(){return int.Parse(this.Next());}public uint ReadUInt(){return uint.Parse(this.Next());}public long ReadLong(){return long.Parse(this.Next());}public double ReadDouble(){return double.Parse(this.Next());}public Tuple<int, int> ReadTup(int add = 0){return Tuple.Create(this.ReadInt() + add, this.ReadInt() + add);}public Tuple<long, long> ReadTupLong(int add = 0){return Tuple.Create(this.ReadLong() + add, this.ReadLong() + add);}public Tuple<int, int, int> ReadTup3(int add = 0){return Tuple.Create(this.ReadInt() + add, this.ReadInt() + add, this.ReadInt() + add);}public Tuple<int, int, int, int> ReadTup4(int add = 0){return Tuple.Create(this.ReadInt() + add, this.ReadInt() + add, this.ReadInt() + add, this.ReadInt() + add);}public int[] ReadIntArray(int n){var array = new int[n];for (int i = 0; i < array.Length; i++){array[i] = this.ReadInt();}return array;}public long[] ReadLongArray(int n){var array = new long[n];for (int i = 0; i < array.Length; i++){array[i] = this.ReadLong();}return array;}public double[] ReadDoubleArray(int n){var array = new double[n];for (int i = 0; i < array.Length; i++){array[i] = this.ReadDouble();}return array;}public char[] ReadCharArray(int n){var array = new char[n];for (int i = 0; i < array.Length; i++){array[i] = this.ReadChar();}return array;}public string[] ReadStrArray(int n){var array = new string[n];for (int i = 0; i < array.Length; i++){array[i] = this.ReadStr();}return array;}public Tuple<long, long>[] ReadTupLongArray(int n, int add = 0){var array = new Tuple<long, long>[n];for (int i = 0; i < n; i++){array[i] = this.ReadTupLong(add);}return array;}public Tuple<int, int>[] ReadTupArray(int n, int add = 0){var array = new Tuple<int, int>[n];for (int i = 0; i < n; i++){array[i] = this.ReadTup(add);}return array;}public Tuple<int, int, int>[] ReadTup3Array(int n, int add = 0){var array = new Tuple<int, int, int>[n];for (int i = 0; i < n; i++){array[i] = this.ReadTup3(add);}return array;}public Tuple<int, int, int, int>[] ReadTup4Array(int n, int add = 0){var array = new Tuple<int, int, int, int>[n];for (int i = 0; i < n; i++){array[i] = this.ReadTup4(add);}return array;}}