原创 HDU4405 Areoplane chess（期望dp）
Areoplane chess 傳送門1傳送門2 Hzz loves aeroplane chess very much. The chess map contains N+1 grids labeled from 0 to
2020-06-21 20:46:27
原创 HDU5155 Harry And Magic Box
Harry And Magic Box 傳送門1傳送門2 One day, Harry got a magical box. The box is made of n*m grids. There are sparking je
2020-06-21 20:46:27
原创 嗶哩嗶哩稿件號轉換
文章目錄文件調用型直接打開型 3-27 Upd：稍微優化了一下代碼，快速冪其實根本沒有必要。原先的代碼就撤下了。 —— 前幾天B站官方更改了稿件號碼的表示形式，許多人懷念過去的av號，那麼今天我提供一個C++代碼來轉換av號與BV
2020-03-28 22:32:45
原创 HDU3853 LOOPS
LOOPS 傳送門1傳送門2 Akemi Homura is a Mahou Shoujo (Puella Magi/Magical Girl). Homura wants to help her friend Madoka
2020-02-25 02:44:41
原创 HDU4055 Number String（計數dp）
Number String 傳送門1傳送門2 The signature of a permutation is a string that is computed as follows: for each pair of co
2020-02-25 02:44:41
原创 HDU6103 Kirinriki（區間dp+二分）
Kirinriki 傳送門1傳送門2 We define the distance of two strings A and B with same length n is disA,B=∑i=0n−1|Ai−Bn−1−i|
2020-02-25 02:44:41
原创 HDU5900 QSC and Master（區間dp）
QSC and Master 傳送門1傳送門2 Every school has some legends, Northeastern University is the same. Enter from the north
2020-02-25 02:44:41
原创 NOIP2016 Day1
T1 簡單模擬 分值:100 CODE #include<cstdio> #define FOR(i,a,b) for(int i=(a),i##_END_=(b);i<=i##_END_;i++) #define N 1000
2020-02-25 02:44:41
原创 HDU6212 Zuma（區間dp）
Zuma 傳送門1傳送門2 Think about the Zuma Game. You have a row of at most 200 black(0) or white(1) balls on the table at
2020-02-25 02:44:41
原创 NOIP2016 Day2
T1 楊輝三角算組合數+二維前綴和 水爆 分值:100 CODE #include<cstdio> #define N 2005 int C[N][N],cnt[N][N],t,k,n,m; int main() {
2020-02-25 02:44:41
原创 HDU4745 Two Rabbits（區間dp）
Two Rabbits 傳送門1傳送門2 Long long ago, there lived two rabbits Tom and Jerry in the forest. On a sunny afternoon, the
2020-02-25 02:44:41
原创 CF569D Symmetric and Transitive（組合數+集合分劃數）
文章目錄**Symmetric and Transitive****Input****Output****Sample Input****Sample Output****題意****分析****CODE** Symmetric an
2018-09-19 01:29:26
2
原创 ZOJ3349 Special Subsequence（dp+線段樹）
Special Subsequence 傳送門1傳送門2 There a sequence SS with nn integers , and AA is a special subsequence that satisfie
2018-09-17 06:02:13
原创 HDU3308 LCIS（線段樹區間合併）
LCIS 傳送門1傳送門2 Given n integers. You have two operations: U A B: replace the Ath number by B. (index counting fro
2018-09-17 06:02:13
原创 HDU4586 Play the Dice（數論）
Play the Dice 傳送門1傳送門2 There is a dice with n sides, which are numbered from 1,2,...,n and have the equal possibili
2018-09-13 09:16:39