You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
88 lines
2.3 KiB
C++
88 lines
2.3 KiB
C++
2 years ago
|
#include <array>
|
||
|
|
#include <iostream>
|
||
|
|
#include <string>
|
||
|
|
|
||
|
|
int main()
|
||
|
|
{
|
||
|
|
int monkeys[10][100];
|
||
|
|
int ms[10];
|
||
|
|
int ic[10] = {};
|
||
|
|
int idx = -1;
|
||
|
|
std::string im;
|
||
|
|
|
||
|
|
do {
|
||
|
|
std::string line;
|
||
|
|
std::getline(std::cin, line);
|
||
|
|
|
||
|
|
if (!std::cin.eof()) {
|
||
|
|
if (line.starts_with("Monkey")) {
|
||
|
|
++idx;
|
||
|
|
std::cout << "Monkey " << idx << "..." << std::endl;
|
||
|
|
} else if (line.starts_with(" St")) {
|
||
|
|
auto f = line.find_first_of("0123456789");
|
||
|
|
line = line.substr(f);
|
||
|
|
|
||
|
|
im += (char)stoi(line);
|
||
|
|
|
||
|
|
auto g = line.find(',');
|
||
|
|
while (g != std::string::npos) {
|
||
|
|
line = line.substr(g);
|
||
|
|
auto f = line.find_first_of("0123456789");
|
||
|
|
line = line.substr(f);
|
||
|
|
|
||
|
|
im += (char)stoi(line);
|
||
|
|
g = line.find(',');
|
||
|
|
}
|
||
|
|
} else if (line.starts_with(" Op")) {
|
||
|
|
auto f = line.find('=');
|
||
|
|
char o = line[f + 6];
|
||
|
|
char v = line[f + 8] == 'o' ? 0 : stoi(line.substr(f + 8));
|
||
|
|
im = std::string() + v + o + im;
|
||
|
|
} else if (!line.empty()) {
|
||
|
|
auto f = line.find_first_of("0123456789");
|
||
|
|
line = line.substr(f);
|
||
|
|
|
||
|
|
im = std::string() + (char)stoi(line) + im;
|
||
|
|
} else {
|
||
|
|
int i = 0;
|
||
|
|
for (auto c : im)
|
||
|
|
monkeys[idx][i++] = c;
|
||
|
|
ms[idx] = im.size();
|
||
|
|
im.clear();
|
||
|
|
}
|
||
|
|
}
|
||
|
|
} while (!std::cin.eof());
|
||
|
|
|
||
|
|
for (int R = 0; R < 20; ++R) {
|
||
|
|
|
||
|
|
for (int i = 0; i <= idx; ++i) {
|
||
|
|
auto s = monkeys[i];
|
||
|
|
for (int j = 5; j < ms[i]; ++j) {
|
||
|
|
int worry = s[j];
|
||
|
|
|
||
|
|
int o = s[3] != 0 ? s[3] : worry;
|
||
|
|
if (s[4] == '*')
|
||
|
|
worry *= o;
|
||
|
|
else if (s[4] == '+')
|
||
|
|
worry += o;
|
||
|
|
|
||
|
|
worry /= 3;
|
||
|
|
|
||
|
|
int d = worry / s[2];
|
||
|
|
int k = worry == d * s[2] ? s[1] : s[0];
|
||
|
|
monkeys[k][ms[k]++] = worry;
|
||
|
|
}
|
||
|
|
ic[i] += ms[i] - 5;
|
||
|
|
ms[i] = 5;
|
||
|
|
}
|
||
|
|
|
||
|
|
}
|
||
|
|
|
||
|
|
for (int q = 0; q <= idx; ++q) {
|
||
|
|
std::cout << ic[q] << std::endl;
|
||
|
|
}
|
||
|
|
|
||
|
|
return 0;
|
||
|
|
}
|
||
|
|
|