結果
問題 | No.2176 LRM Question 1 |
ユーザー | McGregorsh |
提出日時 | 2023-05-11 21:30:48 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 221 ms / 2,000 ms |
コード長 | 1,795 bytes |
コンパイル時間 | 307 ms |
コンパイル使用メモリ | 82,048 KB |
実行使用メモリ | 105,216 KB |
最終ジャッジ日時 | 2024-05-05 17:53:32 |
合計ジャッジ時間 | 5,612 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 144 ms
89,600 KB |
testcase_01 | AC | 139 ms
89,856 KB |
testcase_02 | AC | 221 ms
104,832 KB |
testcase_03 | AC | 157 ms
89,472 KB |
testcase_04 | AC | 207 ms
105,216 KB |
testcase_05 | AC | 163 ms
89,216 KB |
testcase_06 | AC | 151 ms
89,600 KB |
testcase_07 | AC | 150 ms
89,728 KB |
testcase_08 | AC | 196 ms
105,216 KB |
testcase_09 | AC | 197 ms
104,832 KB |
testcase_10 | AC | 206 ms
102,656 KB |
testcase_11 | AC | 141 ms
89,344 KB |
testcase_12 | AC | 141 ms
89,088 KB |
testcase_13 | AC | 144 ms
89,600 KB |
testcase_14 | AC | 212 ms
105,216 KB |
testcase_15 | AC | 196 ms
101,760 KB |
testcase_16 | AC | 188 ms
99,840 KB |
testcase_17 | AC | 144 ms
89,728 KB |
testcase_18 | AC | 141 ms
88,960 KB |
testcase_19 | AC | 140 ms
89,088 KB |
testcase_20 | AC | 147 ms
89,344 KB |
testcase_21 | AC | 186 ms
96,000 KB |
testcase_22 | AC | 161 ms
89,856 KB |
testcase_23 | AC | 186 ms
94,976 KB |
testcase_24 | AC | 158 ms
89,088 KB |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): L, R, M = i_map() if M <= L: print(0) else: R = min(M-1, R) P = [0] * M P[1] = 1 for i in range(2, M): p = P[i-1] * i p %= M P[i] = p PP = [0] * M PP[1] = 1 for i in range(2, M): p = PP[i-1] * P[i] p %= M PP[i] = p ans = 0 for i in range(L, R+1): ans += PP[i] ans %= M print(ans) if __name__ == '__main__': main()