結果
問題 | No.741 AscNumber(Easy) |
ユーザー |
![]() |
提出日時 | 2020-02-29 23:48:32 |
言語 | Python3 (3.13.1 + numpy 2.2.1 + scipy 1.14.1) |
結果 |
AC
|
実行時間 | 30 ms / 2,000 ms |
コード長 | 1,703 bytes |
コンパイル時間 | 138 ms |
コンパイル使用メモリ | 13,056 KB |
実行使用メモリ | 11,008 KB |
最終ジャッジ日時 | 2024-10-13 20:22:17 |
合計ジャッジ時間 | 3,429 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 55 |
ソースコード
import syssys.setrecursionlimit(10 ** 6)from bisect import *from collections import *from heapq import *def II(): return int(sys.stdin.readline())def MI(): return map(int, sys.stdin.readline().split())def LI(): return list(map(int, sys.stdin.readline().split()))def SI(): return sys.stdin.readline()[:-1]def LLI(rows_number): return [LI() for _ in range(rows_number)]int1 = lambda x: int(x) - 1def MI1(): return map(int1, sys.stdin.readline().split())def LI1(): return list(map(int1, sys.stdin.readline().split()))p2D = lambda x: print(*x, sep="\n")dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]class mint:def __init__(self, x):self.__x = x % mddef __str__(self):return str(self.__x)def __add__(self, other):if isinstance(other, mint): other = other.__xreturn mint(self.__x + other)def __sub__(self, other):if isinstance(other, mint): other = other.__xreturn mint(self.__x - other)def __rsub__(self, other):return mint(other - self.__x)def __mul__(self, other):if isinstance(other, mint): other = other.__xreturn mint(self.__x * other)__radd__ = __add____rmul__ = __mul__def __truediv__(self, other):if isinstance(other, mint): other = other.__xreturn mint(self.__x * pow(other, md - 2, md))def __rtruediv__(self, other):return mint(other * pow(self.__x, md - 2, md))def __pow__(self, power, modulo=None):return mint(pow(self.__x, power, md))md = 10**9+7def main():n=II()num=mint(n+1)for i in range(n+2,n+10):num*=idem=mint(1)for i in range(2,10):dem*=iprint(num/dem)main()