ionchy
/
projecteuler
1
0
Fork 0
Code

Problem 31

This commit is contained in:
Jonathan Chan 2016-12-02 23:24:38 -08:00
parent 274b965cb5
commit b4ba18c46b
4 changed files with 42 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

BIN
31 Executable file
View File

Binary file not shown.

16
31.c Normal file
View File

@ -0,0 +1,16 @@
#include <stdio.h>
#include <stdlib.h>
int main (int argc, char* argv[]) {
int* ways = calloc (201, sizeof (int));
ways[0] = 1;
int coins[8] = { 1, 2, 5, 10, 20, 50, 100, 200 };
for (int c = 0; c < 8; c++) {
for (int w = 0; w <= 200; w++) {
if (w >= coins[c]) {
ways[w] += ways[w - coins[c]];
}
}
}
printf ("%d\n", ways[200]);
}

BIN
31_brute Executable file
View File

Binary file not shown.

26
31_brute.c Normal file
View File

@ -0,0 +1,26 @@
#include <stdio.h>
#include <stdlib.h>
int main (int argc, char* argv[]) {
int ways = 0;
for (int L2 = 0; L2 <= 1; L2++) {
for (int L1 = 0; L1 <= 2; L1++) {
for (int p50 = 0; p50 <= 4; p50++) {
for (int p20 = 0; p20 <= 10; p20++) {
for (int p10 = 0; p10 <= 20; p10++) {
for (int p5 = 0; p5 <= 40; p5++) {
for (int p2 = 0; p2 <= 100; p2++) {
for (int p1 = 0; p1 <= 200; p1++) {
if (p1 + 2*p2 + 5*p5 + 10*p10 + 20*p20 + 50*p50 + 100*L1 + 200*L2)
ways++;
}
}
}
}
}
}
}
}
printf ("%d\n", ways);
}