Skip to content

Solution to Euler Project Problem31 #2145

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
danielUTM wants to merge 2 commits into from
Closed

Solution to Euler Project Problem31 #2145

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
27b8f5f
Solution to Euler Project Problem31
danielUTM Mar 15, 2021
19457d2
Fixed formatting
danielUTM Mar 15, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
36 changes: 36 additions & 0 deletions ProjectEuler/Problem31.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,36 @@
package ProjectEuler;

/**
* In the United Kingdom the currency is made up of pound (£) and pence (p). There are eight coins
* in general circulation:
*
* <p>1p, 2p, 5p, 10p, 20p, 50p, £1 (100p), and £2 (200p).
*
* <p>It is possible to make £2 in the following way:
*
* <p>1×£1 + 1×50p + 2×20p + 1×5p + 1×2p + 3×1p
*
* <p>How many different ways can £2 be made using any number of coins?
*
* <p>link: https://projecteuler.net/problem=31
*/
public class Problem31 {
public static void main(String[] args) {
assert solution1() == 1;
}

public static int solution1() {
int target = 200;
int[] coins = {1, 2, 5, 10, 20, 50, 100, 200};
int[] combos = new int[201];
combos[0] = 1;

for (int coin : coins) {
for (int j = coin; j <= target; j++) {
combos[j] += combos[j - coin];
}
}

return combos[200];
}
}