|
5f0fdc1736
|
12: Solve in Python
|
2022-12-12 09:56:59 +01:00 |
|
|
87291b54e5
|
11: C: Get LCM by prime factorization
|
2022-12-12 00:13:25 +01:00 |
|
|
05f53d07c8
|
11: Solve in C
|
2022-12-12 00:03:12 +01:00 |
|
|
ba1ca8492d
|
11: Py: Cleanup and avoid eval()
|
2022-12-11 21:47:36 +01:00 |
|
|
0a9f3c078d
|
11: Py: Just use lists to hold items
|
2022-12-11 19:51:34 +01:00 |
|
|
7b51b5820b
|
11: Solve in Python
|
2022-12-11 17:09:55 +01:00 |
|
|
e2ba0de6f8
|
10: Solve in C
|
2022-12-10 20:01:55 +01:00 |
|
|
e1f6dec6c7
|
10: Solve in COBOL
|
2022-12-10 20:01:55 +01:00 |
|
|
668630b712
|
09: Solve in C
|
2022-12-09 16:35:45 +01:00 |
|
|
c35655cd99
|
08: C: Add input visualization (Netpbm P6)
|
2022-12-09 01:57:47 +01:00 |
|
|
922cce3c8d
|
08: Solve in C
|
2022-12-08 12:45:37 +01:00 |
|
|
5bd76d8db7
|
07: C: It’s just DFS so don’t look up dirs
|
2022-12-08 05:28:04 +01:00 |
|
|
c09be6c757
|
07: C: Misc speedups
|
2022-12-08 04:27:28 +01:00 |
|
|
824fe43fe6
|
07: C: Faster number conversion
|
2022-12-08 02:38:36 +01:00 |
|
|
5cb23bf245
|
07: C: Use mmap instead of fgets
|
2022-12-08 02:38:36 +01:00 |
|
|
97294b6cf8
|
07: C: Don’t needlessly strip newline chars
|
2022-12-07 22:58:08 +01:00 |
|
|
3144a5f528
|
07: C: Don’t needlessly store file entries
|
2022-12-07 22:51:26 +01:00 |
|
|
5a1a8bb571
|
07: C: Assume no duplicate ls runs
|
2022-12-07 22:42:09 +01:00 |
|
|
327cbf6d6b
|
07: C: Add target size parameters
|
2022-12-07 22:31:12 +01:00 |
|
|
3e5e62fe7b
|
07: C: Fix some warnings
|
2022-12-07 22:30:30 +01:00 |
|
|
6060b590d3
|
07: C: Hash entries
|
2022-12-07 22:29:46 +01:00 |
|
|
59bf88cb6b
|
07: C: Reduce malloc calls
|
2022-12-07 21:44:06 +01:00 |
|
|
e1d55dda2e
|
07: Solve in C
|
2022-12-07 19:03:14 +01:00 |
|
|
f94c3eb3cb
|
04: C: Optimize
sscanf is a bottleneck
|
2022-12-06 21:41:19 +01:00 |
|
|
cbb0c57d81
|
05: Python: Faster
|
2022-12-06 16:10:45 +01:00 |
|
|
5c8be75eee
|
06: Solve in C
|
2022-12-06 09:06:29 +01:00 |
|
|
63c5701254
|
05: C: Slightly faster
|
2022-12-06 00:09:14 +01:00 |
|
|
af88bca186
|
05: C: ~6x faster implementation
|
2022-12-05 23:45:24 +01:00 |
|
|
f1edb14ad5
|
05: Solve in Python
|
2022-12-05 20:39:04 +01:00 |
|
|
943002f3b7
|
05: C: Just use malloc for the stacks
|
2022-12-05 18:53:09 +01:00 |
|
|
59a0567939
|
04: C: Slightly faster
|
2022-12-05 18:48:24 +01:00 |
|
|
da4d5ef41d
|
05: C: Handle variable-size input without trailing whitespace
|
2022-12-05 18:43:16 +01:00 |
|
|
476b55d7aa
|
05: Solve in C
|
2022-12-05 16:14:51 +01:00 |
|
|
4db64c45ca
|
04: Solve in C
|
2022-12-04 14:54:48 +01:00 |
|
|
83fa5d8bea
|
03: Slightly smaller Python
|
2022-12-04 00:35:13 +01:00 |
|
|
b2a7be43ea
|
03: Solve in C
|
2022-12-03 19:03:40 +01:00 |
|
|
4f8b582364
|
03: Solve in Python
|
2022-12-03 12:21:26 +01:00 |
|
|
f907f0611c
|
02: Solve in C
|
2022-12-02 15:31:24 +01:00 |
|
|
be7fa3b032
|
01: Solve in C and Python
|
2022-12-02 03:11:23 +01:00 |
|