[SW Expert Academy] 영준이와 신비한 뿔의 숲 (D3)

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

SW Expert Academy

 

import java.util.Scanner;

class Solution {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();
		
		for(int tc=1;tc<=t;tc++) {
			int n = sc.nextInt();
			int m = sc.nextInt();
			
			int twin = n-m;
			int uni = m-twin;
			
			System.out.println("#"+tc+" "+uni+" "+twin);
		}
		
	}
}

 

트윈혼 1개가 뿔 2개를 가지는 것을 활용해

연립방정식으로 풀었다.