<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[弱菜zc]]></title><description><![CDATA[我好菜啊!!     ]]></description><link>https://blog.youkuaiyun.com/zchahaha</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; zchahaha]]></copyright><item><title><![CDATA[PE头部IMAGE_NT_HEADERS]]></title><link>https://blog.youkuaiyun.com/zchahaha/article/details/79020252</link><guid>https://blog.youkuaiyun.com/zchahaha/article/details/79020252</guid><author>zchahaha</author><pubDate>Wed, 10 Jan 2018 10:08:48 +0800</pubDate><description><![CDATA[PE头部是真正用来装载Win32程序的头部，PE头的定义为IMAGE_NT_HEADERS，该结构体包含PE标识符、文件头与可选头这三部分。

该头部具有32位和64位之分。


32位的PE文件格式，IMAGE_NT_HEADERS32定义如下：





[cpp] view
 plain copy






typedef struct _IMAGE_]]></description><category></category></item><item><title><![CDATA[内存文件映射(MMAP)]]></title><link>https://blog.youkuaiyun.com/zchahaha/article/details/79017418</link><guid>https://blog.youkuaiyun.com/zchahaha/article/details/79017418</guid><author>zchahaha</author><pubDate>Tue, 09 Jan 2018 21:04:05 +0800</pubDate><description><![CDATA[原文地址：内存文件映射(MMAP) 作者：Arthursky

文件操作是应用程序最为基本的功能之一，Win32 API和MFC均提供有支持文件处理的函数和类，常用的有Win32 API的CreateFile()、WriteFile()、ReadFile()和MFC提供的CFile类等。一般来说，以上这些函数可以满足大多数场合的要求，但是对于某些特殊应用领域所需要的动辄几十GB、几百GB、乃至]]></description><category></category></item><item><title><![CDATA[frp实现内网穿透]]></title><link>https://blog.youkuaiyun.com/zchahaha/article/details/78554392</link><guid>https://blog.youkuaiyun.com/zchahaha/article/details/78554392</guid><author>zchahaha</author><pubDate>Thu, 16 Nov 2017 19:21:31 +0800</pubDate><description><![CDATA[如果想在外网连接内网，我们可以使用frp实现内网穿透。
中文文档：https://github.com/fatedier/frp/blob/master/README_zh.md
你需要一个公网IP的机器X，内网IP的机子Y。





首先把两台机器的防火墙打开。




公网IP的机器：

下载

wget https://github.com/fatedie]]></description><category></category></item><item><title><![CDATA[bzoj 5047 空间传送装置 最短路]]></title><link>https://blog.youkuaiyun.com/zchahaha/article/details/78272966</link><guid>https://blog.youkuaiyun.com/zchahaha/article/details/78272966</guid><author>zchahaha</author><pubDate>Wed, 18 Oct 2017 15:02:16 +0800</pubDate><description><![CDATA[Description

太空中一共有n座星球，它们之间可以通过空间传送装置进行转移。空间传送装置分为m种，第i种装置可以用4个参
数a_i,b_i,c_i,d_i来描述。因为时空抖动的问题，在非整数时刻禁止使用空间传送装置。如果在整数s时刻使用装
置，那么需要花费((a_i*s+b_i) mod c_i)+d_i单位时间才能完成传送。现在是s时刻，小Q位于1号星球，请写一个
程序计算从]]></description><category></category></item><item><title><![CDATA[bzoj 5045 打砖块   优先队列]]></title><link>https://blog.youkuaiyun.com/zchahaha/article/details/78258253</link><guid>https://blog.youkuaiyun.com/zchahaha/article/details/78258253</guid><author>zchahaha</author><pubDate>Tue, 17 Oct 2017 11:07:07 +0800</pubDate><description><![CDATA[Description

小Q最近沉迷于一款新型《打砖块》游戏。在每局游戏中，呈现在屏幕上的是一堵无限大小的墙壁。墙壁上镶嵌着
无数长度为2、宽度为1的砖块。墙壁被分成若干行，每行宽度都为1，相邻两个格子形成一个砖块。相邻两行的砖
块是间隔摆放的。墙壁从下往上行编号递增，从左往右列编号递增。如下图所示：

在游戏的一开始，有n块砖块消失了。如果两块在同一行且相邻的砖块都消失了，那么玩家]]></description><category></category></item><item><title><![CDATA[bzoj 5044 岛屿生成  构造]]></title><link>https://blog.youkuaiyun.com/zchahaha/article/details/78255390</link><guid>https://blog.youkuaiyun.com/zchahaha/article/details/78255390</guid><author>zchahaha</author><pubDate>Mon, 16 Oct 2017 22:39:56 +0800</pubDate><description><![CDATA[Description

