백준 3060번 욕심쟁이 돼지 C++

https://www.acmicpc.net/problem/3060

3060번: 욕심쟁이 돼지

 

#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <utility>
#include <stack>
#include <queue>
#include <math.h>
#include <set>
#include <map>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <limits.h>

using namespace std;
using int64 = long long;

vector<int64> lastV(6);
vector<int64> currV(6);

int t;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    cin >> t;
    while (t--) {
        int64 n;
        cin >> n;
        for (int i = 0; i < 6; i++) cin >> lastV[i];
        int day = 1;
        while (true) {
            int64 sum = 0;
            for (int i = 0; i < 6; i++) sum += lastV[i];
            if (sum > n) break;
            for (int i = 0; i < 6; i++) {
                int64 currVal = lastV[i];
                currVal += lastV[(i + 1) % 6];
                currVal += lastV[(i + 3) % 6];
                currVal += lastV[(i + 5) % 6];
                currV[i] = currVal;
            }
            for (int i = 0; i < 6; i++) lastV[i] = currV[i];
            day++;
        }
        cout << day << "\n";
    }
}