結果
問題 | No.2176 LRM Question 1 |
ユーザー | McGregorsh |
提出日時 | 2023-05-11 21:30:48 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 333 ms / 2,000 ms |
コード長 | 1,795 bytes |
コンパイル時間 | 492 ms |
コンパイル使用メモリ | 87,264 KB |
実行使用メモリ | 108,688 KB |
最終ジャッジ日時 | 2023-08-18 12:34:41 |
合計ジャッジ時間 | 9,749 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 261 ms
92,452 KB |
testcase_01 | AC | 262 ms
92,356 KB |
testcase_02 | AC | 332 ms
108,688 KB |
testcase_03 | AC | 262 ms
92,632 KB |
testcase_04 | AC | 313 ms
108,468 KB |
testcase_05 | AC | 268 ms
93,304 KB |
testcase_06 | AC | 268 ms
92,980 KB |
testcase_07 | AC | 267 ms
93,432 KB |
testcase_08 | AC | 308 ms
108,592 KB |
testcase_09 | AC | 314 ms
108,016 KB |
testcase_10 | AC | 318 ms
106,352 KB |
testcase_11 | AC | 260 ms
92,552 KB |
testcase_12 | AC | 264 ms
92,372 KB |
testcase_13 | AC | 264 ms
92,712 KB |
testcase_14 | AC | 333 ms
108,572 KB |
testcase_15 | AC | 322 ms
105,128 KB |
testcase_16 | AC | 310 ms
102,988 KB |
testcase_17 | AC | 264 ms
93,012 KB |
testcase_18 | AC | 260 ms
92,460 KB |
testcase_19 | AC | 262 ms
92,276 KB |
testcase_20 | AC | 259 ms
92,508 KB |
testcase_21 | AC | 293 ms
99,564 KB |
testcase_22 | AC | 269 ms
93,304 KB |
testcase_23 | AC | 293 ms
98,524 KB |
testcase_24 | AC | 262 ms
92,576 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()