結果
問題 | No.1336 Union on Blackboard |
ユーザー |
![]() |
提出日時 | 2021-01-15 21:25:22 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 30 ms / 2,000 ms |
コード長 | 2,819 bytes |
コンパイル時間 | 953 ms |
コンパイル使用メモリ | 107,520 KB |
実行使用メモリ | 19,712 KB |
最終ジャッジ日時 | 2024-11-26 13:14:38 |
合計ジャッジ時間 | 2,663 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 31 |
コンパイルメッセージ
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 t = int.Parse(Console.ReadLine());for (int i = 0; i < t; i++){int n = int.Parse(Console.ReadLine());var a = Console.ReadLine().Split().Select(int.Parse).ToArray();ModInt cur = a[0];for (int j = 1; j < n; j++){cur = cur * a[j] + cur + a[j];}Console.WriteLine(cur);}}}struct ModInt{public const int Mod = 1000000007;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;}}}