結果
問題 | No.192 合成数 |
ユーザー | McGregorsh |
提出日時 | 2023-03-22 22:12:04 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 151 ms / 2,000 ms |
コード長 | 1,663 bytes |
コンパイル時間 | 327 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 88,448 KB |
最終ジャッジ日時 | 2023-10-18 19:08:59 |
合計ジャッジ時間 | 5,673 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 146 ms
88,440 KB |
testcase_01 | AC | 145 ms
88,440 KB |
testcase_02 | AC | 147 ms
88,440 KB |
testcase_03 | AC | 145 ms
88,440 KB |
testcase_04 | AC | 145 ms
88,448 KB |
testcase_05 | AC | 146 ms
88,440 KB |
testcase_06 | AC | 146 ms
88,440 KB |
testcase_07 | AC | 145 ms
88,444 KB |
testcase_08 | AC | 144 ms
88,444 KB |
testcase_09 | AC | 145 ms
88,444 KB |
testcase_10 | AC | 145 ms
88,436 KB |
testcase_11 | AC | 144 ms
88,444 KB |
testcase_12 | AC | 147 ms
88,444 KB |
testcase_13 | AC | 146 ms
88,440 KB |
testcase_14 | AC | 146 ms
88,444 KB |
testcase_15 | AC | 147 ms
88,444 KB |
testcase_16 | AC | 151 ms
88,440 KB |
testcase_17 | AC | 146 ms
88,448 KB |
testcase_18 | AC | 146 ms
88,444 KB |
testcase_19 | AC | 146 ms
88,440 KB |
testcase_20 | AC | 145 ms
88,440 KB |
testcase_21 | AC | 147 ms
88,448 KB |
testcase_22 | AC | 148 ms
88,440 KB |
testcase_23 | AC | 145 ms
88,448 KB |
testcase_24 | AC | 147 ms
88,440 KB |
testcase_25 | AC | 145 ms
88,440 KB |
testcase_26 | AC | 145 ms
88,440 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 is_prime(n): if n < 2: return False i = 2 while i * i <= n: if n % i == 0: return False i += 1 return True def main(): N = int(input()) for i in range(N-100, N+101): if i == 1: continue if is_prime(i) == False: print(i) exit() if __name__ == '__main__': main()