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
|
const std = @import("std");
pub fn main() !void {
var gpa = std.heap.GeneralPurposeAllocator(.{}){};
const allocator = gpa.allocator();
const buf = @embedFile("input");
var ranges = std.mem.tokenizeScalar(u8, buf[0..(buf.len-1)], ',');
var sum: u64 = 0;
var sump1: u64 = 0;
while (ranges.next()) |range| {
var ranges_split = std.mem.tokenizeScalar(u8, range, '-');
const num1 = try std.fmt.parseInt(u64, ranges_split.next().?, 10);
const num2 = try std.fmt.parseInt(u64, ranges_split.next().?, 10);
for (num1..num2+1) |num| {
const numstr: []u8 = try std.fmt.allocPrint(allocator, "{d}", .{num});
for(2..numstr.len+1) |n| {
if (numstr.len % n != 0) continue;
const incr: usize = numstr.len/n;
var i: usize = 0;
const valid = while (i+incr*2 < numstr.len+1) : (i += incr) {
if (!std.mem.eql(u8, numstr[i..i+incr], numstr[i+incr..i+incr+incr])) {
break true;
}
} else false;
if (!valid) {
sum += num;
if (n == 2) sump1 += num;
break;
}
}
}
}
std.debug.print("{} {}\n", .{sump1, sum});
}
|
