-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.cpp
131 lines (103 loc) · 3.45 KB
/
main.cpp
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
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
//#include "Days/Day01Challenge1.hpp"
//#include "Days/Day01Challenge2.hpp"
//#include "Days/Day02Challenge1.hpp"
//#include "Days/Day02Challenge2.hpp"
//#include "Days/Day03Challenge1.hpp"
//#include "Days/Day03Challenge2.hpp"
//#include "Days/Day04Challenge1.hpp"
//#include "Days/Day04Challenge2.hpp"
//#include "Days/Day05Challenge1.hpp"
//#include "Days/Day05Challenge2.hpp"
//#include "Days/Day06Challenge1.hpp"
//#include "Days/Day06Challenge2.hpp"
//#include "Days/Day07Challenge1.hpp"
//#include "Days/Day07Challenge2.hpp"
//#include "Days/Day08Challenge1.hpp"
//#include "Days/Day08Challenge2.hpp"
//#include "Days/Day09Challenge1.hpp"
//#include "Days/Day09Challenge2.hpp"
//#include "Days/Day10Challenge1.hpp"
//#include "Days/Day10Challenge2.hpp"
//#include "Days/Day11Challenge1.hpp"
#include "Days/Day11Challenge2.hpp"
#include <iostream>
#include <string>
#include <memory>
#include <algorithm>
#include <tuple>
#include <array>
int main()
{
//Day 1
//Challenge 1
// auto day01Chal01 = std::make_unique<Day01Challenge1>();
// day01Chal01->Execute();
//Challenge 2
// auto day01Chal02 = std::make_unique<Day01Challenge2>();
// day01Chal02->Execute();
//Day 2
//Challenge 1
//auto day02Chal01 = std::make_unique<Day02Challenge1>();
//day02Chal01->Execute();
//Challenge 2
//auto day02Chal02 = std::make_unique<Day02Challenge2>();
//day02Chal02->Execute();
//Day 3
//Challenge 1
//auto day03Chal01 = std::make_unique<Day03Challenge1>();
//day03Chal01->Execute();
//Challenge 2
//auto day03Chal02 = std::make_unique<Day03Challenge2>();
//day03Chal02->Execute();
//Day 4
//Challenge 1
//auto day04Chal01 = std::make_unique<Day04Challenge1>();
//day04Chal01->Execute();
//Challenge 2
//auto day04Chal02 = std::make_unique<Day04Challenge2>();
//day04Chal02->Execute();
//Day 5
//Challenge 1
//auto day05Chal01 = std::make_unique<Day05Challenge1>();
//day05Chal01->Execute();
//Challenge 2
//auto day05Chal02 = std::make_unique<Day05Challenge2>();
//day05Chal02->Execute();
//Day 6
//Challenge 1
//auto day06Chal01 = std::make_unique<Day06Challenge1>();
//day06Chal01->Execute();
//auto day06Chal02 = std::make_unique<Day06Challenge2>();
//day06Chal02->Execute();
//Day 7
//Challenge 1
//auto day07Chal01 = std::make_unique<Day07Challenge1>();
//day07Chal01->Execute();
//auto day07Chal02 = std::make_unique<Day07Challenge2>();
//day07Chal02->Execute();
//Day 8
//Challenge 1
//auto day08Chal01 = std::make_unique<Day08Challenge1>();
//day08Chal01->Execute();
//auto day08Chal02 = std::make_unique<Day08Challenge2>();
//day08Chal02->Execute();
//Day 9
//Challenge 1
//auto day09Chal01 = std::make_unique<Day09Challenge1>();
//day09Chal01->Execute();
//auto day09Chal02 = std::make_unique<Day09Challenge2>();
//day09Chal02->Execute();
//Day 10
//Challenge 1
//auto day10Chal01 = std::make_unique<Day10Challenge1>();
//day10Chal01->Execute();
//auto day10Chal02 = std::make_unique<Day10Challenge2>();
//day10Chal02->Execute(); -- Not Completed , look more into dynamic programming
//Day 11
//Challenge 1
//auto day11Chal01 = std::make_unique<Day11Challenge1>();
//day11Chal01->Execute();
auto day11Chal02 = std::make_unique<Day11Challenge2>();
day11Chal02->Execute();
return 0; // result unused?
}