<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Techay的博客]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/Techay</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; Techay]]></copyright><item><title><![CDATA[第三章   进程]]></title><link>https://blog.csdn.net/Techay/article/details/64489730</link><guid>https://blog.csdn.net/Techay/article/details/64489730</guid><author>Techay</author><pubDate>Tue, 21 Mar 2017 19:49:12 +0800</pubDate><description><![CDATA[第三章   进程3.1进程概念进程就是执行中的程序 
进程包含堆栈段，数据段。 
进程是活动实体，而程序是被动实体，程序只是一系列的指令而已。进程状态有：新的，运行，等待，就绪，终止进程控制块(任务控制块，PCB) 
包含 
1. 进程状态 
2. 进程编号 
3. 程序计数器：进程下个指令的地址  
4. CPU寄存器：累加器，索引寄存器，堆栈指针，通用寄存器和其他条件码信息寄存器 
5. CPU]]></description><category></category></item><item><title><![CDATA[第二章   操作系统结构]]></title><link>https://blog.csdn.net/Techay/article/details/64489489</link><guid>https://blog.csdn.net/Techay/article/details/64489489</guid><author>Techay</author><pubDate>Tue, 21 Mar 2017 19:48:42 +0800</pubDate><description><![CDATA[第二章   操作系统结构2.1操作系统服务
对用户很有用的函数  
  用户界面(命令行界面，图形用户界面)
  程序执行
  I/O操作
  文件系统操作
  通信(同一台计算机两个进程，网络连接不同计算机的进程)，通过共享内存或者消息交换实现；
  错误检测
  确保系统本身高效运行  
  资源分配
  统计
  保护和安全
  向操作系统传递参数三种方法 
通过寄存器
存在内存的块和表中，并]]></description><category></category></item><item><title><![CDATA[第一章导论]]></title><link>https://blog.csdn.net/Techay/article/details/60966261</link><guid>https://blog.csdn.net/Techay/article/details/60966261</guid><author>Techay</author><pubDate>Thu, 09 Mar 2017 19:47:17 +0800</pubDate><description><![CDATA[计算机系统分为4个组成部分：计算机硬件，操作系统，系统程序，用户。计算器系统组织
硬件随时通过系统总线向CPU发出信号，触发中断；
软件通过特殊操作(系统调用)触发中断。  内存是处理器可以直接访问的唯一的大容量存储区域。
计算机系统体系结构
多处理器系统优点：
  增加吞吐量
  规模经济
  增加可靠性。非对称多处理：
  一个主处理器控制系统，其他处理器索要任务或做预先定义的任务，主从关系。对]]></description><category></category></item><item><title><![CDATA[退役]]></title><link>https://blog.csdn.net/Techay/article/details/53449571</link><guid>https://blog.csdn.net/Techay/article/details/53449571</guid><author>Techay</author><pubDate>Mon, 05 Dec 2016 23:56:05 +0800</pubDate><description><![CDATA[大半年没有写博客了= =，自己确实太懒了，这期间写了不少好题，但是也懒得记录了，感觉我并不需要这些东西，对我提高也不是很大，还不如记录写了那些题，过段时间再去刷一遍。 
