[Python] codeforces #651 A. Maximum GCD

작성일 2020-06-28 | In Algorithm |

A. Maximum GCD

문제 링크

https://codeforces.com/problemset/problem/1370/A

풀이 코드

# A. Maximum GCD


import sys
input = sys.stdin.readline

t = int(input())
for i in range(t):
    n = int(input())
    if n == 1:
        print(1)
    elif n % 2 == 1:
        print((n-1)//2)
    else:
        print(n//2)

비고