結果
問題 | No.16 累乗の加算 |
ユーザー |
|
提出日時 | 2021-11-20 17:48:19 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 38 ms / 5,000 ms |
コード長 | 1,856 bytes |
コンパイル時間 | 546 ms |
コンパイル使用メモリ | 82,108 KB |
実行使用メモリ | 54,164 KB |
最終ジャッジ日時 | 2024-06-11 20:03:36 |
合計ジャッジ時間 | 1,176 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 14 |
ソースコード
MOD = 1000003 # 適宜変更class ModInt:def __init__(self, x):self.x = x % MODdef __str__(self):return str(self.x)__repr__ = __str__def __add__(self, other):return (ModInt(self.x + other.x) if isinstance(other, ModInt) elseModInt(self.x + other))def __sub__(self, other):return (ModInt(self.x - other.x) if isinstance(other, ModInt) elseModInt(self.x - other))def __mul__(self, other):return (ModInt(self.x * other.x) if isinstance(other, ModInt) elseModInt(self.x * other))def __truediv__(self, other):return (ModInt(self.x * pow(other.x, MOD - 2, MOD)) if isinstance(other, ModInt) elseModInt(self.x * pow(other, MOD - 2, MOD)))def __pow__(self, other):return (ModInt(pow(self.x, other.x, MOD)) if isinstance(other, ModInt) elseModInt(pow(self.x, other, MOD)))__radd__ = __add__def __rsub__(self, other):return (ModInt(other.x - self.x) if isinstance(other, ModInt) elseModInt(other - self.x))__rmul__ = __mul__def __rtruediv__(self, other):return (ModInt(other.x * pow(self.x, MOD - 2, MOD)) if isinstance(other, ModInt) elseModInt(other * pow(self.x, MOD - 2, MOD)))def __rpow__(self, other):return (ModInt(pow(other.x, self.x, MOD)) if isinstance(other, ModInt) elseModInt(pow(other, self.x, MOD)))x,n=map(int,input().split())a=[int(i) for i in input().split()]result=ModInt(0)for i in range(n):result+=ModInt(x)**a[i]print(result)