# Project Euler 833: Square Triangle Products
# S(10^35) mod 136101521.
# Uses i128 for exact comparison (10^35 fits in i128) and modular arithmetic for the sum.
extern {
function calloc(n: i64, size: i64) -> ptr<void>
function free(p: ptr<void>)
function printf(fmt: ptr<i8>, ...) -> i32
function log(x: f64) -> f64
function exp(x: f64) -> f64
}
const MOD: i64 = 136101521
const LOG10_35: f64 = 35.0 * 2.302585092994046
function gcd_ll(a: i64, b: i64) -> i64 {
let mut x: i64 = a
if x < 0 { x = 0 - x }
let mut y: i64 = b
if y < 0 { y = 0 - y }
while y != 0 {
let t: i64 = x % y
x = y
y = t
}
return x
}
function mod_pow(a: i64, e: i64, m: i64) -> i64 {
let mut r: i64 = 1 % m
let mut x: i64 = a % m
if x < 0 { x = x + m }
let mut ee: i64 = e
while ee > 0 {
if (ee & 1) == 1 { r = r * x % m }
x = x * x % m
ee = ee >> 1
}
return r
}
function mod_inv(a: i64, m: i64) -> i64 {
return mod_pow(a, m - 2, m)
}
# Compute U_k(P) mod MOD using recurrence U_0=0, U_1=1, U_k = P*U_{k-1} - U_{k-2}
function lucas_U_mod(P: i64, k: i32) -> i64 {
if k == 0 { return 0 }
if k == 1 { return 1 % MOD }
let Pm: i64 = P % MOD
if Pm < 0 { Pm = Pm + MOD }
let mut u0: i64 = 0
let mut u1: i64 = 1 % MOD
let mut kk: i32 = 2
while kk <= k {
let tmp: i64 = (Pm * u1 % MOD - u0 % MOD + MOD) % MOD
u0 = u1
u1 = tmp
kk = kk + 1
}
return u1
}
# Compute log(c_value(n, i, j)) approximately using f64
# c_value = T(n) * U_i(4n+2) * U_j(4n+2)
# log(c_value) = log(T(n)) + log(U_i) + log(U_j)
function log_lucas_U(P: f64, k: i32) -> f64 {
if k == 0 { return -1e300 }
if k == 1 { return 0.0 }
let mut u0: f64 = 0.0
let mut u1: f64 = 1.0
let mut l0: f64 = -1e300
let mut l1: f64 = 0.0
let mut kk: i32 = 2
while kk <= k {
let tmp: f64 = P * u1 - u0
l0 = l1
if tmp > 0.0 {
l1 = log(P) + l1
if l0 > -1e200 {
let correction: f64 = 1.0 - exp(l0 - l1)
if correction > 1e-15 { l1 = l1 + log(correction) }
}
} else {
l1 = -1e300
}
u0 = u1
u1 = tmp
kk = kk + 1
}
return l1
}
function log_c_value(n: i64, i: i32, j: i32) -> f64 {
if n <= 0 { return -1e300 }
let tn: f64 = (n as f64) * ((n + 1) as f64) / 2.0
let P: f64 = (4 * n + 2) as f64
let li: f64 = log_lucas_U(P, i)
let lj: f64 = log_lucas_U(P, j)
return log(tn) + li + lj
}
# Compute c_value(n, i, j) using i128 with overflow detection
# Returns a value > N if overflow would occur or value exceeds CAP
const I128_CAP: i128 = 10000000000000000000000000000000000000
function abs_i128(x: i128) -> i128 {
if x < 0 { return 0 - x }
return x
}
function mul_overflow(a: i128, b: i128) -> i128 {
# Returns a*b if |a*b| < I128_CAP, else I128_CAP
if a == 0 { return 0 }
if b == 0 { return 0 }
let aa: i128 = abs_i128(a)
let bb: i128 = abs_i128(b)
if aa > (I128_CAP / bb) { return I128_CAP }
return a * b
}
function c_value_i128(n: i64, i: i32, j: i32, ui: ptr<i128>, uj: ptr<i128>) -> i128 {
if n <= 0 {
ui[0] = 0
uj[0] = 0
return 0
}
let P: i128 = (4 * n + 2) as i128
let mut u0: i128 = 0
let mut u1: i128 = 1
let mut ri: i128 = 0
let mut rj: i128 = 0
if i == 0 { ri = 0 } else { if i == 1 { ri = 1 } else { ri = 0 } }
if j == 0 { rj = 0 } else { if j == 1 { rj = 1 } else { rj = 0 } }
let mut k: i32 = 2
while k <= i || k <= j {
let tmp: i128 = mul_overflow(P, u1)
if tmp == I128_CAP {
ui[0] = I128_CAP
uj[0] = I128_CAP
return I128_CAP
}
let new_u1: i128 = tmp - u0
if abs_i128(new_u1) > I128_CAP {
ui[0] = I128_CAP
uj[0] = I128_CAP
return I128_CAP
}
u0 = u1
u1 = new_u1
if k == i { ri = u1 }
if k == j { rj = u1 }
k = k + 1
}
ui[0] = ri
uj[0] = rj
let tn: i128 = (n as i128) * ((n + 1) as i128) / 2
let prod: i128 = mul_overflow(tn, ri)
if prod == I128_CAP { return I128_CAP }
let prod2: i128 = mul_overflow(prod, rj)
if prod2 == I128_CAP { return I128_CAP }
return prod2
}
# N = 10^35 as i128
function get_N_i128() -> i128 {
# 10^35 = 100000000000000000000000000000000000
# Split: 10^35 = 10^17 * 10^18
# 10^17 = 100000000000000000
# 10^18 = 1000000000000000000
# But 10^17 * 10^18 = 10^35 which fits in i128
let a: i128 = 100000000000000000
let b: i128 = 1000000000000000000
return a * b
}
# Find M = max n such that c_value(n, i, j) <= 10^35
# Use i128 binary search directly with overflow detection
function max_n_for_pair(i: i32, j: i32) -> i64 {
let N: i128 = get_N_i128()
let ui: ptr<i128> = calloc(2, 16)
let uj: ptr<i128> = calloc(2, 16)
# Check n=1
let cv1: i128 = c_value_i128(1, i, j, ui, uj)
if cv1 > N {
free(ui as ptr<void>)
free(uj as ptr<void>)
return 0
}
# Exponential search for upper bound using f64 log
let mut hi: i64 = 2
while log_c_value(hi, i, j) < LOG10_35 {
hi = hi * 2
if hi > 10000000000000 { hi = 10000000000000; break }
}
# Binary search using i128 exact comparison
let mut lo: i64 = 1
while lo + 1 < hi {
let mid: i64 = (lo + hi) / 2
let cv: i128 = c_value_i128(mid, i, j, ui, uj)
if cv <= N {
lo = mid
} else {
hi = mid
}
}
# Verify lo with i128
let cv_lo: i128 = c_value_i128(lo, i, j, ui, uj)
let M: i64 = if cv_lo <= N { lo } else { lo - 1 }
free(ui as ptr<void>)
free(uj as ptr<void>)
return M
}
# Compute C(n, k) mod MOD
function binom_mod(n: i64, k: i32) -> i64 {
if k < 0 { return 0 }
if k == 0 { return 1 % MOD }
let nn: i64 = n % MOD
if nn < 0 { nn = nn + MOD }
let mut result: i64 = 1
let mut t: i32 = 0
while t < k {
let nt: i64 = (nn - (t as i64)) % MOD
if nt < 0 { nt = nt + MOD }
result = result * nt % MOD
t = t + 1
}
# Divide by k! mod MOD
let mut kf: i64 = 1
let mut t2: i32 = 1
while t2 <= k {
kf = kf * (t2 as i64) % MOD
t2 = t2 + 1
}
return result * mod_inv(kf, MOD) % MOD
}
# Compute sum_{n=0..M} f(n) mod MOD using Newton forward differences
# f(n) = c_value(n, i, j) mod MOD
function sum_for_pair(i: i32, j: i32, M: i64) -> i64 {
let deg: i32 = i + j
# Compute f(n) mod MOD for n = 0..deg
let fvals: ptr<i64> = calloc((deg + 1) as i64, 8)
let mut n: i64 = 0
while n <= (deg as i64) {
let P: i64 = (4 * n + 2) % MOD
if P < 0 { P = P + MOD }
let mut u0: i64 = 0
let mut u1: i64 = 1 % MOD
let mut ri: i64 = 0
let mut rj: i64 = 0
if i == 0 { ri = 0 } else { if i == 1 { ri = 1 % MOD } else { ri = 0 } }
if j == 0 { rj = 0 } else { if j == 1 { rj = 1 % MOD } else { rj = 0 } }
let mut k: i32 = 2
while k <= i || k <= j {
let tmp: i64 = (P * u1 % MOD - u0 % MOD + MOD) % MOD
u0 = u1
u1 = tmp
if k == i { ri = u1 }
if k == j { rj = u1 }
k = k + 1
}
let tn: i64 = (n % MOD) * ((n + 1) % MOD) % MOD * mod_inv(2, MOD) % MOD
fvals[n] = tn * ri % MOD * rj % MOD
n = n + 1
}
# Forward differences
let a: ptr<i64> = calloc((deg + 1) as i64, 8)
let cur: ptr<i64> = calloc((deg + 1) as i64, 8)
let mut x: i64 = 0
while x <= (deg as i64) { cur[x] = fvals[x]; x = x + 1 }
let mut nn: i32 = deg + 1
let mut ci: i32 = 0
while nn > 0 {
a[ci] = cur[0]
ci = ci + 1
let mut k: i32 = 0
while k < nn - 1 {
cur[k] = (cur[k + 1] - cur[k] % MOD + MOD) % MOD
k = k + 1
}
nn = nn - 1
}
# Sum = sum_{m=0..deg} a[m] * C(M+1, m+1) mod MOD
let mut result: i64 = 0
let Mp1: i64 = M + 1
let mut m: i32 = 0
while m <= deg {
let binom: i64 = binom_mod(Mp1, m + 1)
let term: i64 = a[m] % MOD * binom % MOD
result = (result + term) % MOD
m = m + 1
}
free(fvals as ptr<void>)
free(a as ptr<void>)
free(cur as ptr<void>)
return result
}
# Find max j such that U_j(6) <= 10^35
function maxJ_for_N() -> i32 {
let N: i128 = get_N_i128()
let P: i128 = 6
let mut u0: i128 = 0
let mut u1: i128 = 1
let mut maxj: i32 = 1
let mut k: i32 = 2
while k < 400 {
let tmp: i128 = P * u1 - u0
u0 = u1
u1 = tmp
if u1 > N { break }
maxj = k
k = k + 1
}
return maxj
}
function main() -> i32 {
let maxj: i32 = maxJ_for_N()
let mut total: i64 = 0
let mut i: i32 = 1
while i < maxj {
let mut j: i32 = i + 1
while j <= maxj {
if gcd_ll(i as i64, j as i64) == 1 {
let M: i64 = max_n_for_pair(i, j)
if M > 0 {
let s: i64 = sum_for_pair(i, j, M)
total = (total + s) % MOD
}
}
j = j + 1
}
i = i + 1
}
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; }
int64_t gcd_ll_i64_i64(int64_t a, int64_t b);
int64_t mod_pow_i64_i64_i64(int64_t a, int64_t e, int64_t m);
int64_t mod_inv_i64_i64(int64_t a, int64_t m);
int64_t lucas_U_mod_i64_i32(int64_t P, int32_t k);
double log_lucas_U_f64_i32(double P, int32_t k);
double log_c_value_i64_i32_i32(int64_t n, int32_t i, int32_t j);
__int128 abs_i128_i128(__int128 x);
__int128 mul_overflow_i128_i128(__int128 a, __int128 b);
__int128 c_value_i128_i64_i32_i32_ptr_i128_ptr_i128(int64_t n, int32_t i, int32_t j, __int128* ui, __int128* uj);
__int128 get_N_i128(void);
int64_t max_n_for_pair_i32_i32(int32_t i, int32_t j);
int64_t binom_mod_i64_i32(int64_t n, int32_t k);
int64_t sum_for_pair_i32_i32_i64(int32_t i, int32_t j, int64_t M);
int32_t maxJ_for_N(void);
int32_t main(void);
static const int64_t MOD = 136101521;
static const double LOG10_35 = (35.0 * 2.302585092994046);
static const __int128 I128_CAP = ((__int128)0x785EE10D5DA46D9ULL << 64 | (__int128)0xF436A000000000ULL);
int64_t gcd_ll_i64_i64(int64_t a, int64_t b) {
int64_t x = a;
if (x < 0) {
x = (0 - x);
}
int64_t y = b;
if (y < 0) {
y = (0 - y);
}
while (y != 0) {
int64_t t = FLOW_CHECKED_MOD((x), (y));
x = y;
y = t;
}
return x;
}
int64_t mod_pow_i64_i64_i64(int64_t a, int64_t e, int64_t m) {
int64_t r = FLOW_CHECKED_MOD((1), (m));
int64_t x = FLOW_CHECKED_MOD((a), (m));
if (x < 0) {
x = (x + m);
}
int64_t ee = e;
while (ee > 0) {
if ((ee & 1) == 1) {
r = FLOW_CHECKED_MOD(((r * x)), (m));
}
x = FLOW_CHECKED_MOD(((x * x)), (m));
ee = FLOW_CHECKED_SHR((ee), (1));
}
return r;
}
int64_t mod_inv_i64_i64(int64_t a, int64_t m) {
return mod_pow_i64_i64_i64(a, (m - 2), m);
}
int64_t lucas_U_mod_i64_i32(int64_t P, int32_t k) {
if (k == 0) {
return 0;
}
if (k == 1) {
return FLOW_CHECKED_MOD((1), (MOD));
}
int64_t Pm = FLOW_CHECKED_MOD((P), (MOD));
if (Pm < 0) {
Pm = (Pm + MOD);
}
int64_t u0 = 0;
int64_t u1 = FLOW_CHECKED_MOD((1), (MOD));
int32_t kk = 2;
while (kk <= k) {
int64_t tmp = FLOW_CHECKED_MOD((((FLOW_CHECKED_MOD(((Pm * u1)), (MOD)) - FLOW_CHECKED_MOD((u0), (MOD))) + MOD)), (MOD));
u0 = u1;
u1 = tmp;
kk = (kk + 1);
}
return u1;
}
double log_lucas_U_f64_i32(double P, int32_t k) {
if (k == 0) {
return (-1e300);
}
if (k == 1) {
return 0.0;
}
double u0 = 0.0;
double u1 = 1.0;
double l0 = (-1e300);
double l1 = 0.0;
int32_t kk = 2;
while (kk <= k) {
double tmp = ((P * u1) - u0);
l0 = l1;
if (tmp > 0.0) {
l1 = (log(P) + l1);
if (l0 > (-1e200)) {
double correction = (1.0 - exp((l0 - l1)));
if (correction > 1e-15) {
l1 = (l1 + log(correction));
}
}
} else {
l1 = (-1e300);
}
u0 = u1;
u1 = tmp;
kk = (kk + 1);
}
return l1;
}
double log_c_value_i64_i32_i32(int64_t n, int32_t i, int32_t j) {
if (n <= 0) {
return (-1e300);
}
double tn = ((((double)(n)) * ((double)((n + 1)))) / 2.0);
double P = ((double)(((4 * n) + 2)));
double li = log_lucas_U_f64_i32(P, i);
double lj = log_lucas_U_f64_i32(P, j);
return ((log(tn) + li) + lj);
}
__int128 abs_i128_i128(__int128 x) {
if (x < 0) {
return (0 - x);
}
return x;
}
__int128 mul_overflow_i128_i128(__int128 a, __int128 b) {
if (a == 0) {
return 0;
}
if (b == 0) {
return 0;
}
__int128 aa = abs_i128_i128(a);
__int128 bb = abs_i128_i128(b);
if (aa > FLOW_CHECKED_DIV((I128_CAP), (bb))) {
return I128_CAP;
}
return (a * b);
}
__int128 c_value_i128_i64_i32_i32_ptr_i128_ptr_i128(int64_t n, int32_t i, int32_t j, __int128* ui, __int128* uj) {
if (n <= 0) {
ui[0] = 0;
uj[0] = 0;
return 0;
}
__int128 P = ((__int128)(((4 * n) + 2)));
__int128 u0 = 0;
__int128 u1 = 1;
__int128 ri = 0;
__int128 rj = 0;
if (i == 0) {
ri = 0;
} else {
if (i == 1) {
ri = 1;
} else {
ri = 0;
}
}
if (j == 0) {
rj = 0;
} else {
if (j == 1) {
rj = 1;
} else {
rj = 0;
}
}
int32_t k = 2;
while ((k <= i || k <= j)) {
__int128 tmp = mul_overflow_i128_i128(P, u1);
if (tmp == I128_CAP) {
ui[0] = I128_CAP;
uj[0] = I128_CAP;
return I128_CAP;
}
__int128 new_u1 = (tmp - u0);
if (abs_i128_i128(new_u1) > I128_CAP) {
ui[0] = I128_CAP;
uj[0] = I128_CAP;
return I128_CAP;
}
u0 = u1;
u1 = new_u1;
if (k == i) {
ri = u1;
}
if (k == j) {
rj = u1;
}
k = (k + 1);
}
ui[0] = ri;
uj[0] = rj;
__int128 tn = FLOW_CHECKED_DIV(((((__int128)(n)) * ((__int128)((n + 1))))), (2));
__int128 prod = mul_overflow_i128_i128(tn, ri);
if (prod == I128_CAP) {
return I128_CAP;
}
__int128 prod2 = mul_overflow_i128_i128(prod, rj);
if (prod2 == I128_CAP) {
return I128_CAP;
}
return prod2;
}
__int128 get_N_i128(void) {
__int128 a = 100000000000000000;
__int128 b = 1000000000000000000;
return (a * b);
}
int64_t max_n_for_pair_i32_i32(int32_t i, int32_t j) {
__int128 N = get_N_i128();
__int128* ui = (__int128*)(calloc(2, 16));
__int128* uj = (__int128*)(calloc(2, 16));
__int128 cv1 = c_value_i128_i64_i32_i32_ptr_i128_ptr_i128(1, i, j, ui, uj);
if (cv1 > N) {
free(((void*)(ui)));
free(((void*)(uj)));
return 0;
}
int64_t hi = 2;
while (log_c_value_i64_i32_i32(hi, i, j) < LOG10_35) {
hi = (hi * 2);
if (hi > 10000000000000) {
hi = 10000000000000;
break;
}
}
int64_t lo = 1;
while ((lo + 1) < hi) {
int64_t mid = FLOW_CHECKED_DIV(((lo + hi)), (2));
__int128 cv = c_value_i128_i64_i32_i32_ptr_i128_ptr_i128(mid, i, j, ui, uj);
if (cv <= N) {
lo = mid;
} else {
hi = mid;
}
}
__int128 cv_lo = c_value_i128_i64_i32_i32_ptr_i128_ptr_i128(lo, i, j, ui, uj);
int64_t M = ((cv_lo <= N) ? (lo) : ((lo - 1)));
free(((void*)(ui)));
free(((void*)(uj)));
return M;
}
int64_t binom_mod_i64_i32(int64_t n, int32_t k) {
if (k < 0) {
return 0;
}
if (k == 0) {
return FLOW_CHECKED_MOD((1), (MOD));
}
int64_t nn = FLOW_CHECKED_MOD((n), (MOD));
if (nn < 0) {
nn = (nn + MOD);
}
int64_t result = 1;
int32_t t = 0;
while (t < k) {
int64_t nt = FLOW_CHECKED_MOD(((nn - ((int64_t)(t)))), (MOD));
if (nt < 0) {
nt = (nt + MOD);
}
result = FLOW_CHECKED_MOD(((result * nt)), (MOD));
t = (t + 1);
}
int64_t kf = 1;
int32_t t2 = 1;
while (t2 <= k) {
kf = FLOW_CHECKED_MOD(((kf * ((int64_t)(t2)))), (MOD));
t2 = (t2 + 1);
}
return FLOW_CHECKED_MOD(((result * mod_inv_i64_i64(kf, MOD))), (MOD));
}
int64_t sum_for_pair_i32_i32_i64(int32_t i, int32_t j, int64_t M) {
int32_t deg = (i + j);
int64_t* fvals = (int64_t*)(calloc(((int64_t)((deg + 1))), 8));
int64_t n = 0;
while (n <= ((int64_t)(deg))) {
int64_t P = FLOW_CHECKED_MOD((((4 * n) + 2)), (MOD));
if (P < 0) {
P = (P + MOD);
}
int64_t u0 = 0;
int64_t u1 = FLOW_CHECKED_MOD((1), (MOD));
int64_t ri = 0;
int64_t rj = 0;
if (i == 0) {
ri = 0;
} else {
if (i == 1) {
ri = FLOW_CHECKED_MOD((1), (MOD));
} else {
ri = 0;
}
}
if (j == 0) {
rj = 0;
} else {
if (j == 1) {
rj = FLOW_CHECKED_MOD((1), (MOD));
} else {
rj = 0;
}
}
int32_t k = 2;
while ((k <= i || k <= j)) {
int64_t tmp = FLOW_CHECKED_MOD((((FLOW_CHECKED_MOD(((P * u1)), (MOD)) - FLOW_CHECKED_MOD((u0), (MOD))) + MOD)), (MOD));
u0 = u1;
u1 = tmp;
if (k == i) {
ri = u1;
}
if (k == j) {
rj = u1;
}
k = (k + 1);
}
int64_t tn = FLOW_CHECKED_MOD(((FLOW_CHECKED_MOD(((FLOW_CHECKED_MOD((n), (MOD)) * FLOW_CHECKED_MOD(((n + 1)), (MOD)))), (MOD)) * mod_inv_i64_i64(2, MOD))), (MOD));
fvals[n] = FLOW_CHECKED_MOD(((FLOW_CHECKED_MOD(((tn * ri)), (MOD)) * rj)), (MOD));
n = (n + 1);
}
int64_t* a = (int64_t*)(calloc(((int64_t)((deg + 1))), 8));
int64_t* cur = (int64_t*)(calloc(((int64_t)((deg + 1))), 8));
int64_t x = 0;
while (x <= ((int64_t)(deg))) {
cur[x] = fvals[x];
x = (x + 1);
}
int32_t nn = (deg + 1);
int32_t ci = 0;
while (nn > 0) {
a[ci] = cur[0];
ci = (ci + 1);
int32_t k = 0;
while (k < (nn - 1)) {
cur[k] = FLOW_CHECKED_MOD((((cur[(k + 1)] - FLOW_CHECKED_MOD((cur[k]), (MOD))) + MOD)), (MOD));
k = (k + 1);
}
nn = (nn - 1);
}
int64_t result = 0;
int64_t Mp1 = (M + 1);
int32_t m = 0;
while (m <= deg) {
int64_t binom = binom_mod_i64_i32(Mp1, (m + 1));
int64_t term = FLOW_CHECKED_MOD(((FLOW_CHECKED_MOD((a[m]), (MOD)) * binom)), (MOD));
result = FLOW_CHECKED_MOD(((result + term)), (MOD));
m = (m + 1);
}
free(((void*)(fvals)));
free(((void*)(a)));
free(((void*)(cur)));
return result;
}
int32_t maxJ_for_N(void) {
__int128 N = get_N_i128();
__int128 P = 6;
__int128 u0 = 0;
__int128 u1 = 1;
int32_t maxj = 1;
int32_t k = 2;
while (k < 400) {
__int128 tmp = ((P * u1) - u0);
u0 = u1;
u1 = tmp;
if (u1 > N) {
break;
}
maxj = k;
k = (k + 1);
}
return maxj;
}
int32_t main(void) {
int32_t maxj = maxJ_for_N();
int64_t total = 0;
int32_t i = 1;
while (i < maxj) {
int32_t j = (i + 1);
while (j <= maxj) {
if (gcd_ll_i64_i64(((int64_t)(i)), ((int64_t)(j))) == 1) {
int64_t M = max_n_for_pair_i32_i32(i, j);
if (M > 0) {
int64_t s = sum_for_pair_i32_i32_i64(i, j, M);
total = FLOW_CHECKED_MOD(((total + s)), (MOD));
}
}
j = (j + 1);
}
i = (i + 1);
}
printf("%lld\n", total);
return 0;
}