結果

問題 No.1092 modular arithmetic
ユーザー fairy_lettucefairy_lettuce
提出日時 2020-06-24 01:52:02
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 133 ms / 2,000 ms
コード長 4,725 bytes
コンパイル時間 2,739 ms
コンパイル使用メモリ 106,804 KB
実行使用メモリ 30,888 KB
最終ジャッジ日時 2023-09-16 20:28:28
合計ジャッジ時間 7,562 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 59 ms
20,828 KB
testcase_01 AC 105 ms
29,296 KB
testcase_02 AC 59 ms
20,824 KB
testcase_03 AC 114 ms
28,696 KB
testcase_04 AC 106 ms
27,808 KB
testcase_05 AC 106 ms
30,016 KB
testcase_06 AC 96 ms
26,268 KB
testcase_07 AC 105 ms
27,860 KB
testcase_08 AC 109 ms
28,364 KB
testcase_09 AC 103 ms
27,712 KB
testcase_10 AC 97 ms
26,508 KB
testcase_11 AC 101 ms
29,444 KB
testcase_12 AC 95 ms
28,088 KB
testcase_13 AC 87 ms
21,500 KB
testcase_14 AC 91 ms
25,692 KB
testcase_15 AC 74 ms
23,552 KB
testcase_16 AC 83 ms
20,932 KB
testcase_17 AC 92 ms
27,780 KB
testcase_18 AC 113 ms
30,616 KB
testcase_19 AC 95 ms
26,020 KB
testcase_20 AC 115 ms
30,888 KB
testcase_21 AC 104 ms
25,724 KB
testcase_22 AC 111 ms
28,592 KB
testcase_23 AC 123 ms
27,436 KB
testcase_24 AC 85 ms
21,756 KB
testcase_25 AC 110 ms
26,036 KB
testcase_26 AC 122 ms
25,424 KB
testcase_27 AC 76 ms
21,596 KB
testcase_28 AC 110 ms
25,976 KB
testcase_29 AC 133 ms
26,272 KB
testcase_30 AC 109 ms
26,000 KB
testcase_31 AC 72 ms
19,180 KB
testcase_32 AC 103 ms
23,584 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.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));

	}
}
0