結果
問題 | No.1415 100の倍数かつ正整数(1) |
ユーザー | McGregorsh |
提出日時 | 2023-05-06 14:29:16 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 218 ms / 2,000 ms |
コード長 | 1,395 bytes |
コンパイル時間 | 369 ms |
コンパイル使用メモリ | 87,240 KB |
実行使用メモリ | 92,624 KB |
最終ジャッジ日時 | 2023-08-15 14:42:49 |
合計ジャッジ時間 | 6,818 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 206 ms
92,612 KB |
testcase_01 | AC | 207 ms
92,324 KB |
testcase_02 | AC | 217 ms
92,368 KB |
testcase_03 | AC | 202 ms
92,576 KB |
testcase_04 | AC | 210 ms
92,476 KB |
testcase_05 | AC | 209 ms
92,624 KB |
testcase_06 | AC | 204 ms
92,612 KB |
testcase_07 | AC | 206 ms
92,480 KB |
testcase_08 | AC | 203 ms
92,472 KB |
testcase_09 | AC | 217 ms
92,508 KB |
testcase_10 | AC | 213 ms
92,564 KB |
testcase_11 | AC | 210 ms
92,416 KB |
testcase_12 | AC | 215 ms
92,364 KB |
testcase_13 | AC | 216 ms
92,608 KB |
testcase_14 | AC | 212 ms
92,308 KB |
testcase_15 | AC | 210 ms
92,440 KB |
testcase_16 | AC | 214 ms
92,504 KB |
testcase_17 | AC | 215 ms
92,452 KB |
testcase_18 | AC | 212 ms
92,376 KB |
testcase_19 | AC | 218 ms
92,480 KB |
testcase_20 | AC | 207 ms
92,476 KB |
testcase_21 | AC | 207 ms
92,356 KB |
testcase_22 | AC | 209 ms
92,480 KB |
testcase_23 | AC | 206 ms
92,500 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 = int(input()) print(max(0, N // 100)) if __name__ == '__main__': main()