結果
問題 | No.810 割った余りの個数 |
ユーザー | McGregorsh |
提出日時 | 2023-05-07 22:00:12 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 234 ms / 2,000 ms |
コード長 | 1,397 bytes |
コンパイル時間 | 507 ms |
コンパイル使用メモリ | 87,192 KB |
実行使用メモリ | 92,472 KB |
最終ジャッジ日時 | 2023-08-16 08:40:40 |
合計ジャッジ時間 | 9,212 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 228 ms
92,172 KB |
testcase_01 | AC | 227 ms
92,236 KB |
testcase_02 | AC | 226 ms
92,176 KB |
testcase_03 | AC | 228 ms
92,232 KB |
testcase_04 | AC | 231 ms
92,160 KB |
testcase_05 | AC | 232 ms
92,048 KB |
testcase_06 | AC | 229 ms
92,132 KB |
testcase_07 | AC | 230 ms
92,360 KB |
testcase_08 | AC | 228 ms
92,324 KB |
testcase_09 | AC | 228 ms
92,180 KB |
testcase_10 | AC | 226 ms
92,352 KB |
testcase_11 | AC | 226 ms
92,020 KB |
testcase_12 | AC | 228 ms
92,156 KB |
testcase_13 | AC | 225 ms
92,304 KB |
testcase_14 | AC | 228 ms
92,176 KB |
testcase_15 | AC | 232 ms
92,296 KB |
testcase_16 | AC | 233 ms
92,044 KB |
testcase_17 | AC | 227 ms
92,272 KB |
testcase_18 | AC | 230 ms
92,000 KB |
testcase_19 | AC | 234 ms
92,044 KB |
testcase_20 | AC | 227 ms
92,268 KB |
testcase_21 | AC | 229 ms
92,276 KB |
testcase_22 | AC | 227 ms
92,216 KB |
testcase_23 | AC | 224 ms
92,164 KB |
testcase_24 | AC | 228 ms
92,140 KB |
testcase_25 | AC | 223 ms
92,472 KB |
testcase_26 | AC | 219 ms
92,012 KB |
testcase_27 | AC | 230 ms
92,452 KB |
testcase_28 | AC | 229 ms
92,044 KB |
testcase_29 | AC | 229 ms
92,300 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() print(min(R-L+1, M)) if __name__ == '__main__': main()