結果
問題 | No.750 Frac #1 |
ユーザー | McGregorsh |
提出日時 | 2023-04-10 11:39:15 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 146 ms / 1,000 ms |
コード長 | 1,559 bytes |
コンパイル時間 | 245 ms |
コンパイル使用メモリ | 82,436 KB |
実行使用メモリ | 89,708 KB |
最終ジャッジ日時 | 2024-04-15 17:58:26 |
合計ジャッジ時間 | 6,109 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 141 ms
89,496 KB |
testcase_01 | AC | 140 ms
89,676 KB |
testcase_02 | AC | 142 ms
89,544 KB |
testcase_03 | AC | 142 ms
89,392 KB |
testcase_04 | AC | 142 ms
89,636 KB |
testcase_05 | AC | 139 ms
89,296 KB |
testcase_06 | AC | 139 ms
89,636 KB |
testcase_07 | AC | 140 ms
89,600 KB |
testcase_08 | AC | 142 ms
89,508 KB |
testcase_09 | AC | 141 ms
89,352 KB |
testcase_10 | AC | 140 ms
89,368 KB |
testcase_11 | AC | 139 ms
89,508 KB |
testcase_12 | AC | 140 ms
89,448 KB |
testcase_13 | AC | 139 ms
89,528 KB |
testcase_14 | AC | 142 ms
89,520 KB |
testcase_15 | AC | 143 ms
89,612 KB |
testcase_16 | AC | 141 ms
89,412 KB |
testcase_17 | AC | 140 ms
89,540 KB |
testcase_18 | AC | 138 ms
89,424 KB |
testcase_19 | AC | 139 ms
89,708 KB |
testcase_20 | AC | 137 ms
89,592 KB |
testcase_21 | AC | 139 ms
89,568 KB |
testcase_22 | AC | 139 ms
89,524 KB |
testcase_23 | AC | 141 ms
89,296 KB |
testcase_24 | AC | 140 ms
89,560 KB |
testcase_25 | AC | 141 ms
89,588 KB |
testcase_26 | AC | 139 ms
89,444 KB |
testcase_27 | AC | 140 ms
89,568 KB |
testcase_28 | AC | 138 ms
89,036 KB |
testcase_29 | AC | 143 ms
89,532 KB |
testcase_30 | AC | 139 ms
89,520 KB |
testcase_31 | AC | 146 ms
89,504 KB |
testcase_32 | AC | 137 ms
89,480 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()) nums = [] for i in range(N): a, b = i_map() nums.append([a/b, a, b]) nums.sort(reverse=True) for i in range(N): a, b = nums[i][1:] print(a, b) if __name__ == '__main__': main()