Skip to content

Instantly share code, notes, and snippets.

View marethyu's full-sized avatar
🙈
Playing hide and seek

Jimmy Yang marethyu

🙈
Playing hide and seek
View GitHub Profile
@marethyu
marethyu / README.md
Last active August 13, 2026 23:13
Minion Rush Windows Store Edition save data editor (AI generated)

Usage instructions

⚠️IMPORTANT⚠️: This save editor is outdated now. I created the better one here.


  1. Go to C:\Users\YOUR_USERNAME\AppData\Local\Packages\GAMELOFTSA.DespicableMeMinionRush_0pp20fcewvvtj\LocalState and fetch a copy of the file titled "savegame."
  2. Now run the following commands in your terminal:
python minion_save_decoder_v2_modified.py "savegame" --json savegame.json --plain-out savegame.bin
@marethyu
marethyu / tonarinoyp.py
Last active August 26, 2026 04:51
Python script to download full chapters from tonarinoyp.jp
import io
import os
import sys
import requests
from PIL import Image
HEADERS = {
'User-Agent': (
'Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_7) '
import requests
from bs4 import BeautifulSoup
LOGIN_URL = 'https://bunpro.jp/users/sign_in'
headers = {
'accept': 'text/html,application/xhtml+xml,application/xml;q=0.9,image/avif,image/webp,image/apng,*/*;q=0.8,application/signed-exchange;v=b3;q=0.7',
'accept-encoding': 'gzip, deflate, br, zstd',
'accept-language': 'en-US,en;q=0.9',
'cache-control': 'max-age=0',
@marethyu
marethyu / turing.py
Created April 6, 2024 22:33
Python script to simulate Turing machine.
"""
Turing machine implementation in Python
Example input:
(Machine to generate Collatz sequence)
0,I;1,I,R
1,I;2,I,L
2,I;3,I,R
@marethyu
marethyu / cw.py
Last active August 26, 2026 04:53
Script to fetch the latest chapter of a series in Comicwalker
import itertools
import json
import os
import sys
import requests
from bs4 import BeautifulSoup
CW_API_ENDPOINT = 'https://comic-walker.com/api'
SERIES_URL = 'https://comic-walker.com/detail/KC_000604_S?episodeType=first'
@marethyu
marethyu / simplex.py
Created February 11, 2024 22:32
Simplex method in Python
"""
The function simplex takes initial feasible dictionary of a LP problem with
m basic variables and n non-basic variables, represented by (m+1)x(n+1) matrix
wrapped in numpy.array, as its only input.
The format of the input matrix input is as follows:
In each row, the first column is reserved for additive constant
while the rest of the columns stores coefficients of non-basic variable.
The first row describes the objective function while the rest of the rows
list constraints. You can check some examples near the end of the file.
@marethyu
marethyu / pi.cpp
Created December 27, 2023 03:45
DFT demo
/* g++ pi.cpp -o pi -std=c++14 -lSDL2 */
/* Grab pi.csv from https://dsp.stackexchange.com/a/59181/70343 */
#include <iostream>
#include <fstream>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <algorithm>
import matplotlib.pyplot as plt
import numpy as np
from math import comb, log
def annotate_max(x, y, ax=None):
xmax = x[np.argmax(y)]
ymax = y.max()
text= "U_A={:.3f}, S={:.3f}".format(xmax, ymax)
if not ax:
# Draw 5 cards from the standard deck of 52 cards. Denote random variables X to be the number of black cards in the hand and Y to be the number of spades in the hand.
from math import comb
from pandas import DataFrame
nways = comb(52, 5)
joint_pmf = [[0.0 for x in range(7)] for y in range(7)]
total = 0.0
#include <iostream>
#include <bitset>
#include <cstdint>
#include <array>
using BYTE = uint8_t;
struct HALFWORD
{
union