<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Vampire]]></title><description><![CDATA[你陪了我多少年花开花落一路上起起跌跌]]></description><link>https://blog.youkuaiyun.com/FZHvampire</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; FZHvampire]]></copyright><item><title><![CDATA[[CSAPP大作业] 程序人生-Hello's P2P]]></title><link>https://blog.youkuaiyun.com/FZHvampire/article/details/85810811</link><guid>https://blog.youkuaiyun.com/FZHvampire/article/details/85810811</guid><author>FZHvampire</author><pubDate>Sat, 05 Jan 2019 00:16:30 +0800</pubDate><description><![CDATA[摘  要

本文主要介绍hello程序在linux下是如何从一个.c文件一步步变成可执行文件的。对于在运行的过程中可能会出现的一些比较重要的问题，例如虚拟内存，IO等操作进行探究。

 

关键词：程序执行 CSAPP                           

 

 

 

 

 

 

 

 

 

 

目  录

 

第1章 概述....................]]></description><category></category></item><item><title><![CDATA[[CASPP][CACHE]实验]]></title><link>https://blog.youkuaiyun.com/FZHvampire/article/details/85058611</link><guid>https://blog.youkuaiyun.com/FZHvampire/article/details/85058611</guid><author>FZHvampire</author><pubDate>Mon, 17 Dec 2018 23:42:37 +0800</pubDate><description><![CDATA[由于cache的实现有代码框架，比较easy，就直接放代码了
codecodecode
#include &amp;amp;lt;getopt.h&amp;amp;gt;
#include &amp;amp;lt;stdlib.h&amp;amp;gt;
#include &amp;amp;lt;unistd.h&amp;amp;gt;
#include &amp;amp;lt;stdio.h&amp;amp;gt;
#include &amp;amp;lt;assert.h&amp;amp;g]]></description><category></category></item><item><title><![CDATA[缓冲区溢出(ICS实验)]]></title><link>https://blog.youkuaiyun.com/FZHvampire/article/details/84347318</link><guid>https://blog.youkuaiyun.com/FZHvampire/article/details/84347318</guid><author>FZHvampire</author><pubDate>Thu, 22 Nov 2018 19:28:30 +0800</pubDate><description><![CDATA[**
SmokeSmokeSmoke
**
文本:
00 00 00 00		00 00 00 00 	00 00 00 00		00 00 00 00
00 00 00 00		00 00 00 00		00 00 00 00		00 00 00 00
00 00 00 00		00 00 00 00		00 00 00 00		bb 8b 04 08



分析过程：

