Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- #include <vector>
- #include <algorithm>
- #include <stdio.h>
- using namespace std;
- int main() {
- ifstream fin("input.txt");
- ofstream fout("output.txt");
- int n;
- cin >> n;
- vector<vector<double>> dp(n+1, vector<double>(3));
- dp[0][0] = 100;
- double dol, eu;
- for (int i = 1; i <= n; i++) {
- cin >> dol >> eu;
- dp[i][0] = max(dp[i - 1][0], max(dp[i - 1][1] * dol, dp[i - 1][2] * eu));
- dp[i][1] = max(dp[i][0] / dol, dp[i-1][1]);
- dp[i][2] = max(dp[i][0] / eu, dp[i - 1][2]);
- }
- /*cout.precision(2);
- cout << max(dp[n][0], max(dp[n][1] * dol, dp[n][2] * eu)) << endl;*/
- printf("%.2f", max(dp[n][0], max(dp[n][1] * dol, dp[n][2] * eu)));
- fin.close();
- fout.close();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment