Skip to content

Instantly share code, notes, and snippets.

@time-river
time-river / simple-tun-read-write.py
Last active June 6, 2018 18:51
a simple program which could print all package of content sended from local machine
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
'''
a simple program which could print all package of content sended from local machine
prepare:
# ip tuntap add mode tun tun0
# ip link set tun0 up
# ip addr add 10.0.0.2/24 dev tun0
# ip route add default via 10.0.0.2 dev tun0 table 100
@time-river
time-river / ip-datagram.py
Last active June 6, 2018 18:52
like '[simple-tun-read-write.py](https://gist.github.com/time-river/f2288ae1dbe8bfa5cc84a841c9a507ad)', but automatic configure tun device and route table.
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
'''
description:
like 'simple-tun-read-write.py', but automatic configure tun device and route table.
catch all ip packet and print
'IP protocol version + IP header size'
'protocol of encapsulated packet'
'source IP'
@time-river
time-river / one_zero_pack-2.cpp
Last active July 31, 2018 10:42
背包九讲之01背包,一维(滚动)数组解法
/*
* 背包九讲之01背包 滚动数组
* from: http://www.hawstein.com/posts/dp-knapsack.html
*/
#include <bits/stdc++.h>
using namespace std;
#define MAXN 1000
@time-river
time-river / one_zero_pack-1.cpp
Last active July 31, 2018 10:43
背包九讲之01背包,二维数组解法,打印选择的背包
/*
* 背包九讲之01背包 二维数组
* from: http://www.hawstein.com/posts/dp-knapsack.html
*/
#include <bits/stdc++.h>
using namespace std;
#define MAXN 1000
@time-river
time-river / complete_pack-1.cpp
Created July 31, 2018 10:47
背包九讲之完全背包,恰好装满,二维数组
/*
* 背包九讲之完全背包 恰好装满 二维数组
* from: http://acm.hdu.edu.cn/showproblem.php?pid=1114
* reference: https://blog.csdn.net/liujc_/article/details/44003167
*/
#include <bits/stdc++.h>
#define NMAX 500
#define PMAX 1000000001
@time-river
time-river / complete_pack-2.cpp
Created July 31, 2018 10:48
背包九讲之完全背包,恰好装满,一维(滚动)数组
/*
* 背包九讲之完全背包 恰好装满 滚动数组
* from: http://acm.hdu.edu.cn/showproblem.php?pid=1114
* reference: https://blog.csdn.net/liujc_/article/details/44003167
*/
#include <bits/stdc++.h>
#define PMAX 1000000001
@time-river
time-river / multiple_pack-1.cpp
Created July 31, 2018 10:54
背包九讲之多重背包,二维数组
/*
* 背包九讲之多重背包 二维数组
* from: http://acm.hdu.edu.cn/showproblem.php?pid=2191
* reference: https://blog.csdn.net/hellobabygogo3/article/details/7993547
*/
#include <bits/stdc++.h>
using namespace std;
@time-river
time-river / multiple_pack-2.cpp
Created July 31, 2018 10:55
背包九讲之多重背包 一维数组
/*
* 背包九讲之多重背包 一维数组
* from: http://acm.hdu.edu.cn/showproblem.php?pid=2191
* reference: https://blog.csdn.net/hellobabygogo3/article/details/7993547
*/
#include <bits/stdc++.h>
using namespace std;
@time-river
time-river / permutations.py
Last active May 7, 2019 13:56
consideration of permutations.
'''
link
- https://leetcode.com/problems/permutations/
problem:
Given a collection of distinct integers, return all possible permutations.
Example:
Input: [1,2,3]
Output:
[
@time-river
time-river / strncat-demo.c
Last active September 30, 2019 11:00
a strncat tests
/**
* strncat test
* build: gcc -o strncpy strncpy.c -lcrypto
* output:
* $ ./strncpy
* time: 1569841068 sha256(long): H8Zw/CnxF9d/kG10Ck7VfDMNqWADDGMsrD7Wx0wTshY=
* sha256(short): H8Zw/CnxF9d/
* time: 1569841069 sha256(long): uyzMNURXeyOjyCZ1ANI6Lze6lwF1bKUPjU3rHBZyTNY=
* sha256(short): H8Zw/CnxF9d/uyzMNURXeyOj
* time: 1569841070 sha256(long): 1zdqJgOCuILZkti92I2YUuT/KGNuqmSPOioA8rjxEeg=