# Project Euler 105
# Sum of elements of special sum sets in data/p105.txt.
extern {
function fopen(path: string, mode: string) -> ptr<void>
function fgetc(f: ptr<void>) -> i32
function fclose(f: ptr<void>) -> i32
function calloc(n: i64, size: i64) -> ptr<void>
function free(p: ptr<void>) -> void
}
function sort_arr(a: ptr<i32>, n: i32) -> void {
let mut i: i32 = 0
while i < n {
let mut j: i32 = i + 1
while j < n {
if a[j] < a[i] {
let t: i32 = a[i]
a[i] = a[j]
a[j] = t
}
j = j + 1
}
i = i + 1
}
}
function is_special(a: ptr<i32>, n: i32) -> bool {
let mut k: i32 = 1
while 2 * k <= n {
let mut small: i32 = 0
let mut i: i32 = 0
while i <= k {
small = small + a[i]
i = i + 1
}
let mut large: i32 = 0
i = n - k
while i < n {
large = large + a[i]
i = i + 1
}
if small <= large { return false }
k = k + 1
}
let mut seen: ptr<i8> = calloc(30000, 1)
if seen == null { return false }
let lim: i32 = 1 << n
let mut mask: i32 = 1
while mask < lim {
let mut s: i32 = 0
let mut i: i32 = 0
while i < n {
if ((mask >> i) & 1) == 1 {
s = s + a[i]
}
i = i + 1
}
if seen[s] != 0 {
free(seen)
return false
}
seen[s] = 1
mask = mask + 1
}
free(seen)
return true
}
function main() -> i32 {
let f: ptr<void> = fopen("data/p105.txt", "r")
if f == null {
printf("failed to read data/p105.txt\n")
return 1
}
let a: ptr<i32> = calloc(20, 4)
if a == null { return 1 }
let mut total: i64 = 0
let mut n: i32 = 0
let mut cur: i32 = 0
let mut in_num: bool = false
let mut c: i32 = fgetc(f)
while true {
if c >= 48 && c <= 57 {
cur = cur * 10 + (c - 48)
in_num = true
} else {
if in_num {
a[n] = cur
n = n + 1
cur = 0
in_num = false
}
if c == 10 || c < 0 {
if n > 0 {
sort_arr(a, n)
if is_special(a, n) {
let mut s: i32 = 0
let mut i: i32 = 0
while i < n {
s = s + a[i]
i = i + 1
}
total = total + (s as i64)
}
n = 0
}
if c < 0 { break }
}
}
if c < 0 { break }
c = fgetc(f)
}
fclose(f)
free(a)
printf("%lld\n", total)
return 0
}
Generated C
#include <stdint.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/* Flow runtime helpers */
typedef struct flow_temp_node { struct flow_temp_node* next; } flow_temp_node;
static flow_temp_node* flow_temp_head = NULL;
static int flow_temp_atexit_set = 0;
__attribute__((unused)) static void flow_temp_free_all(void) {
while (flow_temp_head) {
flow_temp_node* n = flow_temp_head;
flow_temp_head = n->next;
free(n);
}
}
__attribute__((unused)) static void* flow_temp_alloc(size_t nbytes) {
flow_temp_node* node = (flow_temp_node*)malloc(sizeof(flow_temp_node) + nbytes);
if (!node) return NULL;
node->next = flow_temp_head;
flow_temp_head = node;
if (!flow_temp_atexit_set) {
flow_temp_atexit_set = 1;
atexit(flow_temp_free_all);
}
return (void*)(node + 1);
}
#ifndef FLOW_DIAG
#define FLOW_DIAG(msg) fprintf(stderr, "%s", (msg))
#endif
#ifndef FLOW_LOG
#define FLOW_LOG(fmt, ...) printf(fmt, __VA_ARGS__)
#endif
#ifndef FLOW_LOG_EMPTY
#define FLOW_LOG_EMPTY(fmt) printf(fmt)
#endif
static char* flow_strcat(const char* a, const char* b) {
size_t la = strlen(a ? a : ""), lb = strlen(b ? b : "");
char* r = (char*)flow_temp_alloc(la + lb + 1);
if (!r) return NULL;
if (la) memcpy(r, a, la);
if (lb) memcpy(r + la, b, lb);
r[la + lb] = '\0';
return r;
}
#define __flow_in_arr(arr, val) __extension__ ({ \
int _found = 0; \
size_t _n = sizeof(arr)/sizeof((arr)[0]); \
for (size_t _i = 0; _i < _n; _i++) { \
if ((arr)[_i] == (val)) { _found = 1; break; } \
} _found; })
/* Unified fault handler (MISRA #279) — override with -DFLOW_FAULT_HANDLER=fn */
#ifndef FLOW_FAULT_HANDLER
__attribute__((unused)) static inline void flow_fault_handler(const char* msg) {
fprintf(stderr, "flow: %s\n", msg ? msg : "fault");
abort();
#if defined(__GNUC__) || defined(__clang__)
__builtin_unreachable();
#endif
}
#else
#define flow_fault_handler FLOW_FAULT_HANDLER
#endif
#define flow_div_by_zero_handler() flow_fault_handler("division by zero")
#define flow_shift_ub_handler() flow_fault_handler("invalid shift (amount out of range or left-shift of negative)")
#ifndef FLOW_CHECKED_DIV
#define FLOW_CHECKED_DIV(L, R) (((R) != 0) ? ((L) / (R)) : (flow_div_by_zero_handler(), (L) * 0))
#endif
#ifndef FLOW_CHECKED_MOD
#define FLOW_CHECKED_MOD(L, R) (((R) != 0) ? ((L) % (R)) : (flow_div_by_zero_handler(), (L) * 0))
#endif
#ifndef FLOW_CHECKED_SHL
#define FLOW_CHECKED_SHL(L, R) ((((R) >= 0) && ((unsigned long long)(R) < (sizeof(L) * 8ull)) && ((L) >= 0)) ? ((L) << (R)) : (flow_shift_ub_handler(), (L) * 0))
#endif
#ifndef FLOW_CHECKED_SHR
#define FLOW_CHECKED_SHR(L, R) ((((R) >= 0) && ((unsigned long long)(R) < (sizeof(L) * 8ull))) ? ((L) >> (R)) : (flow_shift_ub_handler(), (L) * 0))
#endif
#include <math.h>
void* _ui_state = NULL;
static inline float i32_to_f32(int32_t v) { return (float)v; }
/* Host stub for @gpu kernels (device codegen replaces this). */
static inline int32_t gpu_thread_id(void) { return 0; }
void sort_arr_ptr_i32_i32(int32_t* a, int32_t n);
bool is_special_ptr_i32_i32(int32_t* a, int32_t n);
int32_t main(void);
void sort_arr_ptr_i32_i32(int32_t* a, int32_t n) {
int32_t i = 0;
while (i < n) {
int32_t j = (i + 1);
while (j < n) {
if (a[j] < a[i]) {
int32_t t = a[i];
a[i] = a[j];
a[j] = t;
}
j = (j + 1);
}
i = (i + 1);
}
}
bool is_special_ptr_i32_i32(int32_t* a, int32_t n) {
int32_t k = 1;
while ((2 * k) <= n) {
int32_t small = 0;
int32_t i = 0;
while (i <= k) {
small = (small + a[i]);
i = (i + 1);
}
int32_t large = 0;
i = (n - k);
while (i < n) {
large = (large + a[i]);
i = (i + 1);
}
if (small <= large) {
return 0;
}
k = (k + 1);
}
int8_t* seen = (int8_t*)(calloc(30000, 1));
if (seen == NULL) {
return 0;
}
int32_t lim = FLOW_CHECKED_SHL((1), (n));
int32_t mask = 1;
while (mask < lim) {
int32_t s = 0;
int32_t i = 0;
while (i < n) {
if ((FLOW_CHECKED_SHR((mask), (i)) & 1) == 1) {
s = (s + a[i]);
}
i = (i + 1);
}
if (seen[s] != 0) {
free(seen);
return 0;
}
seen[s] = 1;
mask = (mask + 1);
}
free(seen);
return 1;
}
int32_t main(void) {
void* f = (void*)(fopen("data/p105.txt", "r"));
if (f == NULL) {
printf("failed to read data/p105.txt\n");
return 1;
}
int32_t* a = (int32_t*)(calloc(20, 4));
if (a == NULL) {
return 1;
}
int64_t total = 0;
int32_t n = 0;
int32_t cur = 0;
bool in_num = 0;
int32_t c = fgetc(f);
while (1) {
if ((c >= 48 && c <= 57)) {
cur = ((cur * 10) + (c - 48));
in_num = 1;
} else {
if (in_num) {
a[n] = cur;
n = (n + 1);
cur = 0;
in_num = 0;
}
if ((c == 10 || c < 0)) {
if (n > 0) {
sort_arr_ptr_i32_i32(a, n);
if (is_special_ptr_i32_i32(a, n)) {
int32_t s = 0;
int32_t i = 0;
while (i < n) {
s = (s + a[i]);
i = (i + 1);
}
total = (total + ((int64_t)(s)));
}
n = 0;
}
if (c < 0) {
break;
}
}
}
if (c < 0) {
break;
}
c = fgetc(f);
}
fclose(f);
free(a);
printf("%lld\n", total);
return 0;
}