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
|
#include <algorithm>
#include <fstream>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
void
part1()
{
string digits{ "0123456789" };
fstream input{ "data/day01.txt" };
int sum = 0;
for ( string line; input >> line; ) {
auto first = find_first_of(begin(line), end(line), begin(digits), end(digits));
auto last = find_first_of(rbegin(line), rend(line), begin(digits), end(digits));
auto value = (*first - '0') * 10 + (*last - '0');
sum += value;
}
cout << sum << endl;
}
void
part2()
{
map<string, int> map{
{ "0", 0 },
{ "1", 1 },
{ "2", 2 },
{ "3", 3 },
{ "4", 4 },
{ "5", 5 },
{ "6", 6 },
{ "7", 7 },
{ "8", 8 },
{ "9", 9 },
{ "one", 1 },
{ "two", 2 },
{ "three", 3 },
{ "four", 4 },
{ "five", 5 },
{ "six", 6 },
{ "seven", 7 },
{ "eight", 8 },
{ "nine", 9 },
};
fstream input{ "data/day01.txt" };
auto sum = 0;
for ( string line; input >> line; ) {
string sub;
vector<int> digits;
for ( auto ch: line ) {
sub += ch;
for ( const auto& word: map ) {
if ( sub.ends_with(word.first) ) {
digits.push_back(word.second);
}
}
}
auto first = digits.front();
auto last = digits.back();
sum += (first * 10) + last;
}
cout << sum << endl;
}
int
main()
{
part1();
part2();
}
|
