Submission #3013279

---

Source Code Expand

#include<stdio.h>
#include<iostream>
#include<string>
#include<math.h>
#include<cmath>
#include<algorithm>
#include<map>
#include<queue>
#include<stack>
#include<vector>
#include<time.h>
#include<ctime>
#include<functional>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int inf = 1000000000;
template<typename T>
T GCD(T a, T b) {
	while (max(a, b) % min(a, b)) {
		if (a > b)a = a % b;
		else b = b % a;
	}
	return min(a, b);
}
template<typename T>
T LCM(T a, T b) {
	return a / GCD(a, b)*b;
}
bool prime(ll a) {
	for (int i = 2; i <= sqrt(a); i++) {
		if (!(a%i))return false;
	}
	return true;
}
int main() {
	ll n, c[510], s[510], f[510];
	cin >> n;
	for (int i = 1; i < n; i++)cin >> c[i] >> s[i] >> f[i];
	for (int i = 1; i <= n; i++) {
		ll time = 0;
		for (int j = i; j < n; j++) {
			if (time <= s[j]) {
				time = s[j] + c[j];
			}
			else time = (time + f[j] - 1) / f[j] * f[j] + c[j];
		}
		cout << time << endl;
	}
	return 0;
}

Submission Info

Judge Result