結果
問題 | No.1006 Share an Integer |
ユーザー | McGregorsh |
提出日時 | 2022-07-07 09:31:20 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 475 ms / 2,000 ms |
コード長 | 1,848 bytes |
コンパイル時間 | 372 ms |
コンパイル使用メモリ | 87,056 KB |
実行使用メモリ | 173,532 KB |
最終ジャッジ日時 | 2023-08-25 18:33:55 |
合計ジャッジ時間 | 8,786 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 215 ms
92,692 KB |
testcase_01 | AC | 206 ms
92,628 KB |
testcase_02 | AC | 219 ms
93,516 KB |
testcase_03 | AC | 210 ms
92,480 KB |
testcase_04 | AC | 223 ms
93,368 KB |
testcase_05 | AC | 230 ms
93,756 KB |
testcase_06 | AC | 211 ms
93,464 KB |
testcase_07 | AC | 207 ms
93,412 KB |
testcase_08 | AC | 210 ms
93,660 KB |
testcase_09 | AC | 209 ms
93,872 KB |
testcase_10 | AC | 209 ms
93,588 KB |
testcase_11 | AC | 344 ms
139,028 KB |
testcase_12 | AC | 449 ms
169,336 KB |
testcase_13 | AC | 469 ms
173,516 KB |
testcase_14 | AC | 475 ms
173,532 KB |
testcase_15 | AC | 423 ms
162,304 KB |
testcase_16 | AC | 312 ms
128,372 KB |
testcase_17 | AC | 345 ms
140,136 KB |
testcase_18 | AC | 427 ms
162,924 KB |
testcase_19 | AC | 417 ms
159,996 KB |
testcase_20 | AC | 424 ms
164,720 KB |
testcase_21 | AC | 457 ms
173,164 KB |
ソースコード
import sys, re 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 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(): x = int(input()) count = [0] * x for i in range(1, x): for j in range(0, x, i): count[j] += 1 score = [INF] * x for i in range(1, x): score[i] = i - count[i] juge = [INF] * x for i in range(1, x): juge[i] = abs(score[i] - score[x-i]) min_juge = min(juge) ans = [] for i in range(1, x): if juge[i] == min_juge: ans.append([i, x-i]) for i in range(len(ans)): a = ans[i][0] b = ans[i][1] print(a, b) if __name__ == '__main__': main()