-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDayOne.h
40 lines (31 loc) · 991 Bytes
/
DayOne.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
#ifndef DAY_ONE_H
#define DAY_ONE_H
#include "Elf.h"
namespace AdventOfCode::DayOne {
using Input = std::vector<Elf>;
/**
* Generate solutions for both puzzles and print the output to stdout.
*/
auto run() -> void;
/**
* Returns the output for day one puzzle one.
*/
auto puzzleOneSolution(const Input &input) -> int;
/**
* Returns the answer for day one puzzle one without storing parsed Elf data.
*/
auto puzzleOneSolutionWithoutStorage() -> int;
/**
* Returns the answer for day one puzzle two.
*/
auto puzzleTwoSolution(const Input &input) -> int;
/**
* Simplest possible implementation of puzzle one that generates the correct answer. Used as a baseline for
* benchmarking.
*
* @param input parsed input for day one
* @return answer for day one puzzle one
*/
auto puzzleOneSolutionStrawman(const Input &input) -> int;
} // AdventOfCode::DayOne
#endif // DAY_ONE_H