小Q设计了一款2D游戏，它的地图建立在二维笛卡尔坐标系上。这个游戏最大的特色就是可以随机生成地图，但是
岛屿生成却给小Q带来了巨大的麻烦。一个岛屿可以看成一个恰好有n个顶点的简单多边形，每个顶点的坐标都必须
是整数，同时为了防止精度误差，每条边的长度也必须是整数。为了体现程序的随机性，任何一条边都不能与x轴
或者y轴平行。当然，这个多边形不能自交，也不允许连续3]]></description><category></category></item><item><title><![CDATA[bzoj 5043 密码破译  dp]]></title><link>https://blog.youkuaiyun.com/zchahaha/article/details/78254760</link><guid>https://blog.youkuaiyun.com/zchahaha/article/details/78254760</guid><author>zchahaha</author><pubDate>Mon, 16 Oct 2017 21:38:21 +0800</pubDate><description><![CDATA[Description

 小Q发明了一个新的加密算法，对于一个长度为n的非负整数序列a_1,a_2,...,a_n，他会随机选择一个非负整数k，
将每个数都异或上k得到b_1,b_2,...,b_n，即b_i=a_i xor k。不幸的是，健忘的小Q睡了一觉之后就把密钥k忘得
一干二净了，不过他隐约记得a_1+a_2+...+a_n的值为m，你能帮他找到一个可行的密钥吗


Inp]]></description><category></category></item><item><title><![CDATA[UVALive 7139 Rotation   二维vector+矩阵前缀和 【模版】]]></title><link>https://blog.youkuaiyun.com/zchahaha/article/details/78156643</link><guid>https://blog.youkuaiyun.com/zchahaha/article/details/78156643</guid><author>zchahaha</author><pubDate>Tue, 03 Oct 2017 22:26:21 +0800</pubDate><description><![CDATA[题目大意：给一个n*m的矩阵，每个方块上有一个人。现在有一辆车在左上角的格点处，矩阵里的人都会一直面向那辆车。现在给出车的移动路线，问每个人总旋转角度的平方和是多少。若一个人顺时针旋转10个圈，逆时针旋转15个圈，最终算旋转角度为5个圈。
思路：根据题意，车一定会回到原点，那么每个人的初始面向方向与最终面向方向相同，每个人旋转的圈数都必将是整数。
若车在人的正左方下降了X次，上升了Y次，那么那]]></description><category></category></item><item><title><![CDATA[【2017新疆网络赛】Our Journey of Dalian Ends 费用流]]></title><link>https://blog.youkuaiyun.com/zchahaha/article/details/78066724</link><guid>https://blog.youkuaiyun.com/zchahaha/article/details/78066724</guid><author>zchahaha</author><pubDate>Fri, 22 Sep 2017 20:34:36 +0800</pubDate><description><![CDATA[Life is a journey, and the road we travel has twists and turns, which sometimes lead us to unexpected places and unexpected people.
Now our journey of Dalian ends. To be carefully considered are the ]]></description><category></category></item><item><title><![CDATA[【2017青岛网络赛】1010 hdu 6215 Brute Force Sorting 双向链表+队列]]></title><link>https://blog.youkuaiyun.com/zchahaha/article/details/78049476</link><guid>https://blog.youkuaiyun.com/zchahaha/article/details/78049476</guid><author>zchahaha</author><pubDate>Thu, 21 Sep 2017 10:58:09 +0800</pubDate><description><![CDATA[Problem Description

Beerus needs to sort an array of N integers.
 Algorithms are not Beerus's strength. Destruction is what he excels. He can destroy all unsorted numbers in the array simultaneous]]></description><category></category></item><item><title><![CDATA[【2017青岛网络赛】1006 hdu 6211 Pythagoras  打表+本原勾股数]]></title><link>https://blog.youkuaiyun.com/zchahaha/article/details/78045961</link><guid>https://blog.youkuaiyun.com/zchahaha/article/details/78045961</guid><author>zchahaha</author><pubDate>Wed, 20 Sep 2017 21:45:14 +0800</pubDate><description><![CDATA[Problem Description

Given a list of integers a0,a1,a2,⋯,a2k−1.
 Pythagoras triples over 109 are
 all solutions of x2+y2=z2 where x,y and z are
 constrained to be positive integers less than or e]]></description><category></category></item><item><title><![CDATA[【2017青岛网络赛】1004 hdu 6209 The Intersection 二分]]></title><link>https://blog.youkuaiyun.com/zchahaha/article/details/78033913</link><guid>https://blog.youkuaiyun.com/zchahaha/article/details/78033913</guid><author>zchahaha</author><pubDate>Tue, 19 Sep 2017 19:58:47 +0800</pubDate><description><![CDATA[Problem Description