在getbuf函数中，...]]></description><category></category></item><item><title><![CDATA[二进制炸弹(ICS作业)]]></title><link>https://blog.youkuaiyun.com/FZHvampire/article/details/83961565</link><guid>https://blog.youkuaiyun.com/FZHvampire/article/details/83961565</guid><author>FZHvampire</author><pubDate>Sun, 11 Nov 2018 19:55:42 +0800</pubDate><description><![CDATA[**
phase1phase1phase1
**
密码为：Allyourbasearebelongtous.All your base are belong to us.Allyourbasearebelongtous.


]]></description><category></category></item><item><title><![CDATA[[深入理解计算机系统] 第二章家庭作业]]></title><link>https://blog.youkuaiyun.com/FZHvampire/article/details/83825721</link><guid>https://blog.youkuaiyun.com/FZHvampire/article/details/83825721</guid><author>FZHvampire</author><pubDate>Wed, 07 Nov 2018 16:02:16 +0800</pubDate><description><![CDATA[**
2.732.732.73
**
int saturating_add(int x,int y){
	unsigned int tot=x+y;
	int len=(sizeof(int)&amp;amp;amp;amp;lt;&amp;amp;amp;amp;lt;3)-1;
	unsigned int flag=!((((x&amp;amp;amp;amp;gt;&amp;amp;amp;amp;gt;len)^(y&amp;amp;amp;amp;gt;&amp;amp;amp;amp]]></description><category></category></item><item><title><![CDATA[Python学习笔记]]></title><link>https://blog.youkuaiyun.com/FZHvampire/article/details/81158645</link><guid>https://blog.youkuaiyun.com/FZHvampire/article/details/81158645</guid><author>FZHvampire</author><pubDate>Sun, 22 Jul 2018 20:50:10 +0800</pubDate><description><![CDATA[



文件操作文件操作文件操作

fin=open('input.in','r')
fin.readline()
fin.close()

如果程序和输入数据在同一目录下，就只需要输入要打开的文件名即可，如果不是的话，就需要经完整路径写进去



fout=open('output.out','w')
fout.write('asd') #输出字符

a=0
fout.write(a) #输出变...]]></description><category></category></item><item><title><![CDATA[[bzoj1063][NOI2008]道路设计]]></title><link>https://blog.youkuaiyun.com/FZHvampire/article/details/51828849</link><guid>https://blog.youkuaiyun.com/FZHvampire/article/details/51828849</guid><author>FZHvampire</author><pubDate>Tue, 05 Jul 2016 09:40:36 +0800</pubDate><description><![CDATA[1063: [Noi2008]道路设计Time Limit: 20 Sec  Memory Limit: 162 MB 
Submit: 931  Solved: 509 
[Submit][Status][Discuss] 
Description　　Z国坐落于遥远而又神奇的东方半岛上，在小Z的统治时代公路成为这里主要的交通手段。Z国共有n座城市，一 
些城市之间由双向的公路所连接。非常神奇的是Z]]></description><category></category></item><item><title><![CDATA[[bzoj1564][NOI2009]二叉查找树]]></title><link>https://blog.youkuaiyun.com/FZHvampire/article/details/51823917</link><guid>https://blog.youkuaiyun.com/FZHvampire/article/details/51823917</guid><author>FZHvampire</author><pubDate>Mon, 04 Jul 2016 21:40:50 +0800</pubDate><description><![CDATA[1564: [NOI2009]二叉查找树Time Limit: 10 Sec  Memory Limit: 64 MB 
Submit: 705  Solved: 498 
[Submit][Status][Discuss] 
DescriptionInputOutput只有一个数字，即你所能得到的整棵树的访问代价与额外修改代价之和的最小值。 
Sample Input4 101 2 3 41 2]]></description><category></category></item><item><title><![CDATA[[bzoj1064][NOI2008]假面舞会]]></title><link>https://blog.youkuaiyun.com/FZHvampire/article/details/51821673</link><guid>https://blog.youkuaiyun.com/FZHvampire/article/details/51821673</guid><author>FZHvampire</author><pubDate>Mon, 04 Jul 2016 16:12:22 +0800</pubDate><description><![CDATA[1064: [Noi2008]假面舞会Time Limit: 10 Sec  Memory Limit: 162 MB 
Submit: 1580  Solved: 768 
[Submit][Status][Discuss] 
Description一年一度的假面舞会又开始了，栋栋也兴致勃勃的参加了今年的舞会。今年的面具都是主办方特别定制的。每个参加舞会的人都可以在入场时选择一 个自己喜欢的面具。]]></description><category></category></item><item><title><![CDATA[[bzoj1566][NOI2009]管道取珠]]></title><link>https://blog.youkuaiyun.com/FZHvampire/article/details/51819743</link><guid>https://blog.youkuaiyun.com/FZHvampire/article/details/51819743</guid><author>FZHvampire</author><pubDate>Mon, 04 Jul 2016 11:35:03 +0800</pubDate><description><![CDATA[1566: [NOI2009]管道取珠Time Limit: 20 Sec  Memory Limit: 650 MB 
Submit: 1277  Solved: 721 
[Submit][Status][Discuss] 
Description 
 Input第一行包含两个整数n, m，分别表示上下两个管道中球的数目。 第二行为一个AB字符串，长度为n，表示上管道中从左到右球的类型。其中A表]]></description><category></category></item><item><title><![CDATA[[bzoj1499][NOI2005]瑰丽华尔兹]]></title><link>https://blog.youkuaiyun.com/FZHvampire/article/details/51818551</link><guid>https://blog.youkuaiyun.com/FZHvampire/article/details/51818551</guid><author>FZHvampire</author><pubDate>Mon, 04 Jul 2016 09:20:29 +0800</pubDate><description><![CDATA[1499: [NOI2005]瑰丽华尔兹Time Limit: 3 Sec  Memory Limit: 64 MB 
