[BAEKJOON] 16099 Larger Sport Facility

문제 요약

• 알고리즘 분류: 구현
• 난이도: Bronze5
• 문제내용
  • 각 케이스와 2팀 가로,  세로 길이준다. TelecomParisTech, Eurecom  중 면적이 더 큰것 출력한다.
  • 만약 동점이면 Tie 출력한다.

Code

Python

for _ in range(int(input())):
    lv, wv, le, we = map(int, input().split())
    if(lv * wv == le * we) : print("Tie")
    elif(lv * wv > le * we): print("TelecomParisTech")
    else: print("Eurecom")

Java

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class Main {
	
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int N = Integer.parseInt(br.readLine());
		StringTokenizer st;
		long lv, wv, le, we;
		while(N-- > 0) {
			st = new StringTokenizer(br.readLine());
			lv = Long.parseLong(st.nextToken());
			wv = Long.parseLong(st.nextToken());
			le = Long.parseLong(st.nextToken());
			we = Long.parseLong(st.nextToken());
			if(lv * wv == le * we) {
				System.out.println("Tie");
			}else if(lv * wv > le * we) {
				System.out.println("TelecomParisTech");
			}else {
				System.out.println("Eurecom");
			}
			
		}
	}
	
}