SPOJ: COINS – Bytelandian gold coins

Problem Link http://www.spoj.com/problems/COINS/ Problem Description In this problem, We can exchange each coin of value n with three coins of value (n/2),(n/3),(n/4). So, we need to find maximum value we can obtain from a coin of n value. Concepts Used This is a straightforward DP problem. Code #include<bits/stdc++.h> using namespace std; // long long int […]

Continue reading