YoungForest

1. terminator / iterm2
2. oh my zsh

YoungForest

; Summary: Proxy Switchy! Exported Rule List
; Date: 5/23/2017
; Website: http://bit.ly/proxyswitchy

#BEGIN

[wildcard]
*://*github.com/*
*://*google.com.hk/*

YoungForest

# requirements: sudo apt-get install memtester
import sys
import os


def main():
    if len(sys.argv) != 2 and len(sys.argv) !=3:
        sys.exit("Usuage: %s <memory> [iterations]" % (sys.argv[0]))
    if len(sys.argv) == 3:
        iteration = int(sys.argv[2])

YoungForest

import time
import sys
import os

def main():
    if (len(sys.argv) != 3):
        sys.exit("Ususage: %s diskname level.(level can be 0, 1, 2, 3, Bigger level means higher disk read speed.)" %(sys.argv[0])) 
    disk = sys.argv[1]
    # disk = r'/tmp/tmpfile'
    disk += '1'

YoungForest

import time
import sys

def main():
    if (len(sys.argv) != 3):
        sys.exit("Ususage: %s diskname level.(level can be 0, 1, 2, 3, Bigger level means higer disk read speed.)" %(sys.argv[0])) 
    disk = sys.argv[1]
    # disk = r'/dev/vda'
    if sys.argv[2] == '0':
        speed = 10

YoungForest

#include <stdio.h>
#include <stdlib.h>
#include <sys/time.h>
#include <sched.h>

#define PIECE 1

unsigned GetTickCount()
{
        struct timeval tv;

YoungForest

#include <stdio.h>
#include <stdlib.h>
#define MAX 9 /*定义最大为9阶行列式*/

int Fun(int n, int a[MAX][MAX] ); /*函数声明*/
int main()
{
    int n = 0; /*初始化阶数n*/
    int i = 0, j = 0; /*i,j分别表示行与列*/
    int a[MAX][MAX] = {{0}}; /*定义行列式*/