aoc

Advent of Code Solutions
git clone git://git.alexkarle.com.com/aoc
Log | Files | Refs | README | LICENSE

b.c (466B) [raw]

      1 #include <stdio.h>
      2 #include <unistd.h>
      3 
      4 int mem[] = {0, 0, 0};
      5 int sum() {
      6     return mem[0] + mem[1] + mem[2];
      7 }
      8 
      9 int main(void) {
     10     int count = 0;
     11     int curr;
     12     int prev = 0;
     13     int i = 0;
     14     while(scanf("%d\n", &curr) != EOF) {
     15         mem[i++ % 3] = curr;
     16         if (i > 3) {
     17             if (prev && sum() > prev) {
     18                 count++;
     19             }
     20             prev = sum();
     21         }
     22         i++;
     23     }
     24     printf("%d\n", count);
     25     return 0;
     26 }