Submit: 1321  Solved: 788 
[Submit][Status][Discuss] 
Description你跳过华尔兹吗？当音乐响起，当你随着旋律滑动舞步，是不是有一种漫步仙境的惬意？众所周知，跳华尔兹时，最重要的是有好的音乐。但是很少有几个人知道，世界上最]]></description><category></category></item><item><title><![CDATA[[bzoj2436][NOI2011]Noi嘉年华]]></title><link>https://blog.youkuaiyun.com/FZHvampire/article/details/51816088</link><guid>https://blog.youkuaiyun.com/FZHvampire/article/details/51816088</guid><author>FZHvampire</author><pubDate>Sun, 03 Jul 2016 17:40:34 +0800</pubDate><description><![CDATA[2436: [Noi2011]Noi嘉年华Time Limit: 10 Sec  Memory Limit: 128 MB 
Submit: 505  Solved: 361 
[Submit][Status][Discuss] 
DescriptionNOI2011 在吉林大学开始啦！为了迎接来自全国各地最优秀的信息学选手， 
吉林大学决定举办两场盛大的 NOI 嘉年华活动，分在两个不同的地点举办]]></description><category></category></item><item><title><![CDATA[[bzoj2878][NOI2012]迷失游乐园]]></title><link>https://blog.youkuaiyun.com/FZHvampire/article/details/51803251</link><guid>https://blog.youkuaiyun.com/FZHvampire/article/details/51803251</guid><author>FZHvampire</author><pubDate>Fri, 01 Jul 2016 17:26:44 +0800</pubDate><description><![CDATA[2878: [Noi2012]迷失游乐园Time Limit: 10 Sec  Memory Limit: 512 MB 
Submit: 894  Solved: 512 
[Submit][Status][Discuss] 
Description放假了，小Z觉得呆在家里特别无聊，于是决定一个人去游乐园玩。进入游乐园后，小Z看了看游乐园的地图，发现可以将游乐园抽象成有n个景点、m条道路的无向连通]]></description><category></category></item><item><title><![CDATA[[bzoj4381][POI2015]Odwiedziny]]></title><link>https://blog.youkuaiyun.com/FZHvampire/article/details/51788841</link><guid>https://blog.youkuaiyun.com/FZHvampire/article/details/51788841</guid><author>FZHvampire</author><pubDate>Thu, 30 Jun 2016 11:19:23 +0800</pubDate><description><![CDATA[4381: [POI2015]OdwiedzinyTime Limit: 20 Sec  Memory Limit: 128 MB 
Submit: 303  Solved: 128 
[Submit][Status][Discuss] 
Description给定一棵n个点的树，树上每条边的长度都为1，第i个点的权值为a[i]。 
Byteasar想要走遍这整棵树，他会按照某个1到n的全排列b走n]]></description><category></category></item><item><title><![CDATA[[bzoj4383][POI2015]Pustynia]]></title><link>https://blog.youkuaiyun.com/FZHvampire/article/details/51729565</link><guid>https://blog.youkuaiyun.com/FZHvampire/article/details/51729565</guid><author>FZHvampire</author><pubDate>Tue, 21 Jun 2016 19:08:28 +0800</pubDate><description><![CDATA[4383: [POI2015]PustyniaTime Limit: 10 Sec  Memory Limit: 128 MBSec  Special Judge 
Submit: 162  Solved: 58 
[Submit][Status][Discuss] 
Description给定一个长度为n的正整数序列a，每个数都在1到10^9范围内，告诉你其中s个数，并给出m条信息，每条信息包含三]]></description><category></category></item><item><title><![CDATA[[bzoj2342][SHOI2011]双倍回文]]></title><link>https://blog.youkuaiyun.com/FZHvampire/article/details/51721188</link><guid>https://blog.youkuaiyun.com/FZHvampire/article/details/51721188</guid><author>FZHvampire</author><pubDate>Mon, 20 Jun 2016 15:42:21 +0800</pubDate><description><![CDATA[2342: [Shoi2011]双倍回文Time Limit: 10 Sec  Memory Limit: 128 MB 
Submit: 1855  Solved: 691 
[Submit][Status][Discuss] 
DescriptionInput输入分为两行，第一行为一个整数，表示字符串的长度，第二行有个连续的小写的英文字符，表示字符串的内容。Output输出文件只有一行，即：输入]]></description><category></category></item><item><title><![CDATA[[bzoj3160]万径人踪灭]]></title><link>https://blog.youkuaiyun.com/FZHvampire/article/details/51718924</link><guid>https://blog.youkuaiyun.com/FZHvampire/article/details/51718924</guid><author>FZHvampire</author><pubDate>Mon, 20 Jun 2016 10:09:54 +0800</pubDate><description><![CDATA[3160: 万径人踪灭Time Limit: 10 Sec  Memory Limit: 256 MB 
Submit: 856  Solved: 487 
[Submit][Status][Discuss] 
Description 
 
 
最后的答案可以表示成所有的回文子串的个数减去连续的回文串的个数。 
后面的那个显然可以用manachermanacher。前面的那个东西可以这样求： 
设f]]></description><category></category></item><item><title><![CDATA[[bzoj4378][POI2015]Logistyka]]></title><link>https://blog.youkuaiyun.com/FZHvampire/article/details/51706320</link><guid>https://blog.youkuaiyun.com/FZHvampire/article/details/51706320</guid><author>FZHvampire</author><pubDate>Sat, 18 Jun 2016 16:38:05 +0800</pubDate><description><![CDATA[4378: [POI2015]LogistykaTime Limit: 20 Sec  Memory Limit: 256 MB 
Submit: 226  Solved: 118 
[Submit][Status][Discuss] 
Description维护一个长度为n的序列，一开始都是0，支持以下两种操作： 
1.U k a 将序列中第k个数修改为a。 
2.Z c s 在这个序列上，每次选]]></description><category></category></item><item><title><![CDATA[[bzoj3597][SCOI2014]方伯伯运椰子]]></title><link>https://blog.youkuaiyun.com/FZHvampire/article/details/51700827</link><guid>https://blog.youkuaiyun.com/FZHvampire/article/details/51700827</guid><author>FZHvampire</author><pubDate>Fri, 17 Jun 2016 16:18:06 +0800</pubDate><description><![CDATA[3597: [Scoi2014]方伯伯运椰子Time Limit: 30 Sec  Memory Limit: 64 MB 
Submit: 353  Solved: 215 
[Submit][Status][Discuss] 
Description Input第一行包含二个整数N，M接下来M行代表M条边，表示这个交通网络 
每行六个整数，表示Ui,Vi,Ai,Bi,Ci,Di 
接下来一行包含]]></description><category></category></item><item><title><![CDATA[[bzoj2119]股市的预测]]></title><link>https://blog.youkuaiyun.com/FZHvampire/article/details/51674474</link><guid>https://blog.youkuaiyun.com/FZHvampire/article/details/51674474</guid><author>FZHvampire</author><pubDate>Tue, 14 Jun 2016 20:36:16 +0800</pubDate><description><![CDATA[2119: 股市的预测Time Limit: 10 Sec  Memory Limit: 259 MB 
Submit: 256  Solved: 119 
[Submit][Status][Discuss] 
Description墨墨的妈妈热爱炒股，她要求墨墨为她编写一个软件，预测某只股票未来的走势。股票折线图是研究股票的必备工具，它通过一张时间与股票的价位的函数图像清晰地展示了股票的走势情况。]]></description><category></category></item></channel></rss>