summaryrefslogtreecommitdiff
path: root/src/day02.zig
blob: f764589b41e2b0fe7830f9ae7e9f76537a46f6f7 (plain)
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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
const std = @import("std");
const print = std.debug.print;

pub fn solve(part: []u8, reader: *std.Io.Reader, _: std.mem.Allocator) !void {
    if (std.mem.eql(u8, part, "1")) {
        try part1(reader);
    } else {
        try part2(reader);
    }
}

fn digits(number: usize) usize {
    var value = number;
    var n: usize = 0;
    while (value != 0) : (value /= 10) {
        n += 1;
    }
    return n;
}

fn part1(reader: *std.Io.Reader) !void {
    var output: usize = 0;
    while (reader.takeDelimiter(',')) |line| {
        const trimmed = std.mem.trimRight(u8, line.?, &[_]u8{'\n'});
        if (trimmed.len == 0) break;
        var split = std.mem.splitScalar(u8, trimmed, '-');
        var start = try std.fmt.parseInt(usize, split.next().?, 10);
        const end = try std.fmt.parseInt(usize, split.next().?, 10);
        while (start <= end): (start += 1) {
            const n = digits(start);
            if (n % 2 == 0 and start % std.math.pow(usize, 10,n/2) == start / std.math.pow(usize, 10,n/2)) {
                output += start;
                start += std.math.pow(usize, 2,n/2);
            }
        }

    } else |_| {
    }
    print("{d}\n", .{output});
}

fn part2(reader: *std.Io.Reader) !void {
    var output: usize = 0;
    while (reader.takeDelimiter(',')) |line| {
        const trimmed = std.mem.trimRight(u8, line.?, &[_]u8{'\n'});
        if (trimmed.len == 0) break;
        var split = std.mem.splitScalar(u8, trimmed, '-');
        var start = try std.fmt.parseInt(usize, split.next().?, 10);
        const end = try std.fmt.parseInt(usize, split.next().?, 10);
        while (start <= end): (start += 1) {
            const n = digits(start);
            for (1..n) |i| {
                if (n % i == 0) {
                    const p: usize = std.math.pow(usize, 10,i);
                    if (start % p != 0) {
                        const div = start / (start % p);
                        var c: usize = 0;

                        for (0..n/i - 1) |_| {
                            c *= p;
                            c += p;
                        }
                        c += 1;

                        if (div == c){
                            output += start;
                            start += std.math.pow(usize, 2, n/2);
                            break;
                        }
                    }
                }
            }
        }

    } else |_| {
    }
    print("{d}\n", .{output});
}