This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// this was my attempt to write my own php obfuscator | |
// this was inspired by Carbylamine PHP Script Encoder | |
// its currently in alpha, because sometimes its work, and sometimes it doesnt | |
// this was written 3 years ago (ahh memories again) | |
// so code looks suck | |
// thanks to Mokhdzani Faeq for created good regexs | |
// have fun! | |
<?php |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
#include <stdio.h> | |
int main(int argc, char *argv[]) | |
{ | |
puts(""); // space | |
if(argc == 1) | |
{ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// if using OOP, this program is actually not so pain in the ass to write.. | |
/* shahril : 18-jan-2016 | |
piece of advises to those "forces" who want to read my code | |
- code very mess up (this was written 1 year ago) | |
- this game isn't "computer vs human", it's "human vs human", the reason is my internal implementation | |
isn't compatible with chess engines that available online |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
using namespace std; | |
int SIZE_STRUCT; | |
int choose_process(struct process Process[], int running[], int size_running); | |
int get_total_burst_time(struct process Process[]); | |
int check_if_exist(int running[], int size_running, int check); | |
void add_running_process(struct process Process[], int running[], int &size_running, int i); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
angular | |
.module('webui.services.configuration', []) | |
.constant('$name', 'Aria2 WebUI') // name used across the entire UI | |
.constant('$titlePattern', 'active: {active} - waiting: {waiting} - stopped: {stopped} — {name}') | |
.constant('$pageSize', 11) // number of downloads shown before pagination kicks in | |
.constant('$authconf', { // default authentication configuration, never fill it in case the webui is hosted in public IP as it can be compromised | |
host: 'localhost', | |
port: 6800, | |
encrypt: false, | |
auth: { // either add the token field or the user and pass field, not both. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
#include <cmath> | |
#define MAXF 999999.0 | |
#define EPSILON 0.0000000001 | |
using namespace std; | |
int main() | |
{ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
#include <cctype> | |
using namespace std; | |
int validate_input(char input[]) | |
{ | |
char bool_zul[30] = {0}, *ptr = input; | |
while(*ptr) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
; cara nk guna : | |
; first convert jadi obj file guna nasm -> nasm -f elf32 test.asm -F dwarf -g | |
; then kena guna linker, guna gcc mudah -> gcc test.o -o test -m32 -ggdb | |
; kemudian run ./test | |
section .text | |
global main ; must be declared for linker (ld) | |
section .data | |
msg db 'Hello, world!', 0xa, 0x0 ; our dear string |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* References : | |
http://www.geeksforgeeks.org/dynamic-programming-set-4-longest-common-subsequence/ | |
https://www.ics.uci.edu/~eppstein/161/960229.html */ | |
#include <stdio.h> | |
#include <string.h> | |
#define MAX(X,Y) ((X) > (Y)) ? (X) : (Y) | |
char str[100]; |