結果
問題 | No.796 well known |
ユーザー | McGregorsh |
提出日時 | 2023-04-12 22:39:46 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 162 ms / 2,000 ms |
コード長 | 1,741 bytes |
コンパイル時間 | 141 ms |
コンパイル使用メモリ | 82,524 KB |
実行使用メモリ | 98,328 KB |
最終ジャッジ日時 | 2024-04-17 08:15:18 |
合計ジャッジ時間 | 3,983 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 135 ms
89,604 KB |
testcase_01 | AC | 139 ms
89,176 KB |
testcase_02 | AC | 135 ms
89,212 KB |
testcase_03 | AC | 142 ms
89,700 KB |
testcase_04 | AC | 157 ms
94,876 KB |
testcase_05 | AC | 156 ms
95,796 KB |
testcase_06 | AC | 159 ms
97,996 KB |
testcase_07 | AC | 143 ms
90,296 KB |
testcase_08 | AC | 158 ms
96,096 KB |
testcase_09 | AC | 152 ms
92,940 KB |
testcase_10 | AC | 162 ms
98,280 KB |
testcase_11 | AC | 146 ms
90,028 KB |
testcase_12 | AC | 153 ms
92,464 KB |
testcase_13 | AC | 157 ms
95,000 KB |
testcase_14 | AC | 149 ms
91,096 KB |
testcase_15 | AC | 149 ms
92,476 KB |
testcase_16 | AC | 157 ms
98,328 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()) if N == 2: print(*[3, 1]) exit() if N % 3 == 0: ans = [3, 2, 2] for i in range(N-3): ans.append(1) print(*ans) elif N % 3 == 1: ans = [3, 1, 2] for i in range(N-3): ans.append(1) print(*ans) else: ans = [3, 1, 1] for i in range(N-3): ans.append(1) print(*ans) if __name__ == '__main__': main()