[SWEA] 3431 : 준환이의 운동관리

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AWE_ZXcqAAMDFAV2&categoryId=AWE_ZXcqAAMDFAV2&categoryType=CODE&problemTitle=&orderBy=INQUERY_COUNT&selectCodeLang=JAVA&select-1=3&pageSize=10&pageIndex=3 

SW Expert Academy

D3는 난이도 차이가 너무 큰 것 같다.

이 문제는 D1 수준임.

 

내 코드

메모리 : 21648 KB

시간 : 130 ms

코드길이 : 928

 

[내 코드]

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

public class Solution {
	static int L;
	static int U;
	static int X;

	public static void main(String[] args) throws IOException{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringBuilder sb = new StringBuilder();
		StringTokenizer st;
		
		int T = Integer.parseInt(br.readLine());
		for(int t = 1; t <= T; t++) {
			sb.append('#').append(t).append(' ');
			st = new StringTokenizer(br.readLine());
			L = Integer.parseInt(st.nextToken());
			U = Integer.parseInt(st.nextToken());
			X = Integer.parseInt(st.nextToken());
			
			sb.append(exercise(L, U, X)).append('\n');
		}
		System.out.print(sb);
	}
	static int exercise(int min, int max, int did) {
		if(did >= max)
			return -1;
		else if(min <= did && did < max)
			return 0;
		else
			return min - did;
	}

}