結果
問題 | No.1092 modular arithmetic |
ユーザー | fairy_lettuce |
提出日時 | 2020-06-24 01:52:02 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 96 ms / 2,000 ms |
コード長 | 4,725 bytes |
コンパイル時間 | 1,141 ms |
コンパイル使用メモリ | 116,252 KB |
実行使用メモリ | 28,288 KB |
最終ジャッジ日時 | 2024-07-03 19:41:47 |
合計ジャッジ時間 | 5,089 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 25 ms
17,792 KB |
testcase_01 | AC | 68 ms
28,288 KB |
testcase_02 | AC | 25 ms
18,048 KB |
testcase_03 | AC | 77 ms
27,520 KB |
testcase_04 | AC | 69 ms
26,112 KB |
testcase_05 | AC | 69 ms
25,984 KB |
testcase_06 | AC | 56 ms
23,296 KB |
testcase_07 | AC | 68 ms
26,112 KB |
testcase_08 | AC | 72 ms
26,752 KB |
testcase_09 | AC | 68 ms
25,472 KB |
testcase_10 | AC | 62 ms
24,064 KB |
testcase_11 | AC | 66 ms
25,600 KB |
testcase_12 | AC | 58 ms
23,168 KB |
testcase_13 | AC | 50 ms
22,272 KB |
testcase_14 | AC | 55 ms
23,168 KB |
testcase_15 | AC | 36 ms
19,584 KB |
testcase_16 | AC | 49 ms
22,016 KB |
testcase_17 | AC | 54 ms
23,040 KB |
testcase_18 | AC | 76 ms
27,136 KB |
testcase_19 | AC | 58 ms
23,424 KB |
testcase_20 | AC | 78 ms
27,520 KB |
testcase_21 | AC | 67 ms
25,344 KB |
testcase_22 | AC | 75 ms
27,136 KB |
testcase_23 | AC | 86 ms
25,344 KB |
testcase_24 | AC | 47 ms
20,224 KB |
testcase_25 | AC | 71 ms
23,296 KB |
testcase_26 | AC | 84 ms
25,600 KB |
testcase_27 | AC | 38 ms
19,712 KB |
testcase_28 | AC | 73 ms
23,296 KB |
testcase_29 | AC | 96 ms
26,496 KB |
testcase_30 | AC | 73 ms
23,424 KB |
testcase_31 | AC | 35 ms
19,072 KB |
testcase_32 | AC | 68 ms
22,656 KB |
コンパイルメッセージ
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.Linq; namespace AtCoder.Contest.E { static class Program { public static void Solve(Scanner cin) { long p = cin.ReadLong(); int n = cin.ReadInt(); var a = cin.ReadLongArray(n); string s = cin.ReadString(); ModInt.MOD = p; ModInt now = a[0]; for (int i = 0; i < n - 1; i++) { if (s[i] == '+') now += a[i + 1]; if (s[i] == '-') now -= a[i + 1]; if (s[i] == '*') now *= a[i + 1]; if (s[i] == '/') now /= a[i + 1]; } Console.WriteLine(now); } public static void Main(string[] args) { var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }; Console.SetOut(sw); var cin = new Scanner(); Solve(cin); Console.Out.Flush(); } } public struct ModInt : IComparable<ModInt>, IEquatable<ModInt> { public static long MOD = 1000000007; private readonly long num; public ModInt(long n) { num = n; } public override string ToString() => num.ToString(); public static ModInt operator +(ModInt l, ModInt r) { long x = l.num + r.num; if (x >= MOD) x -= MOD; return new ModInt(x); } public static ModInt operator -(ModInt l, ModInt r) { long x = l.num - r.num; if (x < 0) x += MOD; return new ModInt(x); } public static ModInt operator *(ModInt l, ModInt r) => new ModInt((l.num * r.num) % MOD); public static ModInt operator /(ModInt l, ModInt r) => l * r.Inverse(); public static ModInt operator ++(ModInt x) { var tmp = x + new ModInt(1); return tmp; } public static ModInt operator --(ModInt x) { var tmp = x - new ModInt(1); return tmp; } public static bool operator >(ModInt l, ModInt r) => l.CompareTo(r) > 0; public static bool operator <(ModInt l, ModInt r) => l.CompareTo(r) < 0; public static bool operator >=(ModInt l, ModInt r) => l.CompareTo(r) >= 0; public static bool operator <=(ModInt l, ModInt r) => l.CompareTo(r) <= 0; public static bool operator ==(ModInt l, ModInt r) => l.Equals(r); public static bool operator !=(ModInt l, ModInt r) => !l.Equals(r); public static implicit operator long(ModInt x) => x.num; public static implicit operator ModInt(long n) { n %= MOD; if (n < 0) n += MOD; return new ModInt(n); } public ModInt Inverse() => Inverse(this, MOD); public static ModInt Inverse(ModInt x) => Inverse(x.num, MOD); public static long Inverse(long x, long m) { if (x % m == 0) throw new DivideByZeroException(); long a = x, b = m, u = 1, v = 0; while (b > 0) { long t = a / b; a -= t * b; long p = a; a = b; b = p; // swap(a, b); u -= t * v; p = u; u = v; v = p; // swap(u, v); } u %= m; if (u < 0) u += m; return u; } public static ModInt Pow(ModInt x, long n) => Pow(x.num, n); public static ModInt Pow(long x, long n) { if (n == 0) return x; long now = 1; for (n %= MOD - 1; n > 0; n /= 2, x = x * x % MOD) { if (n % 2 == 1) now = now * x % MOD; } return new ModInt(now); } public int CompareTo(ModInt x) { if (num == x.num) return 0; if (num > x.num) return 1; return -1; } public bool Equals(ModInt x) => num == x.num; } class Scanner { string[] s; int i; char[] cs = new char[] { ' ' }; public Scanner() { s = new string[0]; i = 0; } public string Read() => ReadString(); public string ReadString() { if (i < s.Length) return s[i++]; string st = Console.ReadLine(); while (st == "") st = Console.ReadLine(); s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries); if (s.Length == 0) return ReadString(); i = 0; return s[i++]; } public string[] ReadStringArray(int N) { string[] Array = new string[N]; for (int i = 0; i < N; i++) { Array[i] = ReadString(); } return Array; } public int ReadInt() { return int.Parse(ReadString()); } public int[] ReadIntArray(int N, int add = 0) { int[] Array = new int[N]; for (int i = 0; i < N; i++) { Array[i] = ReadInt() + add; } return Array; } public long ReadLong() { return long.Parse(ReadString()); } public long[] ReadLongArray(int N, long add = 0) { long[] Array = new long[N]; for (int i = 0; i < N; i++) { Array[i] = ReadLong() + add; } return Array; } public double ReadDouble() { return double.Parse(ReadString()); } public double[] ReadDoubleArray(int N, double add = 0) { double[] Array = new double[N]; for (int i = 0; i < N; i++) { Array[i] = ReadDouble() + add; } return Array; } public T1 ReadValue<T1>() => (T1)Convert.ChangeType(ReadString(), typeof(T1)); } }