Skip to content

Instantly share code, notes, and snippets.

View SorataBaka's full-sized avatar
:octocat:

Christian Harjuno SorataBaka

:octocat:
View GitHub Profile
AL: EQU 80H
AH: EQU 81H
BL: EQU 82H
BH: EQU 83H
RL: EQU 84H
RH: EQU 85H
LD ACC, 0
ST ACC, [RL]
ST ACC, [RH]
@SorataBaka
SorataBaka / index.d.ts
Last active October 27, 2023 11:11
Jmdict 3.5.0 Type Annotation
// To parse this data:
//
// import { Convert, IndexD } from "./file";
//
// const indexD = Convert.toIndexD(json);
//
// These functions will throw an error if the JSON doesn't
// match the expected interface, even if the JSON is valid.
export interface IndexD {
@SorataBaka
SorataBaka / c-0428.c
Last active May 26, 2023 02:55
Simle VIM training game made in c
#include <ncurses.h>
#include <stdlib.h>
int main(void){
int x = 10, y = 10;
int key;
int w, h;
char * lt = "d^))";
char * rt = "(( ^b";
@SorataBaka
SorataBaka / drill.c
Last active April 21, 2023 14:05
c-0421/lesson-2
#include <stdio.h>
#include <stdlib.h> // rand() を使うために必要
#define MAX_SIZE 75
#define true 1
typedef struct {
int x;
int y;
int answer;
int input;
} Question;
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
// Linked list learning
struct node {
int umur;
char nama[30];
//Points to the next node
struct node *nextNode;
};
@SorataBaka
SorataBaka / mergeSort.c
Last active January 14, 2022 18:47
merge sort in C language
int arr[] = {0, 1, 2, 3};
void merge(int l, int m, int r){
int temp[100];
int idx = 0;
int leftPivot = l;
int rightPivot = m + 1;
while(leftPivot <= m && rightPivot <= r){
if(arr[leftPivot] < arr[rightPivot]){
temp[idx++] = arr[leftPivot++];
@SorataBaka
SorataBaka / keepAlive.js
Created October 6, 2021 11:37
Keep alive function for replit hosted repos
const axios = require('axios')
const express = require("express")
const app = new express()
app.all("/", (req, res) =>{
return res.send("Pong!")
})
app.listen(3000, () =>{
console.log("Application listening on port 3000")
})