AKEJYO
RECORDS — WRITING

Things worth keeping.

Research, working notes, and small observations.
A collection in progress, arranged from newest to oldest.

THE RECORDS28 records
RECORD / 024

What is Base64 and how to base anything?

CTF3 min read

When you see a string like RG8gdSBrbm93IEJBU0U2ND8=, random letters and numbers with = at the end, you should guess it might be a Base64 string. How does it work? How to write you

READ
RECORD / 14

复刻明日方舟官网粒子特效

FrontEnd6 min read

看到这个粒子效果,我第一反应是真实的物理模拟,然后我嗯写俩小时加速度写了个抽象玩意出来😎,思路错的很。还好洗澡的时候想明白了()

READ
RECORD / 013

TX·IEG菁英班3期作业wp

Re19 min read

使用Windows API CreateRemoteThread 远程注入模块到 crackme 进程中并且不崩溃,然后使用 ark 工具(例如 processhacker 等)能够查看注入模块的信息;

READ
RECORD / 009

Linux初步

Linux1 min read

VMware 安卓 Ubuntu,固定 IP,SSH 远程登录

READ
RECORD / 008

Parameterized algorithms

Algorithms59 min read

F is the family of sets over a universe U, k is a positive integer. The task is to check whether there exists a subfamily F' \subseteq F of size k that covers U, which means that e

READ
RECORD / 006

QQ机器人制作

Bot1 min read

BV1aZ4y1f7e2是很好的教程,我自己摸索很久最后还是看了这个教程,简单有效

READ
RECORD / 1

暑期集训 Data Structures

ACM26 min read

题意:有n个罐子,每个罐子有坚固度a_i,同时有m个钥匙,每个钥匙型号为b_i,可以打开坚固度恰好为b_i的罐子。我们可以不断攻击罐子,每次攻击让罐子的坚固度x变为x/d(向下取整)。Q次询问,每次询问L到R区间,在满足用钥匙开罐子最多的情况下,使用钥匙的最少数。

READ
RECORD / 002

暑期集训DP

ACM25 min read

题意: 有A,B两个字符串,求f(a,b)_{max} = x*LCS(a,b)-y*|a|-z*|b|,其中x,y,z是题目里给的常数,a,b是A,B在子串。

READ
RECORD / 3

暑期集训图论

ACM34 min read

题意:给定一个无向连通图,求至少要去掉几条边才能使图不连通,即求无向连通图的最小割

READ
RECORD / 004

暑期集训数学和计算几何

ACM22 min read

题意:给定n个点,顺次连接这些点得到折线。m次询问,每次给出一个点,询问折线绕该点的回转数

READ