結果
問題 | No.1157 Many Quotients easy |
ユーザー | McGregorsh |
提出日時 | 2023-05-08 12:07:42 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 139 ms / 2,000 ms |
コード長 | 1,467 bytes |
コンパイル時間 | 192 ms |
コンパイル使用メモリ | 82,432 KB |
実行使用メモリ | 89,872 KB |
最終ジャッジ日時 | 2024-05-04 00:05:24 |
合計ジャッジ時間 | 5,624 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 127 ms
89,500 KB |
testcase_01 | AC | 128 ms
89,344 KB |
testcase_02 | AC | 128 ms
89,848 KB |
testcase_03 | AC | 125 ms
89,600 KB |
testcase_04 | AC | 127 ms
89,600 KB |
testcase_05 | AC | 128 ms
89,600 KB |
testcase_06 | AC | 124 ms
89,600 KB |
testcase_07 | AC | 124 ms
89,840 KB |
testcase_08 | AC | 128 ms
89,600 KB |
testcase_09 | AC | 127 ms
89,216 KB |
testcase_10 | AC | 124 ms
89,720 KB |
testcase_11 | AC | 129 ms
89,344 KB |
testcase_12 | AC | 127 ms
89,472 KB |
testcase_13 | AC | 129 ms
89,600 KB |
testcase_14 | AC | 129 ms
89,344 KB |
testcase_15 | AC | 124 ms
89,872 KB |
testcase_16 | AC | 123 ms
89,392 KB |
testcase_17 | AC | 129 ms
89,788 KB |
testcase_18 | AC | 139 ms
89,728 KB |
testcase_19 | AC | 129 ms
89,504 KB |
testcase_20 | AC | 127 ms
89,728 KB |
testcase_21 | AC | 124 ms
89,424 KB |
testcase_22 | AC | 126 ms
89,384 KB |
testcase_23 | AC | 126 ms
89,588 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()) ans = set() for i in range(1, N+1): p = N // i ans.add(p) print(len(ans)) if __name__ == '__main__': main()