Overview
| Comment: | 201505 2nd star |
|---|---|
| Downloads: | Tarball | ZIP archive |
| Timelines: | family | ancestors | descendants | both | trunk |
| Files: | files | file ages | folders |
| SHA3-256: |
c2af59b62ee256be760de34006c055b8 |
| User & Date: | nnz on 2024-12-15 12:24:55.245 |
| Other Links: | manifest | tags |
Context
|
2024-12-15
| ||
| 13:12 | 201505 reworked my solution check-in: 02e370e22c user: nnz tags: trunk | |
| 12:24 | 201505 2nd star check-in: c2af59b62e user: nnz tags: trunk | |
| 11:44 | 201505 1st star check-in: 93e9164929 user: nnz tags: trunk | |
Changes
Modified aoc2015.c
from [2cf16828ff]
to [1f1b4d89f8].
1 2 3 4 5 6 7 8 9 |
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "aocdailies.h"
#include "aocutils.h"
void aoc201505(char *data, size_t len) {
(void)len; // unused argument
| > | < > | | | | | > > > > > > > > > > > > > > > > > > > | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 |
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "aocdailies.h"
#include "aocutils.h"
void aoc201505(char *data, size_t len) {
(void)len; // unused argument
unsigned lines = 0, nice = 0, nice2 = 0;
char *line = strtok(data, "\n"), *curr;
while (line) {
lines++; // used in Part Two
if (!strstr(line, "ab")) {
if (!strstr(line, "cd")) {
if (!strstr(line, "pq")) {
if (!strstr(line, "xy")) {
for (curr = line; curr[1]; curr++) {
if (curr[0] == curr[1]) break;
}
if (curr[0] == curr[1]) {
unsigned vowels = 0;
for (curr = line; *curr; curr++) {
if (strchr("aeiou", *curr)) vowels++;
if (vowels == 3) break;
}
nice += (vowels == 3);
}
}
}
}
}
line = strtok(NULL, "\n");
}
printf("There are %u nice strings.\n", nice);
line = data;
bool pair, hugged;
while (lines--) {
pair = hugged = false;
for (curr = line; curr[3]; curr++) {
char twostr[3] = {curr[0], curr[1], 0};
if (strstr(curr+2, twostr)) pair = true;
if (curr[0] == curr[2]) hugged = true;
if (pair && hugged) break;
}
if (pair) {
if (hugged) nice2++;
else if (curr[0] == curr[2]) nice2++;
else if (curr[1] == curr[3]) nice2++;
}
line += 1 + strlen(line); // go to next line, skip '\0' left from strtok
}
printf("There are %u nice strings under the new rules.\n", nice2);
}
void aoc201504(char *data, size_t len) {
data[--len] = 0; // remove newline, adjust `len`
char longkey[128];
unsigned extra = 1;
for (;;) {
|
| ︙ | ︙ |