PoliEcho/advent-of-code-2024
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Compare commits

base: PoliEcho:7a7281253225ce7465c2f59d9240363b0fd615eb
Branches Tags
PoliEcho:main
..
compare: PoliEcho:07af61effb2a03025adfe7411a4b61a584a2f734
Branches Tags
PoliEcho:main

No commits in common. "7a7281253225ce7465c2f59d9240363b0fd615eb" and "07af61effb2a03025adfe7411a4b61a584a2f734" have entirely different histories.
7a72812532 ... 07af61effb

4 changed files with 0 additions and 309 deletions
Show Stats Expand all files Collapse all files

149
day4/day.cpp
View File

@ -1,149 +0,0 @@
#include <asm-generic/errno.h>
#include <cstdlib>
#include <errno.h>
#include <fstream>
#include <iostream>
#include <vector>
bool AreWeInBounds(int i, int j, std::vector<std::vector<char>> &wordsearch) {
if (i < 0 || j < 0) {
return false;
}
if (i >= wordsearch.size() || j >= wordsearch[i].size()) {
return false;
}
return true;
}
int conditional_operation(int a, int b, char op) {
switch (op) {
case '+':
return a + b;
case '-':
return a - b;
default:
return a;
}
}
int Check(std::vector<std::vector<char>> &wordsearch, int i, int j) {
int xmases = 0;
char op_i;
char op_j;
for (int w = 0; w < 8; w++) {
switch (w) {
case 0:
// search right
op_i = 'n';
op_j = '+';
if (!AreWeInBounds(i, j + 3, wordsearch)) {
continue;
}
break;
case 1:
// search left
op_i = 'n';
op_j = '-';
if (!AreWeInBounds(i, j - 3, wordsearch)) {
continue;
}
break;
case 2:
// search up
op_i = '-';
op_j = 'n';
if (!AreWeInBounds(i - 3, j, wordsearch)) {
continue;
}
break;
case 3:
// search down
op_i = '+';
op_j = 'n';
if (!AreWeInBounds(i + 3, j, wordsearch)) {
continue;
}
break;
case 4:
// search up-right
op_i = '-';
op_j = '+';
if (!AreWeInBounds(i - 3, j + 3, wordsearch)) {
continue;
}
break;
case 5:
// search up-left
op_i = '-';
op_j = '-';
if (!AreWeInBounds(i - 3, j - 3, wordsearch)) {
continue;
}
break;
case 6:
// search down-right
op_i = '+';
op_j = '+';
if (!AreWeInBounds(i + 3, j + 3, wordsearch)) {
continue;
}
break;
case 7:
// search down-left
op_i = '+';
op_j = '-';
if (!AreWeInBounds(i + 3, j - 3, wordsearch)) {
continue;
}
break;
default:
std::cerr << "How did we get here?" << std::endl;
exit(255);
break;
}
if (wordsearch[i][j] == 'X') {
if (wordsearch[conditional_operation(i, 1, op_i)]
[conditional_operation(j, 1, op_j)] == 'M') {
if (wordsearch[conditional_operation(i, 2, op_i)]
[conditional_operation(j, 2, op_j)] == 'A') {
if (wordsearch[conditional_operation(i, 3, op_i)]
[conditional_operation(j, 3, op_j)] == 'S') {
xmases++;
}
}
}
}
}
return xmases;
}
int main() {
std::ifstream inputfile("input");
std::string input;
int res = 0;
if (!inputfile.is_open()) {
std::cerr << "Could not open the file" << std::endl;
return ENOENT;
}
std::string line;
std::vector<std::vector<char>> wordsearch;
while (std::getline(inputfile, line)) {
wordsearch.push_back(std::vector<char>(line.begin(), line.end()));
}
for (int i = 0; i < wordsearch.size(); i++) {
for (int j = 0; j < wordsearch[i].size(); j++) {
if (wordsearch[i][j] == 'X') {
res += Check(wordsearch, i, j);
}
}
}
std::cout << res << std::endl;
}

