Week2 - Simple DP

#include<iostream>
#include<vector>

using namespace std;

int main() {
	int n;
	vector<long long> fib;
	cin >> n;

	fib.assign(n+1, 0);
	fib[1] = 1;

	for (int i = 2; i <= n; i++) {
		fib[i] = fib[i - 1] + fib[i - 2];
	}

	cout << fib[n];
}

#include<iostream>

using namespace std;

int main() {
	int n;
	int cnt[1001] = { 0 };
	cin >> n;

	cnt[0] = 1;
	cnt[1] = 1;

	for (int i = 2; i <= n; i++) {
		cnt[i] = (cnt[i - 1] + cnt[i - 2] * 2) % 10007;
	}

	cout << cnt[n];
}

#include<iostream>

using namespace std;

int min(int a, int b) {
	return ((a < b) ? a : b);
}

int main() {
	int n;
	int stacked_cost[3] = { 0 };
	cin >> n;

	for (int i = 0; i < n; i++) {
		int cur_cost[3];

		for (int j = 0; j < 3; j++) {
			cin >> cur_cost[j];

			int prev_min_cost = INT32_MAX;
			for (int k = 0; k < 3; k++) {
				if ((j != k) && (prev_min_cost > stacked_cost[k])) prev_min_cost = stacked_cost[k];
			}

			cur_cost[j] += prev_min_cost;
		}

		for (int j = 0; j < 3; j++) {
			stacked_cost[j] = cur_cost[j];
		}
	}

	cout << min(stacked_cost[0], min(stacked_cost[1], stacked_cost[2]));
}

#include<iostream>

using namespace std;

int min(int a, int b) {
	return (a < b) ? a : b;
}

int main() {
	int n;
	int cost[1001][3];
	cin >> n;

	for (int i = 0; i < 3; i++) {
		cin >> cost[1][i];
	}

	for (int i = 2; i <= n; i++) {
		for (int j = 0; j < 3; j++) {
			cin >> cost[i][j];
		}
		cost[i][0] += min(cost[i - 1][1], cost[i - 1][2]);
		cost[i][1] += min(cost[i - 1][0], cost[i - 1][2]);
		cost[i][2] += min(cost[i - 1][0], cost[i - 1][1]);
	}

	cout << min(cost[n][0], min(cost[n][1], cost[n][2]));
}