去年自从在北京坑了学长，打铁回来后，一蹶不振= =，总觉得铜牌都是必然会得的，虽然奖牌数量偏少，也不是打铁的原因，归根结底就是菜，多刷题。 
四川省赛 
是在今年5月左右，跟队友zy和xf固定下来练了蛮久的，当时队里决定给三个名额给]]></description><category></category></item><item><title><![CDATA[搬家]]></title><link>https://blog.csdn.net/Techay/article/details/51228810</link><guid>https://blog.csdn.net/Techay/article/details/51228810</guid><author>Techay</author><pubDate>Sat, 23 Apr 2016 22:41:25 +0800</pubDate><description><![CDATA[新博客 
http://flyyyy.github.io]]></description><category></category></item><item><title><![CDATA[Special equations（数学筛）]]></title><link>https://blog.csdn.net/Techay/article/details/51142073</link><guid>https://blog.csdn.net/Techay/article/details/51142073</guid><author>Techay</author><pubDate>Wed, 13 Apr 2016 12:39:25 +0800</pubDate><description><![CDATA[Let f(x) = anxn+...+a1x+a0a_nx^n +...+ a_1x +a_0, in which ai (0 <= i <= n) are all known integers. We call f(x) 0 (mod m) congruence equation. If m is a composite, we can factor m into powers of prime]]></description><category></category></item><item><title><![CDATA[So Easy!]]></title><link>https://blog.csdn.net/Techay/article/details/51141618</link><guid>https://blog.csdn.net/Techay/article/details/51141618</guid><author>Techay</author><pubDate>Wed, 13 Apr 2016 11:37:28 +0800</pubDate><description><![CDATA[A sequence Sn is defined as:SnS_{n} = ⌈(a+b√)n⌉\lceil(a + \sqrt{b})^{n}\rceil%m 
Where a, b, n, m are positive integers.┌x┐is the ceil of x. For example, ┌3.14┐=4. You are to calculate Sn. 
　　You, a to]]></description><category></category></item><item><title><![CDATA[Bomb（数位DP）]]></title><link>https://blog.csdn.net/Techay/article/details/50839965</link><guid>https://blog.csdn.net/Techay/article/details/50839965</guid><author>Techay</author><pubDate>Wed, 09 Mar 2016 23:41:41 +0800</pubDate><description><![CDATA[Description 
The counter-terrorists found a time bomb in the dust. But this time the terrorists improve on the time bomb. The number sequence of the time bomb counts from 1 to N. If the current number]]></description><category></category></item><item><title><![CDATA[不要62（数位DP）]]></title><link>https://blog.csdn.net/Techay/article/details/50839877</link><guid>https://blog.csdn.net/Techay/article/details/50839877</guid><author>Techay</author><pubDate>Wed, 09 Mar 2016 23:33:47 +0800</pubDate><description><![CDATA[Description 
杭州人称那些傻乎乎粘嗒嗒的人为62（音：laoer）。  
杭州交通管理局经常会扩充一些的士车牌照，新近出来一个好消息，以后上牌照，不再含有不吉利的数字了，这样一来，就可以消除个别的士司机和乘客的心理障碍，更安全地服务大众。  
不吉利的数字为所有含有4或62的号码。例如：  
62315 73418 88914  
都属于不吉利号码。但是，61152虽然含有6和2，但不是]]></description><category></category></item><item><title><![CDATA[1044 - Palindrome Partitioning(记忆化DP)]]></title><link>https://blog.csdn.net/Techay/article/details/50839848</link><guid>https://blog.csdn.net/Techay/article/details/50839848</guid><author>Techay</author><pubDate>Wed, 09 Mar 2016 23:22:32 +0800</pubDate><description><![CDATA[A palindrome partition is the partitioning of a string such that each separate substring is a palindrome.For example, the string “ABACABA” could be partitioned in several different ways, such as {“A”,”]]></description><category></category></item><item><title><![CDATA[1037 - Agent 47（状压DP）]]></title><link>https://blog.csdn.net/Techay/article/details/50822776</link><guid>https://blog.csdn.net/Techay/article/details/50822776</guid><author>Techay</author><pubDate>Mon, 07 Mar 2016 22:03:51 +0800</pubDate><description><![CDATA[Agent 47 is in a dangerous Mission “Black Monster Defeat - 15”. It is a secret mission and so 47 has a limited supply of weapons. As a matter of fact he has only one weapon the old weak “KM .45 Tactica]]></description><category></category></item><item><title><![CDATA[1033 - Generating Palindromes（傻DP）]]></title><link>https://blog.csdn.net/Techay/article/details/50822744</link><guid>https://blog.csdn.net/Techay/article/details/50822744</guid><author>Techay</author><pubDate>Mon, 07 Mar 2016 22:00:44 +0800</pubDate><description><![CDATA[By definition palindrome is a string which is not changed when reversed. “MADAM” is a nice example of palindrome. It is an easy job to test whether a given string is a palindrome or not. But it may not]]></description><category></category></item><item><title><![CDATA[1031 - Easy Game（博弈dp）]]></title><link>https://blog.csdn.net/Techay/article/details/50822733</link><guid>https://blog.csdn.net/Techay/article/details/50822733</guid><author>Techay</author><pubDate>Mon, 07 Mar 2016 21:59:29 +0800</pubDate><description><![CDATA[You are playing a two player game. Initially there are n integer numbers in an array and player A and B get chance to take them alternatively. Each player can take one or more numbers from the left or]]></description><category></category></item><item><title><![CDATA[Food Delivery（区间DP）]]></title><link>https://blog.csdn.net/Techay/article/details/50811445</link><guid>https://blog.csdn.net/Techay/article/details/50811445</guid><author>Techay</author><pubDate>Sat, 05 Mar 2016 23:31:30 +0800</pubDate><description><![CDATA[When we are focusing on solving problems, we usually prefer to stay in front of computers rather than go out for lunch. At this time, we may call for food delivery.Suppose there are N people living in]]></description><category></category></item><item><title><![CDATA[TOYS（水解析）]]></title><link>https://blog.csdn.net/Techay/article/details/50811420</link><guid>https://blog.csdn.net/Techay/article/details/50811420</guid><author>Techay</author><pubDate>Sat, 05 Mar 2016 23:25:30 +0800</pubDate><description><![CDATA[Calculate the number of toys that land in each bin of a partitioned toy box.  
Mom and dad have a problem - their child John never puts his toys away when he is finished playing with them. They gave Jo]]></description><category></category></item><item><title><![CDATA[Double Queue（SET水题）]]></title><link>https://blog.csdn.net/Techay/article/details/50811399</link><guid>https://blog.csdn.net/Techay/article/details/50811399</guid><author>Techay</author><pubDate>Sat, 05 Mar 2016 23:20:55 +0800</pubDate><description><![CDATA[The new founded Balkan Investment Group Bank (BIG-Bank) opened a new office in Bucharest, equipped with a modern computing environment provided by IBM Romania, and using modern information technologies]]></description><category></category></item><item><title><![CDATA[1030 Discovering Gold（水DP）]]></title><link>https://blog.csdn.net/Techay/article/details/50811384</link><guid>https://blog.csdn.net/Techay/article/details/50811384</guid><author>Techay</author><pubDate>Sat, 05 Mar 2016 23:16:35 +0800</pubDate><description><![CDATA[You are in a cave, a long cave! The cave can be represented by a 1 x N grid. Each cell of the cave can contain any amount of gold.Initially you are in position 1. Now each turn you throw a perfect 6 si]]></description><category></category></item><item><title><![CDATA[Monthly Expense（二分最值）]]></title><link>https://blog.csdn.net/Techay/article/details/50748424</link><guid>https://blog.csdn.net/Techay/article/details/50748424</guid><author>Techay</author><pubDate>Fri, 26 Feb 2016 11:22:05 +0800</pubDate><description><![CDATA[Description 
Farmer John is an astounding accounting wizard and has realized he might run out of money to run the farm. He has already calculated and recorded the exact amount of money (1 ≤ moneyi ≤ 10]]></description><category></category></item><item><title><![CDATA[River Hopscotch（二分最大值）]]></title><link>https://blog.csdn.net/Techay/article/details/50748375</link><guid>https://blog.csdn.net/Techay/article/details/50748375</guid><author>Techay</author><pubDate>Fri, 26 Feb 2016 11:17:15 +0800</pubDate><description><![CDATA[Description 
Every year the cows hold an event featuring a peculiar version of hopscotch that involves carefully jumping from rock to rock in a river. The excitement takes place on a long, straight riv]]></description><category></category></item><item><title><![CDATA[Aggressive cows（二分）]]></title><link>https://blog.csdn.net/Techay/article/details/50748250</link><guid>https://blog.csdn.net/Techay/article/details/50748250</guid><author>Techay</author><pubDate>Fri, 26 Feb 2016 11:07:38 +0800</pubDate><description><![CDATA[Description 
Farmer John has built a new long barn, with N (2 <= N <= 100,000) stalls. The stalls are located along a straight line at positions x1,…,xN (0 <= xi <= 1,000,000,000). His C (2 <= C <= N)]]></description><category></category></item></channel></rss>