138
day4/second.cpp
View File

@ -1,138 +0,0 @@
#include <asm-generic/errno.h>
#include <cstdlib>
#include <errno.h>
#include <fstream>
#include <iostream>
#include <vector>
#define RANGE 1
int res;
bool AreWeInBounds(int i, int j, std::vector<std::vector<char>> &wordsearch) {
if (i < 0 || j < 0) {
return false;
}
if (i >= wordsearch.size() || j >= wordsearch[i].size()) {
return false;
}
return true;
}
int conditional_operation(int a, int b, char op) {
switch (op) {
case '+':
return a + b;
case '-':
return a - b;
default:
return a;
}
}
int Check(std::vector<std::vector<char>> &wordsearch, int i, int j) {
int xmases = 0;
char op_i;
char op_j;
// array to store the 4 directions
/*
0 1
a
2 3
*/
char xarray[4] = {'\0', '\0', '\0', '\0'};
for (int w = 0; w < 4; w++) {
switch (w) {
case 0:
// search up-left
op_i = '-';
op_j = '-';
if (!AreWeInBounds(i - RANGE, j - RANGE, wordsearch)) {
continue;
}
break;
case 1:
// search up-right
op_i = '-';
op_j = '+';
if (!AreWeInBounds(i - RANGE, j + RANGE, wordsearch)) {
continue;
}
break;
case 2:
// search down-left
op_i = '+';
op_j = '-';
if (!AreWeInBounds(i + RANGE, j - RANGE, wordsearch)) {
continue;
}
break;
case 3:
// search down-right
op_i = '+';
op_j = '+';
if (!AreWeInBounds(i + RANGE, j + RANGE, wordsearch)) {
continue;
}
break;
default:
std::cerr << "How did we get here?" << std::endl;
exit(255);
break;
}
if (wordsearch[i][j] == 'A') {
if (wordsearch[conditional_operation(i, 1, op_i)]
[conditional_operation(j, 1, op_j)] == 'M' ||
wordsearch[conditional_operation(i, 1, op_i)]
[conditional_operation(j, 1, op_j)] == 'S') {
xarray[w] = wordsearch[conditional_operation(i, 1, op_i)]
[conditional_operation(j, 1, op_j)];
}
}
}
int ofset = 3;
for (int w = 0; w < 2; w++) {
if (xarray[w] == 'M' && xarray[w + ofset] == 'S') {
xmases++;
} else if (xarray[w] == 'S' && xarray[w + ofset] == 'M') {
xmases++;
}
ofset -= 2;
}
if (xmases == 2) {
return 1;
} else {
return 0;
}
}
int main() {
std::ifstream inputfile("input");
std::string input;
res = 0;
if (!inputfile.is_open()) {
std::cerr << "Could not open the file" << std::endl;
return ENOENT;
}
std::string line;
std::vector<std::vector<char>> wordsearch;
while (std::getline(inputfile, line)) {
wordsearch.push_back(std::vector<char>(line.begin(), line.end()));
}
for (int i = 0; i < wordsearch.size(); i++) {
for (int j = 0; j < wordsearch[i].size(); j++) {
if (wordsearch[i][j] == 'A') {
res += Check(wordsearch, i, j);
}
}
}
std::cout << res << std::endl;
}

18
day5/day.cpp
View File

@ -1,18 +0,0 @@
#include <fstream>
#include <iostream>
#include <vector>
int main() {
std::ifstream inputfile("input");
std::string input;
int res = 0;
if (!inputfile.is_open()) {
std::cerr << "Could not open the file" << std::endl;
return ENOENT;
}
std::string line;
std::vector<std::vector<char>> wordsearch;
while (std::getline(inputfile, line)) {
}
}

4
readme.md
View File

@ -1,4 +0,0 @@
# My advent of code 2024 solutions
> [!NOTE]\
> If something does not work try removing empty line at the end of the input