原创 C++二叉樹模板類的實現
#ifndef BINARY_TREE_H #define BINARY_TREE_H #include <array> #include <memory> #include <type_traits> template <t
原创 異或、與、加法恆等式
a+b=a⊕b+2(a&b)a+b−2(a&b)=a⊕b a+b=a\oplus b+2(a\&b)\\ a+b-2(a\&b)=a\oplus b a+b=a⊕b+2(a&b)a+b−2(a&b)=a⊕b
原创 C語言中rand()不是線程安全的函數-多線程應使用rand_r()
這是glibc中rand_r的實現: /* This algorithm is mentioned in the ISO C standard, here extended for 32 bits. */ int rand
原创 C/C++求出最低比特位的位置的宏
#define HASLOWBITS(x, y) ((x) & ((1ULL << (y)) - 1)) #define CONDSHR(x, y) (HASLOWBITS(x, y) ? (x) : (x) >> (y)) #d
原创 POJ3641 Pseudoprime numbers - 樸素素數判斷 + 快速冪運算
Pseudoprime numbers Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 14334 Accepted: 6215 Descripti
原创 POJ1795 DNA Laboratory - 狀態壓縮 - 動態規劃(dp) - 字典序最小dp路徑 - 旅行商問題
DNA Laboratory Time Limit: 5000MS Memory Limit: 30000K Total Submissions: 3242 Accepted: 615 Description Backg
原创 HDU6611 K Subsequence - 費用流
K Subsequence Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submiss
原创 POJ2429 GCD & LCM Inverse - 數論 - 質因子分解 - Pollard-pho算法
GCD & LCM Inverse Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 20548 Accepted: 3774 Description G
原创 POJ1150 The Last Non-zero Digit - 數論 - 模運算
The Last Non-zero Digit Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 5783 Accepted: 1810 Descrip
原创 hihoCoder1877 Approximate Matching - AC自動機 - 動態規劃(dp)
Approximate Matching 時間限制:1000ms 單點時限:1000ms 內存限制:512MB 描述 String matching, a common problem in DNA sequence analys
原创 HDU6656 Kejin Player - 動態規劃DP - 數學期望
Kejin Player Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others) Total Submissi
原创 POJ1995 Raising Modulo Numbers - 快速冪運算
Raising Modulo Numbers Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 13915 Accepted: 8242 Descri
原创 HDU6638 Snowy Smile - 稀疏矩陣的最大子矩陣和 - 座標離散化 - 線段樹 - 最大子段和
Snowy Smile Time Limit: 4000/4000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others) Total Submissio
原创 POJ2217 Secretary、POJ2774 Long Long Message - 最長公共子串 - 字符串哈希+二分/後綴數組
Secretary、Long Long Message 題目大概意思: 給出兩個字符串 S,TS,TS,T ,求 SSS 與 TTT 的最大公共子串的長度。其中 S,TS,TS,T 的長度均不超過 10510^5105 .
原创 POJ3417 Network - 樹鏈剖分+樹狀數組 / 樹上差分
Network Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 8651 Accepted: 2472 Description Yixght is a