(SWEA c++)3142. 영준이와 신비한 뿔의 숲

swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV_6xWk6sbADFAWS&categoryId=AV_6xWk6sbADFAWS&categoryType=CODE

SW Expert Academy

 

연립방정식을 이용하면 간단하게 풀 수 있는 문제

#include <iostream>

using namespace std;

int main(void)
{
    int t;
    cin >> t;
    
    for(int tc = 1; tc <= t; tc++)
    {
        int N, M, ans1 = 0, ans2 = 0;
        cin >> N >> M;
        
        ans2 = N - M;
        ans1 = (2 * M) - N;
        
        cout << "#" << tc << " " << ans1 << " " << ans2 << endl;
    }
    return 0;
}