AOC 2024 - Problem 2 Part 1

aoc2024-2-1.cpp

#include <iostream>
#include <fstream>
#include <string>
#include <ctype.h>
#include <vector>
#include <algorithm>
#include <unordered_map>
#include <sstream>

using namespace std;

int main()
{
  ifstream infile("input.txt");

  if (!infile.is_open()) {
    cout << "File prob\n";
    return -1;
  }
  int safeReportsCount = 0;
  string line;
  while (infile.good()) {
    getline(infile, line);

    if (line.empty()) continue;
    
    std::stringstream ss(line);
    bool isSafe = true;
    int prev;
    int n;
    ss >> prev >> n;
    int diff = abs(prev - n);
    bool incr = n - prev > 0;
    prev = n;
    if (diff < 1 || diff > 3) {
      isSafe = false;
    }
    while (!ss.eof() && isSafe) {
      ss >> n;
      bool isIncr = n - prev > 0;
      diff = abs(prev - n);
      if (isIncr != incr || diff < 1 || diff > 3) {
        isSafe = false;
        break;
      }
      prev = n;
    }

    if (isSafe) {
      safeReportsCount++;
    }
    
  }
  infile.close();

  std::cout << safeReportsCount << std::endl;
}