blob: cf61687bb58955b58ad91be64d21f011628fce10 (
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
|
#include <math.h>
#include <stdlib.h>
#include <stdio.h>
void *emalloc(size_t s)
{
void *p = malloc(s);
if (p != NULL) return p;
fprintf(stderr, "Ran out of memory allocating a buffer of size %zu\n", s);
exit(EXIT_FAILURE);
}
long part1(long input)
{
long res = -1;
long *houses = emalloc(sizeof(long) * input / 10);
#pragma omp parallel for
for (long i = 1; i < input / 10; i++)
for (long j = i; j < input / 10; j++)
houses[j] += i * 10;
puts("filled houses");
for (long i = 1; i < input / 10; i++) {
if (houses[i] >= input) {
res = i;
break;
}
}
free(houses);
return res;
}
long part2(long input)
{
return -1;
}
int main(void)
{
long input = 33100000;
printf("%ld\n", part1(input));
}
|
