原创 【2017瀋陽網絡賽】1005 hdu6198 number number number 找規律+矩陣快速冪

Problem Description We define a sequence F:⋅ F0=0,F1=1;⋅ Fn=Fn−1+Fn−2 (n≥2). Give you an integer k, if a positive n

原创 【2017廣西邀請賽】hdu 6185 Covering 矩陣快速冪

Problem Description Bob's school has a big playground, boys and girls always play games here after school. To protec

原创 【2017瀋陽網絡賽】1008 hdu6201 transaction transaction transaction 樹形dp

Problem Description Kelukin is a businessman. Every day, he travels around cities to do some business. On August 17t

原创 【2013南京現場賽】1002 hdu4803 Poor Warehouse Keeper 貪心

Problem Description Jenny is a warehouse keeper. He writes down the entry records everyday. The record is shown on a

原创 【2017瀋陽網絡賽】1004 hdu6197 array array array 最長不下降子序列

Problem Description One day, Kaitou Kiddo had stolen a priceless diamond ring. But detective Conan blocked Kiddo's p

原创 【多校訓練】hdu 6052 To my boyfriend 計數

Problem Description Dear Liao I never forget the moment I met with you. You carefully asked me: "I have a very diffi

原创 PE頭部IMAGE_NT_HEADERS

PE頭部是真正用來裝載Win32程序的頭部,PE頭的定義爲IMAGE_NT_HEADERS,該結構體包含PE標識符、文件頭與可選頭這三部分。 該頭部具有32位和64位之分。 32位的PE文件格式,IMAGE_NT_HEADERS32

原创 【2017青島網絡賽】1009 Smallest Minimum Cut hdu6214 最小割 最大流模版

Problem Description Consider a network G=(V,E) with source s and sink t. An s-t cut is a partition of nodes set V

原创 【2017新疆網絡賽】Our Journey of Dalian Ends 費用流

Life is a journey, and the road we travel has twists and turns, which sometimes lead us to unexpected places and unex

原创 內存文件映射(MMAP)

原文地址:內存文件映射(MMAP) 作者:Arthursky 文件操作是應用程序最爲基本的功能之一,Win32 API和MFC均提供有支持文件處理的函數和類,常用的有Win32 API的CreateFile()、WriteFile()、R

原创 【2017青島網絡賽】1006 hdu 6211 Pythagoras 打表+本原勾股數

Problem Description Given a list of integers a0,a1,a2,⋯,a2k−1. Pythagoras triples over 109 are all solutions of x2

原创 【2017青島網絡賽】1010 hdu 6215 Brute Force Sorting 雙向鏈表+隊列

Problem Description Beerus needs to sort an array of N integers. Algorithms are not Beerus's strength. Destruction

原创 bzoj 5047 空間傳送裝置 最短路

Description 太空中一共有n座星球,它們之間可以通過空間傳送裝置進行轉移。空間傳送裝置分爲m種,第i種裝置可以用4個參 數a_i,b_i,c_i,d_i來描述。因爲時空抖動的問題,在非整數時刻禁止使用空間傳送裝置。如果在整數

原创 bzoj 5043 密碼破譯 dp

Description  小Q發明了一個新的加密算法,對於一個長度爲n的非負整數序列a_1,a_2,...,a_n,他會隨機選擇一個非負整數k, 將每個數都異或上k得到b_1,b_2,...,b_n,即b_i=a_i xor k。不幸

原创 【2017青島網絡賽】hdu 6212 Zuma 1007 區間dp

Problem Description Think about the Zuma Game. You have a row of at most 200 black(0) or white(1) balls on the tabl