2845번, 2914번, 3003번

#include <iostream>
using namespace std;

int main(void)
{   
    int L,M,a,b,c,d,e;
    cin >> L >> M;
    cin >> a >> b >> c >> d >> e;
    int count = L * M;
    cout << a - count << " " <<
        b - count << " " << 
        c - count << " " <<
        d - count << " " <<
        e - count;

    return 0;
}

2845번

 

#include <iostream>
using namespace std;
int main()
{
    int a,b;
    cin >> a >> b;
    cout << a * (b - 1) + 1;
    return 0;
}

2914번

 

#include <iostream>
using namespace std;
//킹 1개, 퀸 1개, 룩 2개, 비숍 2개, 나이트 2개, 폰 8개
int chess[] = {1,1,2,2,2,8};

int main(void)
{
    int a;
    for(int i = 0; i < 6; ++i)
    {
        cin >> a;
        chess[i] -= a;
    }
    for(int i = 0; i < 6; ++i)
    {
        cout << chess[i] << " ";
    }
    return 0;
}