백준 16769 Mixing Milk (USACO December 2018 Bronze 1번)

문제 링크: https://www.acmicpc.net/problem/16769

16769번: Mixing Milk

#include <bits/stdc++.h>
using namespace std;
 
int c[3], m[3];
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
 
    for(int i = 0; i < 3; i++) cin >> c[i] >> m[i];
 
    for(int i = 0; i < 100; i++) {
        int cur = i % 3, nxt = (i + 1) % 3;
        int tmp = m[cur];
        m[cur] = max(0, m[cur] - (c[nxt] - m[nxt]));
        m[nxt] = min(c[nxt], tmp + m[nxt]);
    }
 
    for(int i = 0; i < 3; i++)
        cout << m[i] << '\n';
    return 0;
}