結果
問題 | No.1475 時計の歯車Easy |
ユーザー | McGregorsh |
提出日時 | 2023-05-06 14:40:26 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 155 ms / 2,000 ms |
コード長 | 1,468 bytes |
コンパイル時間 | 203 ms |
コンパイル使用メモリ | 82,428 KB |
実行使用メモリ | 89,724 KB |
最終ジャッジ日時 | 2024-05-03 02:10:01 |
合計ジャッジ時間 | 8,610 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 145 ms
89,576 KB |
testcase_01 | AC | 149 ms
89,140 KB |
testcase_02 | AC | 144 ms
89,496 KB |
testcase_03 | AC | 141 ms
89,352 KB |
testcase_04 | AC | 145 ms
89,452 KB |
testcase_05 | AC | 145 ms
89,576 KB |
testcase_06 | AC | 144 ms
89,572 KB |
testcase_07 | AC | 147 ms
89,136 KB |
testcase_08 | AC | 143 ms
89,192 KB |
testcase_09 | AC | 147 ms
89,716 KB |
testcase_10 | AC | 147 ms
89,200 KB |
testcase_11 | AC | 152 ms
89,524 KB |
testcase_12 | AC | 151 ms
89,404 KB |
testcase_13 | AC | 155 ms
89,188 KB |
testcase_14 | AC | 152 ms
89,484 KB |
testcase_15 | AC | 152 ms
89,576 KB |
testcase_16 | AC | 147 ms
88,924 KB |
testcase_17 | AC | 151 ms
89,044 KB |
testcase_18 | AC | 146 ms
89,116 KB |
testcase_19 | AC | 146 ms
89,512 KB |
testcase_20 | AC | 146 ms
89,196 KB |
testcase_21 | AC | 146 ms
89,292 KB |
testcase_22 | AC | 140 ms
89,264 KB |
testcase_23 | AC | 139 ms
89,340 KB |
testcase_24 | AC | 139 ms
89,724 KB |
testcase_25 | AC | 146 ms
89,548 KB |
testcase_26 | AC | 143 ms
89,124 KB |
testcase_27 | AC | 142 ms
89,152 KB |
testcase_28 | AC | 145 ms
89,664 KB |
testcase_29 | AC | 146 ms
89,532 KB |
testcase_30 | AC | 145 ms
89,588 KB |
testcase_31 | AC | 144 ms
89,248 KB |
testcase_32 | AC | 149 ms
89,364 KB |
testcase_33 | AC | 142 ms
89,504 KB |
testcase_34 | AC | 147 ms
89,568 KB |
testcase_35 | AC | 146 ms
89,524 KB |
testcase_36 | AC | 146 ms
89,184 KB |
testcase_37 | AC | 148 ms
89,720 KB |
testcase_38 | AC | 142 ms
89,208 KB |
testcase_39 | AC | 140 ms
89,188 KB |
testcase_40 | AC | 145 ms
89,048 KB |
testcase_41 | AC | 142 ms
89,124 KB |
testcase_42 | AC | 138 ms
89,524 KB |
testcase_43 | AC | 140 ms
89,296 KB |
testcase_44 | AC | 146 ms
89,548 KB |
testcase_45 | AC | 145 ms
89,176 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()) for i in range(N): A = i_list() B = A[1:] B.sort(reverse=True) print(*B) if __name__ == '__main__': main()