結果
問題 | No.836 じょうよ |
ユーザー | McGregorsh |
提出日時 | 2023-04-13 13:48:20 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 131 ms / 1,000 ms |
コード長 | 1,658 bytes |
コンパイル時間 | 427 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 90,752 KB |
最終ジャッジ日時 | 2024-04-17 17:38:19 |
合計ジャッジ時間 | 6,696 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 125 ms
90,368 KB |
testcase_01 | AC | 112 ms
89,472 KB |
testcase_02 | AC | 114 ms
89,280 KB |
testcase_03 | AC | 117 ms
89,472 KB |
testcase_04 | AC | 114 ms
89,472 KB |
testcase_05 | AC | 113 ms
89,472 KB |
testcase_06 | AC | 113 ms
89,472 KB |
testcase_07 | AC | 112 ms
89,600 KB |
testcase_08 | AC | 113 ms
89,728 KB |
testcase_09 | AC | 113 ms
89,568 KB |
testcase_10 | AC | 115 ms
89,600 KB |
testcase_11 | AC | 120 ms
90,368 KB |
testcase_12 | AC | 121 ms
89,984 KB |
testcase_13 | AC | 120 ms
90,148 KB |
testcase_14 | AC | 121 ms
90,112 KB |
testcase_15 | AC | 120 ms
90,120 KB |
testcase_16 | AC | 127 ms
90,216 KB |
testcase_17 | AC | 127 ms
90,548 KB |
testcase_18 | AC | 121 ms
90,240 KB |
testcase_19 | AC | 122 ms
90,112 KB |
testcase_20 | AC | 123 ms
90,240 KB |
testcase_21 | AC | 121 ms
90,216 KB |
testcase_22 | AC | 123 ms
90,240 KB |
testcase_23 | AC | 123 ms
90,368 KB |
testcase_24 | AC | 120 ms
90,368 KB |
testcase_25 | AC | 122 ms
90,368 KB |
testcase_26 | AC | 119 ms
90,288 KB |
testcase_27 | AC | 116 ms
90,240 KB |
testcase_28 | AC | 125 ms
90,496 KB |
testcase_29 | AC | 120 ms
90,008 KB |
testcase_30 | AC | 119 ms
90,136 KB |
testcase_31 | AC | 120 ms
90,240 KB |
testcase_32 | AC | 121 ms
90,208 KB |
testcase_33 | AC | 120 ms
90,284 KB |
testcase_34 | AC | 120 ms
90,240 KB |
testcase_35 | AC | 121 ms
90,324 KB |
testcase_36 | AC | 131 ms
90,112 KB |
testcase_37 | AC | 120 ms
90,240 KB |
testcase_38 | AC | 121 ms
90,160 KB |
testcase_39 | AC | 123 ms
90,060 KB |
testcase_40 | AC | 126 ms
90,752 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() total = (R - L + 1) // M ans = [total] * M amari = (R - L + 1) % M A = amari s = L % M for i in range(s, min(M, s + amari)): ans[i] += 1 A -= 1 if A > 0: for i in range(A): ans[i] += 1 for i in ans: print(i) if __name__ == '__main__': main()