Here is my code
apol_twin(n) = {
v = vecsort(apol_makeall(n, 1), [1, 2, 3, 4]);
list = List();
for(i = 1, #v,
if(v[i][2] == v[i][3] || v[i][3] == v[i][4],
listput(list, v[i]);
return(v[i]);
);
);
}
For the output, it only returns the f...
![[earlier] "Your vintage-style handmade chest business is struggling. But I have a plan."](https://imgs.xkcd.com/comics/treasure_chests.png "[earlier] \"Your vintage-style handmade chest business is struggling. But I have a plan.\"")
I've implemented a basic Trie that is supposed to work only with lowercase English letters.
class TrieNode {
public:
array<shared_ptr<TrieNode>, 26> children;
bool isWord;
TrieNode(bool _isWord = false) : isWord{_isWord} {
}
};
class Trie {
public:
Trie() : root{make_shared<...
I wrote a bare-bones, no fluff, base 64 library in C. My goal was to make it as small as possible. I'm wondering if there are any further size optimizations I can make (without sacrificing too much readability).
#include <arpa/inet.h>
#include <stdint.h>
#include <stdio.h>
#include <string.h>
#...
/* let's compile using: gcc main.c -Wall -Wextra --pedantic --std=c2x -D_GNU_SOURCE -Ofast -march=corei7 -mtune=corei7 */
/* Linux headers begin */
#include <dirent.h>
#include <sys/stat.h>
#include <unistd.h>
/* Linux headers end */
#include <stdlib.h>
#include <errno.h>
#include <stdio.h>
#in...
I have been working on making a transpiler from Brainfuck to C in C(11), here is the code:
#include <stdio.h>
#include <stdlib.h>
int main(int argc, char **argv) {
size_t indentlevel = 1;
size_t repetition = 1;
FILE *fin, *fout;
int c;
if (argc != 3) {
if (argc > 0 &&...
Let the Proposition P(n) be f(n) = (n-1)*10 +10
Then Base Case P(1) is f(1) = (1-1)*10 +10 = 10
The Inductive Hypothesis step P(k) is f(k) = (k-1)*10 + 10 = k*10
Using strong induction, if in the Inductive Hypothesis step the proposition P(k) is assumed to be true, then P(k-1) , P(k-2) , P(k-3) ...
