aboutsummaryrefslogtreecommitdiff
path: root/2024/src/day07.cpp
blob: 663e077bcda04a4ff0b522c97170555fe439007c (plain)
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
#include <fstream>
#include <iostream>
#include <sstream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;

vector<tuple<long, vector<long>>>
read_file(string_view filename)
{
	fstream input{ filename };

	vector<tuple<long, vector<long>>> data;
	for ( string line; getline(input, line); ) {
		auto pos = line.find(':');

		stringstream str{ line.substr(pos + 1) };
		data.emplace_back(stol(line.substr(0, pos)), vector<long>{ istream_iterator<long>{ str }, {} });
	}
	return data;
}

bool
can_evaluated(long first, const vector<long>& values)
{
	for ( unsigned long pattern = 0; pattern != (1U << (values.size() - 1)); ++pattern ) {
		long result = values.at(0);
		for ( size_t idx = 1; idx < values.size(); ++idx ) {
			if ( (pattern & (1U << (idx - 1))) == 0 ) {
				result += values.at(idx);
			}
			else {
				result *= values.at(idx);
			}
		}
		if ( first == result ) {
			return true;
		}
	}
	return false;
}

void
part1(const vector<tuple<long, vector<long>>>& data)
{
	long sum = 0;
	for ( const auto& [first, values]: data ) {
		if ( can_evaluated(first, values) ) {
			sum += first;
		}
	}
	cout << sum << endl;
}

size_t
ipow(size_t base, size_t exp) // NOLINT
{
	size_t result = 1;
	while ( exp != 0 ) {
		if ( (exp & 1U) == 1 ) {
			result *= base;
		}
		exp >>= 1U;
		base *= base;
	}

	return result;
}

bool
can_evaluated2(long first, const vector<long>& values)
{
	const auto N = ipow(3, values.size() - 1); // NOLINT

	for ( unsigned long pattern = 0; pattern != N; ++pattern ) {
		auto test_pattern = pattern;

		long result = values.at(0);
		for ( size_t idx = 1; idx < values.size(); ++idx ) {
			auto rem = test_pattern % 3;

			if ( rem == 0 ) {
				result += values.at(idx);
			}
			else if ( rem == 1 ) {
				result *= values.at(idx);
			}
			else {
				result = stol(to_string(result) + to_string(values.at(idx)));
			}

			test_pattern /= 3;
		}
		if ( first == result ) {
			return true;
		}
	}
	return false;
}

void
part2(const vector<tuple<long, vector<long>>>& data)
{
	long sum = 0;
	for ( const auto& [first, values]: data ) {
		if ( can_evaluated2(first, values) ) {
			sum += first;
		}
	}
	cout << sum << endl;
}

int
main()
{
	auto data = read_file("data/day07.txt");

	part1(data);
	part2(data);
}