結果
問題 | No.2043 Ohuton and Makura |
ユーザー | McGregorsh |
提出日時 | 2022-08-19 23:05:32 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 208 ms / 2,000 ms |
コード長 | 1,652 bytes |
コンパイル時間 | 296 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 89,728 KB |
最終ジャッジ日時 | 2024-04-17 01:43:58 |
合計ジャッジ時間 | 4,985 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 166 ms
88,960 KB |
testcase_01 | AC | 163 ms
89,216 KB |
testcase_02 | AC | 184 ms
89,216 KB |
testcase_03 | AC | 180 ms
89,728 KB |
testcase_04 | AC | 197 ms
89,728 KB |
testcase_05 | AC | 190 ms
89,728 KB |
testcase_06 | AC | 172 ms
89,088 KB |
testcase_07 | AC | 185 ms
89,344 KB |
testcase_08 | AC | 171 ms
89,344 KB |
testcase_09 | AC | 189 ms
89,344 KB |
testcase_10 | AC | 196 ms
89,344 KB |
testcase_11 | AC | 192 ms
89,600 KB |
testcase_12 | AC | 164 ms
89,344 KB |
testcase_13 | AC | 162 ms
89,600 KB |
testcase_14 | AC | 164 ms
89,600 KB |
testcase_15 | AC | 162 ms
89,344 KB |
testcase_16 | AC | 164 ms
89,088 KB |
testcase_17 | AC | 169 ms
89,728 KB |
testcase_18 | AC | 196 ms
89,728 KB |
testcase_19 | AC | 208 ms
89,472 KB |
testcase_20 | AC | 204 ms
89,600 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(): n, m, k = i_map() ans = 0 for i in range(1, m+1): tate = i yoko = 1 while tate * yoko <= k and (m - tate + 1) > 0 and (n - yoko + 1) > 0: point = (m - tate + 1) * (n - yoko + 1) ans += point yoko += 1 print(ans) if __name__ == '__main__': main()