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
#!/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 |
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
#!/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' |
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
/* | |
* 背包九讲之01背包 滚动数组 | |
* from: http://www.hawstein.com/posts/dp-knapsack.html | |
*/ | |
#include <bits/stdc++.h> | |
using namespace std; | |
#define MAXN 1000 |
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
/* | |
* 背包九讲之01背包 二维数组 | |
* from: http://www.hawstein.com/posts/dp-knapsack.html | |
*/ | |
#include <bits/stdc++.h> | |
using namespace std; | |
#define MAXN 1000 |
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
/* | |
* 背包九讲之完全背包 恰好装满 二维数组 | |
* 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 |
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
/* | |
* 背包九讲之完全背包 恰好装满 滚动数组 | |
* 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 |
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
/* | |
* 背包九讲之多重背包 二维数组 | |
* 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; |
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
/* | |
* 背包九讲之多重背包 一维数组 | |
* 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; |
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
''' | |
link | |
- https://leetcode.com/problems/permutations/ | |
problem: | |
Given a collection of distinct integers, return all possible permutations. | |
Example: | |
Input: [1,2,3] | |
Output: | |
[ |
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
/** | |
* 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= |
OlderNewer