# Project Euler 504
# Square on the Inside — Pick's theorem, m = 100.
import euler.nt { gcd }
extern {
function calloc(n: i64, size: i64) -> ptr<void>
function free(p: ptr<void>) -> void
}
function main() -> i32 {
let M: i64 = 100
let edge: ptr<i32> = calloc((M + 1) * (M + 1), 4)
if edge == null { return 1 }
let mut a: i64 = 1
while a <= M {
let mut b: i64 = 1
while b <= M {
edge[a * (M + 1) + b] = gcd(a, b) as i32
b = b + 1
}
a = a + 1
}
let max_pts: i64 = (M + M) * (M + M) / 2
let is_sq: ptr<i8> = calloc(max_pts + 1, 1)
if is_sq == null { free(edge); return 1 }
let mut k: i64 = 1
while k * k <= max_pts {
is_sq[k * k] = 1
k = k + 1
}
let mut count: i64 = 0
a = 1
while a <= M {
let mut b: i64 = 1
while b <= M {
let mut c: i64 = 1
while c <= M {
let mut d: i64 = 1
while d <= M {
let inside: i64 = (a + c) * (b + d) / 2
let boundary: i64 = (edge[a * (M + 1) + b] as i64)
+ (edge[b * (M + 1) + c] as i64)
+ (edge[c * (M + 1) + d] as i64)
+ (edge[a * (M + 1) + d] as i64) - 4
let pts: i64 = inside - boundary / 2 - 1
if pts >= 0 && pts <= max_pts {
if is_sq[pts] == 1 {
count = count + 1
}
}
d = d + 1
}
c = c + 1
}
b = b + 1
}
a = a + 1
}
printf("%lld\n", count)
free(is_sq)
free(edge)
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; }
int64_t gcd_i64_i64(int64_t a0, int64_t b0);
int64_t lcm_i64_i64(int64_t a, int64_t b);
int64_t isqrt_i64(int64_t n);
int64_t mulmod_i64_i64_i64(int64_t a0, int64_t b0, int64_t mod);
int64_t mod_pow_i64_i64_i64(int64_t base, int64_t exp, int64_t mod);
bool is_prime_i64(int64_t n);
int32_t main(void);
int64_t gcd_i64_i64(int64_t a0, int64_t b0) {
int64_t a = a0;
int64_t b = b0;
while (b != 0) {
int64_t t = FLOW_CHECKED_MOD((a), (b));
a = b;
b = t;
}
return a;
}
int64_t lcm_i64_i64(int64_t a, int64_t b) {
if ((a == 0 || b == 0)) {
return 0;
}
return (FLOW_CHECKED_DIV((a), (gcd_i64_i64(a, b))) * b);
}
int64_t isqrt_i64(int64_t n) {
if (n < 2) {
return n;
}
int64_t x = n;
int64_t y = FLOW_CHECKED_DIV(((x + 1)), (2));
while (y < x) {
x = y;
y = FLOW_CHECKED_DIV(((x + FLOW_CHECKED_DIV((n), (x)))), (2));
}
return x;
}
int64_t mulmod_i64_i64_i64(int64_t a0, int64_t b0, int64_t mod) {
int64_t a = FLOW_CHECKED_MOD((a0), (mod));
int64_t b = FLOW_CHECKED_MOD((b0), (mod));
int64_t result = 0;
while (b > 0) {
if (FLOW_CHECKED_MOD((b), (2)) == 1) {
result = FLOW_CHECKED_MOD(((result + a)), (mod));
}
a = FLOW_CHECKED_MOD(((a * 2)), (mod));
b = FLOW_CHECKED_DIV((b), (2));
}
return result;
}
int64_t mod_pow_i64_i64_i64(int64_t base, int64_t exp, int64_t mod) {
if (mod == 1) {
return 0;
}
int64_t result = 1;
int64_t b = FLOW_CHECKED_MOD((base), (mod));
int64_t e = exp;
while (e > 0) {
if (FLOW_CHECKED_MOD((e), (2)) == 1) {
result = mulmod_i64_i64_i64(result, b, mod);
}
b = mulmod_i64_i64_i64(b, b, mod);
e = FLOW_CHECKED_DIV((e), (2));
}
return result;
}
bool is_prime_i64(int64_t n) {
if (n < 2) {
return 0;
}
if (n < 4) {
return 1;
}
if ((FLOW_CHECKED_MOD((n), (2)) == 0 || FLOW_CHECKED_MOD((n), (3)) == 0)) {
return 0;
}
int64_t i = 5;
while ((i * i) <= n) {
if ((FLOW_CHECKED_MOD((n), (i)) == 0 || FLOW_CHECKED_MOD((n), ((i + 2))) == 0)) {
return 0;
}
i = (i + 6);
}
return 1;
}
int32_t main(void) {
int64_t M = 100;
int32_t* edge = (int32_t*)(calloc(((M + 1) * (M + 1)), 4));
if (edge == NULL) {
return 1;
}
int64_t a = 1;
while (a <= M) {
int64_t b = 1;
while (b <= M) {
edge[((a * (M + 1)) + b)] = ((int32_t)(gcd_i64_i64(a, b)));
b = (b + 1);
}
a = (a + 1);
}
int64_t max_pts = FLOW_CHECKED_DIV((((M + M) * (M + M))), (2));
int8_t* is_sq = (int8_t*)(calloc((max_pts + 1), 1));
if (is_sq == NULL) {
free(edge);
return 1;
}
int64_t k = 1;
while ((k * k) <= max_pts) {
is_sq[(k * k)] = 1;
k = (k + 1);
}
int64_t count = 0;
a = 1;
while (a <= M) {
int64_t b = 1;
while (b <= M) {
int64_t c = 1;
while (c <= M) {
int64_t d = 1;
while (d <= M) {
int64_t inside = FLOW_CHECKED_DIV((((a + c) * (b + d))), (2));
int64_t boundary = ((((((int64_t)(edge[((a * (M + 1)) + b)])) + ((int64_t)(edge[((b * (M + 1)) + c)]))) + ((int64_t)(edge[((c * (M + 1)) + d)]))) + ((int64_t)(edge[((a * (M + 1)) + d)]))) - 4);
int64_t pts = ((inside - FLOW_CHECKED_DIV((boundary), (2))) - 1);
if ((pts >= 0 && pts <= max_pts)) {
if (is_sq[pts] == 1) {
count = (count + 1);
}
}
d = (d + 1);
}
c = (c + 1);
}
b = (b + 1);
}
a = (a + 1);
}
printf("%lld\n", count);
free(is_sq);
free(edge);
return 0;
}