bert/adventofcode
1
0
Fork 0
mirror of https://github.com/bertptrs/adventofcode.git synced 2025-12-26 05:10:32 +01:00
Code Issues Projects Releases Wiki Activity

Prepare all days skeletons.

Browse Source
This commit is contained in:
Bert Peters
2019-11-28 08:00:46 +01:00
parent 5b91fd4da3
commit e9bf399af4
37 changed files with 321 additions and 49 deletions
Download Patch File Download Diff File Expand all files Collapse all files

31
2019/src/day01.cpp
View File

@@ -1,35 +1,10 @@
#include <numeric>
#include <iterator>
#include <vector>
#include <unordered_set>
#include <iostream>
#include "days.hpp"
// Currently an implementation of 2018 day 1
void aoc2019::day01_part1(std::istream &input, std::ostream &output) {
int sum = std::accumulate(std::istream_iterator<int>(input),
std::istream_iterator<int>(),
0);
output << sum << std::endl;
output << "Not implemented\n";
}
void aoc2019::day01_part2(std::istream &input, std::ostream &output) {
std::vector<int> drifts;
std::copy(std::istream_iterator<int>(input),
std::istream_iterator<int>(),
std::back_inserter(drifts));
int cur = 0;
std::unordered_set<int> seen{cur};
while (true) {
for (auto drift : drifts) {
cur += drift;
if (seen.count(cur) == 1) {
output << cur << std::endl;
return;
} else {
seen.insert(cur);
}
}
}
output << "Not implemented\n";
}