aboutsummaryrefslogtreecommitdiff
path: root/src/2022/day21/aoc.h
blob: ca5d6a3becd5198a3c0d8df8f557cf820a8927b1 (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
#include "common.h"
#include <vector>
#include <iostream>
#include <stdint.h>

namespace aoc2022 {

enum oper {
  add,
  minus,
  multiply,
  division,
  none,
};

struct monkey_math {
  line_view op[3];
  oper todo;
  int64_t value = 0;

  void print() const noexcept {
    std::cout << op[0] << ": ";
    if (todo == none) {
      printf("%ld", value);
    }
    else {
      char ops[] = {'+', '-', '*', '/'};
      std::cout << op[1];
      printf(" %c ", ops[(int) todo]);
      std::cout << op[2];
    }
    printf("\n");
  }
  
  monkey_math() = default;
  monkey_math(line_view lv) {
    const char* p = lv.line;
    op[0] = {p, 4};

    if (*(p + 6) >= '0' && *(p + 6) <= '9') {
      const char* p0 = p + 6;
      while (*p0 >= '0' && *p0 <= '9') {
        value = value * 10 + *p0 - '0';
        p0++;
      }
      todo = none;
    } else {
      value = INT64_MAX;
      op[1] = {p + 6, 4};
      op[2] = {p + 13, 4};
      switch (*(p + 11)) {
      case '+':
        todo = add;
        break;
      case '-':
        todo = minus;
        break;
      case '*':
        todo = multiply;
        break;
      case '/':
        todo = division;
        break;
      }
    }
  }
};

std::pair<int64_t, int64_t> day21(line_view);
} // namespace aoc2022