Jonathan Chan
|
f326fd7c77
|
Problem 87
|
2018-09-01 11:06:47 -07:00 |
Jonathan Chan
|
1d8678eeb5
|
Problem 87 attempt
|
2018-08-26 23:38:26 -07:00 |
Jonathan Chan
|
72811cbcd3
|
Style changes to primes
|
2018-08-26 23:38:09 -07:00 |
Jonathan Chan
|
373792c113
|
Problem 86
|
2018-08-25 10:38:06 -07:00 |
Jonathan Chan
|
df4952ecb4
|
Problem 85
|
2018-08-24 23:41:53 -07:00 |
Jonathan Chan
|
e590e70f36
|
Problem 84 - The problem was in the double rolls! You go to jail only if you roll three CONSECUTIVE doubles.
Also printing the top three squares was setting entries to 0 prematurely.
|
2018-08-24 22:18:21 -07:00 |
Jonathan Chan
|
c50425679e
|
Problem 84 - improved random number for dice, but it's still wrong :(
|
2018-08-24 21:23:37 -07:00 |
Jonathan Chan
|
9f101e40d4
|
Problem 84 - refactored, still broken
|
2018-08-23 09:51:57 -07:00 |
Jonathan Chan
|
7f9c636489
|
Problem 84 - not working yet
|
2018-08-23 08:59:03 -07:00 |
Jonathan Chan
|
3d54dd0191
|
Problem 83
|
2018-08-22 17:08:27 -07:00 |
Jonathan Chan
|
bc0437b9e0
|
Trying problem 83 again...
|
2018-08-22 09:31:21 -07:00 |
Jonathan Chan
|
c0292d1a34
|
Problem 83: Almost there...
|
2017-10-23 22:47:05 -07:00 |
Jonathan Chan
|
d09a6587ff
|
Problem 83: Partially implemented priority queue implementation of Dijkstra's for finding shortest path.
|
2017-10-23 20:45:38 -07:00 |
Jonathan Chan
|
5a49c8845f
|
Problem 83: technically correct solution, but very slow...
|
2017-08-17 22:29:21 -07:00 |
Jonathan Chan
|
3a3dcc70eb
|
Partial progress for Problem 83.
|
2017-08-17 07:50:35 -07:00 |
Jonathan Chan
|
bbffcd4141
|
Partial progress for Problem 83.
|
2017-08-17 00:25:52 -07:00 |
Jonathan Chan
|
625fbab502
|
Problem 82
|
2017-08-13 12:39:40 -07:00 |
Jonathan Chan
|
9b421d71bf
|
Problem 81
|
2017-08-13 11:21:21 -07:00 |
Jonathan Chan
|
6d6afbb43c
|
Problem 80
|
2017-08-12 23:48:14 -07:00 |
Jonathan Chan
|
546d8f5ffe
|
Problem 78 (two solutions ― 78 uses recursion and takes too long, 78_alt uses a recursive function for the partition function that relies on generalized pentagonal numbers); Problem 79 done by hand.
|
2017-07-16 11:18:54 -07:00 |
Jonathan Chan
|
29716fee83
|
Problem 77
|
2017-07-15 18:02:12 -07:00 |
Jonathan Chan
|
423fa87d47
|
Problem 76
|
2017-07-15 12:36:57 -07:00 |
Jonathan Chan
|
61132376f0
|
Problem 75
|
2017-07-15 08:58:42 -07:00 |
Jonathan Chan
|
68f0bc6cb8
|
Finished Problem 74; added alternate solution without Map just to compare runtimes
|
2017-07-13 11:52:55 -07:00 |
Jonathan Chan
|
5cb3ece8bb
|
Another attempt at problem 74
|
2017-07-10 14:39:39 -07:00 |
Jonathan Chan
|
fb20034581
|
Partial progress for problem 74
|
2017-07-04 17:39:44 -07:00 |
Jonathan Chan
|
47496fe020
|
Problem 73
|
2017-07-03 12:32:56 -07:00 |
Jonathan Chan
|
9efc3acd17
|
Problem 72
|
2017-07-03 10:51:27 -07:00 |
Jonathan Chan
|
33a0bdc69f
|
Problem 71
|
2017-07-03 08:54:52 -07:00 |
Jonathan Chan
|
e815bd6ceb
|
Problem 70
|
2017-07-03 01:43:31 -07:00 |
Jonathan Chan
|
868573fe49
|
Problem 69
|
2017-07-02 22:57:36 -07:00 |
Jonathan Chan
|
c69bcaba49
|
Problem 68 (explanation; no computation required)
|
2017-07-02 13:44:17 -07:00 |
Jonathan Chan
|
387fe55820
|
Problem 67
|
2017-06-10 17:23:48 -07:00 |
Jonathan Chan
|
43a034fca6
|
Problem 66
|
2017-06-10 16:08:29 -07:00 |
Jonathan Chan
|
2a8a035b72
|
Problem 65
|
2017-06-04 23:43:02 -07:00 |
Jonathan Chan
|
facd95edfd
|
Problem 64
|
2017-06-04 21:43:00 -07:00 |
Jonathan Chan
|
0f93c61e91
|
Renamed all single-digit files to lead with 0
|
2017-05-28 22:07:56 -07:00 |
Jonathan Chan
|
b6b1b2c91a
|
Problem 63
|
2017-05-28 22:00:17 -07:00 |
Jonathan Chan
|
f561cc33c3
|
Problem 62
|
2017-05-28 20:48:33 -07:00 |
Jonathan Chan
|
768237c43e
|
Problem 60 alt attempt
|
2017-05-28 20:23:39 -07:00 |
Jonathan Chan
|
0b072a1efe
|
Problem 61
|
2017-05-28 19:38:56 -07:00 |
Jonathan Chan
|
ec4d03be17
|
Problem 60 (alternative attempt with prime pairs)
|
2017-05-17 23:40:44 -07:00 |
Jonathan Chan
|
53bca2b2d6
|
Problem 60
|
2017-05-15 23:08:33 -07:00 |
Jonathan Chan
|
9ffa46156f
|
Problem 59: Used Python to find number of characters, used C to manually iterate through possible keys. Since all possible keys yield a punctuation mark as the first character, the key must begin with 'g' to give '(' as the first character; the second character must be a capital letter; and so forth.
|
2016-12-26 15:24:24 -08:00 |
Jonathan Chan
|
488ba4cfd2
|
Problem 58
|
2016-12-26 14:20:12 -08:00 |
Jonathan Chan
|
27ae417e11
|
Problem 57 (with incorrect version (due to limitatations of size of long double) in C).
|
2016-12-26 13:40:40 -08:00 |
Jonathan Chan
|
27cae54601
|
Problem 56
|
2016-12-26 11:58:27 -08:00 |
Jonathan Chan
|
e2dfc54f9a
|
Problem 55
|
2016-12-25 23:22:45 -08:00 |
Jonathan Chan
|
d90bcf65e0
|
Problem 54
|
2016-12-24 16:31:57 -08:00 |
Jonathan Chan
|
0d4491d68a
|
Problem 53
|
2016-12-23 17:34:44 -08:00 |