[백준] 숫자 카드 놀이 20915 python 풀이

https://www.acmicpc.net/problem/20915

핵심

정리중....

나눠진 두수는

import sys
input = sys.stdin.readline


def solve(num_str):
    a = num_str[0]
    b = num_str[1]

    for i in range(2, len(num_str)):
        if int(a) < int(b):
            a += num_str[i]
        else:
            b += num_str[i]
    return int(a) * int(b)

t = int(input())
for _ in range(t):
    num_str = input().strip()
    num_str = num_str.replace('6', '9')
    num_str = sorted(num_str, key=lambda x:int(x), reverse=True)
    print(solve(num_str))요