Free games for graphing calculators: NumWorks, TI-Nspire CX, Casio fx-CG50 and soon TI-84 Plus CE. Balatro, Celeste, Hollow Knight, Minecraft and more.
C calculatorcalculator-gamescasiochesscrossy-roaddrive-madfx-cg50gamesgeometry-dashgraphing-calculatorndlessnumworksnumworks-appsnumworks-calculatornumworks-gamenumworks-gamestetristi-84-plus-ceti-nspire
/* Saves: the progress (fnaf.sav: the night reached, the stars), the night as it was when Home quit
* (fnafres.sav, read once on the next start), and a copy of both in a Python script: installing apps from the
* NumWorks website keeps only Python scripts, so the saves come back from it when the files themselves are
* gone. Each is a comment line "#>name:base64" (the way NumPlay and its big games keep theirs). */
#include <string.h>
#include "game.h"
#include "plat.h"
#define SAVE_NAME "fnaf.sav"
#define RESUME_NAME "fnafres.sav"
#define COPY_NAME "fnaf_saves.py"
#define MAGIC 0x46414E46u /* "FNAF" */
#define VERSION 1
typedef struct {
uint32_t magic;
uint8_t version, reached, stars, keys_seen;
int8_t custom[4]; /* the custom night's last levels */
} Progress;
typedef struct {
uint32_t magic;
uint32_t size;
Night n;
} Resume;
static const char *const kept[] = {SAVE_NAME, RESUME_NAME};
#define NKEPT (int)(sizeof kept / sizeof kept[0])
static const char copy_head[] = "# Five Nights at Freddy's saves: keep this file\n";
static const char b64[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
static void copy_write(void) {
uint32_t total = 1 + (sizeof copy_head - 1) + 1, len;
int n = 0;
for (int k = 0; k < NKEPT; k++)
if (plat_load(kept[k], &len) && len) total += 2 + (uint32_t)strlen(kept[k]) + 1 + (len + 2) / 3 * 4 + 1, n++;
plat_remove(COPY_NAME);
if (!n) return;
uint8_t *o = plat_reserve(COPY_NAME, total), *p = o;
if (!o) return;
*p++ = 0; /* (the script's status byte: not imported) */
memcpy(p, copy_head, sizeof copy_head - 1), p += sizeof copy_head - 1;
for (int k = 0; k < NKEPT; k++) {
const uint8_t *d = plat_load(kept[k], &len);
if (!d || !len) continue;
uint32_t nl = (uint32_t)strlen(kept[k]);
*p++ = '#', *p++ = '>';
memcpy(p, kept[k], nl), p += nl;
*p++ = ':';
for (uint32_t i = 0; i < len; i += 3, p += 4) {
/* (written out: GCC 15.2 for the calculator got a loop over the four wrong, see NumPlay's
* launcher/src/storage.c) */
uint32_t left = len - i, v = (uint32_t)d[i] << 16 | (left > 1 ? d[i + 1] << 8 : 0) | (left > 2 ? d[i + 2] : 0);
p[0] = (uint8_t)b64[v >> 18 & 63];
p[1] = (uint8_t)b64[v >> 12 & 63];
p[2] = left > 1 ? (uint8_t)b64[v >> 6 & 63] : '=';
p[3] = left > 2 ? (uint8_t)b64[v & 63] : '=';
}
*p++ = '\n';
}
*p++ = 0;
plat_reserved(COPY_NAME, (uint32_t)(p - o));
}
static int b64_value(uint8_t c) {
for (int i = 0; i < 64; i++)
if ((uint8_t)b64[i] == c) return i;
return -1;
}
static const uint8_t *copy_line(int k, uint32_t *len) {
uint32_t n, nl = (uint32_t)strlen(kept[k]);
const uint8_t *c = plat_load(COPY_NAME, &n);
if (!c) return NULL;
for (uint32_t i = 0; i + nl + 3 <= n; i++)
if (c[i] == '#' && c[i + 1] == '>' && !memcmp(c + i + 2, kept[k], nl) && c[i + 2 + nl] == ':') {
const uint8_t *l = c + i + 3 + nl;
uint32_t m = 0;
while (l + m < c + n && l[m] != '\n' && l[m]) m++;
*len = m;
return l;
}
return NULL;
}
void save_restore_copy(void) {
for (int k = 0; k < NKEPT; k++) {
uint32_t have, len;
if (plat_load(kept[k], &have)) continue;
const uint8_t *l = copy_line(k, &len);
if (!l || !len || len % 4) continue;
uint32_t size = len / 4 * 3 - (l[len - 1] == '=') - (l[len - 2] == '=');
uint8_t *out = plat_reserve(kept[k], size);
if (!out) continue;
l = copy_line(k, &len);
bool ok = l != NULL && len / 4 * 3 - (l[len - 1] == '=') - (l[len - 2] == '=') == size;
uint32_t o = 0;
for (uint32_t i = 0; ok && i < len; i += 4) {
int v0 = l[i] == '=' ? 0 : b64_value(l[i]), v1 = l[i + 1] == '=' ? 0 : b64_value(l[i + 1]);
int v2 = l[i + 2] == '=' ? 0 : b64_value(l[i + 2]), v3 = l[i + 3] == '=' ? 0 : b64_value(l[i + 3]);
if (v0 < 0 || v1 < 0 || v2 < 0 || v3 < 0) ok = false;
uint32_t wd = (uint32_t)(v0 << 18 | v1 << 12 | v2 << 6 | v3);
if (o < size) out[o++] = (uint8_t)(wd >> 16);
if (o < size) out[o++] = (uint8_t)(wd >> 8);
if (o < size) out[o++] = (uint8_t)wd;
}
if (ok && o == size) plat_reserved(kept[k], size);
else plat_remove(kept[k]);
}
}
void save_progress(void) {
Progress p;
memset(&p, 0, sizeof p);
p.magic = MAGIC, p.version = VERSION;
p.reached = g.reached, p.stars = g.stars, p.keys_seen = g.keys_seen;
memcpy(p.custom, g.custom, sizeof p.custom);
plat_save(SAVE_NAME, &p, sizeof p);
copy_write();
}
void save_load(void) {
uint32_t len;
const uint8_t *d = plat_load(SAVE_NAME, &len);
g.reached = 1;
if (!d || len != sizeof(Progress)) return;
Progress p;
memcpy(&p, d, sizeof p);
if (p.magic != MAGIC || p.version != VERSION) return;
g.reached = p.reached >= 1 && p.reached <= 5 ? p.reached : 1;
g.stars = p.stars & 7;
g.keys_seen = p.keys_seen;
for (int k = 0; k < 4; k++) g.custom[k] = p.custom[k] >= 0 && p.custom[k] <= 20 ? p.custom[k] : 0;
}
void save_resume(void) {
Resume r;
memset(&r, 0, sizeof r);
r.magic = MAGIC, r.size = sizeof(Night), r.n = g.n;
plat_save(RESUME_NAME, &r, sizeof r);
copy_write();
}
bool save_resume_load(void) {
uint32_t len;
const uint8_t *d = plat_load(RESUME_NAME, &len);
if (!d) return false;
bool ok = false;
if (len == sizeof(Resume)) {
Resume r;
memcpy(&r, d, sizeof r);
if (r.magic == MAGIC && r.size == sizeof(Night) && r.n.night >= 1 && r.n.night <= 7) {
g.n = r.n;
ok = true;
}
}
plat_remove(RESUME_NAME);
copy_write();
return ok;
}