__Meng

摘要： 起点是右下角 终点是左上角每次数据都是两行的点 输入n 表示有n列接下来来的2行是 列与列之间的距离最后一行是 行之间的距离枚举就行Sample test(s)input41 2 33 2 13 2 2 3output12input31 23 32 1 3output11input2111 1out... 阅读全文

摘要： Sample test(s)input50 1 0 1 1output4input71 0 1 0 0 1 0output4input10output0 1 # include 2 # include 3 # include 4 # include 5 # include 6 # incl... 阅读全文

摘要： 旋转卡壳Sample Input40 00 11 11 0Sample Output2 1 # include 2 # include 3 # include 4 # include 5 # include 6 # include 7 # include 8 # def... 阅读全文

摘要： 分治法Sample Input20 01 121 11 13-1.5 00 00 1.50 Sample Output0.710.000.75 1 # include 2 # include 3 # include 4 # include 5 # include 6 # include ... 阅读全文

摘要： 题意：1-N带编号的盒子,当编号满足A>B && A非空 && (A + B) % 3 == 0 && (A + B) % 2 == 1则可以从A中取任意石头到B中，谁不能取了谁就输。Alice先手 阶梯博弈:博弈在一列阶梯上进行,每个阶梯上放着自然数个点,两个人进行阶梯博弈，每一步则是将一个集体... 阅读全文

摘要： n个硬币围成一个环 每次只能取1-K个硬币 最后取完者胜假如5个硬币 每次取1-2个情况1 先手取1个 后手取剩下4个中间2个 破坏了连续 虽然最后剩2个，但先手只能取一个 然后后再取一个 后手胜情况2 先手取2个 后手取剩下3个中间的那1个 然后同理 后手胜Sample Input23 ... 阅读全文

摘要： 0代表可放 1带表不能放 每次放一个2*2的方块 不能放者败如果先手必胜则输出Yes必胜态：从当前状态所能到达的状态中存在一个必败态必败态：从当前状态所能达到的状态全部是必胜态Sample Input4 400000000000000004 40000001001000000 Sample Outp... 阅读全文

摘要： 操作1 l r 是原序列l-r的和操作2 l r 是从小到大排序后的l-r的和input66 4 2 7 2 732 3 61 3 41 1 6output24928 1 # include 2 # include 3 # include 4 # include 5 # include ... 阅读全文

摘要： 把一个字符串分成N个字符串 每个字符串长度为mSample Input12 5 // n mklmbbileay Sample Outputklmbbileay 1 # include 2 # include 3 # include 4 # include 5 # include 6 ... 阅读全文

摘要： 100MB=10^5KB=10^8B100MB=100*2^10KB=100*2^20BSample Input2100[MB]1[B] Sample OutputCase #1: 4.63%Case #2: 0.00% 1 # include 2 # include 3 # include ... 阅读全文