Submission #10232739

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;

const int N = 510;
const double eps = 1e-6;

int n;
int c[N], s[N], f[N];

int main()
{
    cin >> n;
    for(int i = 1; i < n; i++) cin >> c[i] >> s[i] >> f[i];

    for(int i = 1; i <= n; i++)
    {
        int sum = 0;
        for(int j = i; j < n; j++)
        {
            sum = max(sum, s[j]);
            sum = (sum + f[j] - 1) / f[j] * f[j] + c[j];
        }
        cout << sum << endl;
    }
    return 0;
}

Submission Info

Judge Result