A given coefficient K leads
 an intersection of two curves f(x) and gK(x).
 In the first quadrant, the curve f is
 a monotone increasing function that f(x)=x√.
 The curve g]]></description><category></category></item><item><title><![CDATA[2017 ACM/ICPC Asia Regional Qingdao Online 1007 hdu 6212 Zuma 区间dp]]></title><link>https://blog.youkuaiyun.com/zchahaha/article/details/78026747</link><guid>https://blog.youkuaiyun.com/zchahaha/article/details/78026747</guid><author>zchahaha</author><pubDate>Tue, 19 Sep 2017 10:03:08 +0800</pubDate><description><![CDATA[Problem Description

Think about the Zuma Game. You have a row of at most 200 black(0)
 or white(1) balls on the table at the start. Each three consecutive balls never share the same colour. You al]]></description><category></category></item><item><title><![CDATA[【2017青岛网络赛】1009 Smallest Minimum Cut hdu6214 最小割    最大流模版]]></title><link>https://blog.youkuaiyun.com/zchahaha/article/details/78023670</link><guid>https://blog.youkuaiyun.com/zchahaha/article/details/78023670</guid><author>zchahaha</author><pubDate>Mon, 18 Sep 2017 20:55:20 +0800</pubDate><description><![CDATA[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 into
 two parts such that s and t belong
 to different parts. The cut set i]]></description><category></category></item><item><title><![CDATA[【2017青岛网络赛】hdu 6212  Zuma 1007 区间dp]]></title><link>https://blog.youkuaiyun.com/zchahaha/article/details/78023419</link><guid>https://blog.youkuaiyun.com/zchahaha/article/details/78023419</guid><author>zchahaha</author><pubDate>Mon, 18 Sep 2017 20:34:01 +0800</pubDate><description><![CDATA[Problem Description

Think about the Zuma Game. You have a row of at most 200 black(0)
 or white(1) balls on the table at the start. Each three consecutive balls never share the same colour. You al]]></description><category></category></item><item><title><![CDATA[【2017西安网络赛】C Sum]]></title><link>https://blog.youkuaiyun.com/zchahaha/article/details/78008919</link><guid>https://blog.youkuaiyun.com/zchahaha/article/details/78008919</guid><author>zchahaha</author><pubDate>Sun, 17 Sep 2017 10:54:20 +0800</pubDate><description><![CDATA[Define the function S(x)S(x) for xx is
 a positive integer. S(x)S(x) equals
 to the sum of all digit of the decimal expression of xx.
 Please find a positive integer kk that S(k∗x)%233=0S(k∗x)%233=]]></description><category></category></item><item><title><![CDATA[【2017西安网络赛】E Maximum Flow]]></title><link>https://blog.youkuaiyun.com/zchahaha/article/details/78008663</link><guid>https://blog.youkuaiyun.com/zchahaha/article/details/78008663</guid><author>zchahaha</author><pubDate>Sun, 17 Sep 2017 10:17:14 +0800</pubDate><description><![CDATA[Given a directed graph with nn nodes,
 labeled 0,1,⋯,n−10,1,⋯,n−1.
For each i,j> satisfies 0≤i0≤ijn,
 there exists an edge from the i-th node to the j-th node, the capacity of which is ii xor jj.]]></description><category></category></item><item><title><![CDATA[【2017新疆网络赛】H Skiing   最短路径spfa     模版]]></title><link>https://blog.youkuaiyun.com/zchahaha/article/details/77995502</link><guid>https://blog.youkuaiyun.com/zchahaha/article/details/77995502</guid><author>zchahaha</author><pubDate>Fri, 15 Sep 2017 20:38:40 +0800</pubDate><description><![CDATA[In this winter holiday, Bob has a plan for skiing at the mountain resort.
This ski resort has MM different
 ski paths and NN different
 flags situated at those turning points.
The ii-th
 path fro]]></description><category></category></item><item><title><![CDATA[【2017新疆网络赛】F  Islands  强连通分量tarjan  hdu2767原题]]></title><link>https://blog.youkuaiyun.com/zchahaha/article/details/77994976</link><guid>https://blog.youkuaiyun.com/zchahaha/article/details/77994976</guid><author>zchahaha</author><pubDate>Fri, 15 Sep 2017 19:29:01 +0800</pubDate><description><![CDATA[On the mysterious continent of Tamriel, there is a great empire founded by human.
To develope the trade, the East Empire Company is set up to transport goods from place to place.
Recently, the compa]]></description><category></category></item><item><title><![CDATA[【2017新疆网络赛】E  Half-consecutive Numbers 打表]]></title><link>https://blog.youkuaiyun.com/zchahaha/article/details/77985222</link><guid>https://blog.youkuaiyun.com/zchahaha/article/details/77985222</guid><author>zchahaha</author><pubDate>Thu, 14 Sep 2017 21:02:57 +0800</pubDate><description><![CDATA[The numbers 11, 33, 66, 1010, 1515, 2121, 2828, 3636, 4545 and ti=12i(i+1)t​i​​=​2​​1​​i(i+1),
 are called half-consecutive.
For given NN,
 find the smallest rr which
 is no smaller than NN such]]></description><category></category></item></channel></rss>