<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ZZ_AC的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ZZ_AC</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ZZ_AC]]></copyright><item><title><![CDATA[dp专题-简单基础dp-背包]]></title><link>https://blog.youkuaiyun.com/ZZ_AC/article/details/50775131</link><guid>https://blog.youkuaiyun.com/ZZ_AC/article/details/50775131</guid><author>ZZ_AC</author><pubDate>Tue, 01 Mar 2016 20:51:22 +0800</pubDate><description><![CDATA[按照这个做的：http://doc.okbase.net/cc_again/archive/71796.html
hdu
 1864 最大报销额 01背包
方法一：
double类型的背包
总数30个、每个最大1000、保留2位有效位。直接把double*100转换为int型的背包
代码

//看清题目
//double型的01背包
#include
#include
#i]]></description><category></category></item><item><title><![CDATA[算法学习总结]]></title><link>https://blog.youkuaiyun.com/ZZ_AC/article/details/50774967</link><guid>https://blog.youkuaiyun.com/ZZ_AC/article/details/50774967</guid><author>ZZ_AC</author><pubDate>Tue, 01 Mar 2016 19:44:22 +0800</pubDate><description><![CDATA[自己从大一暑假开始接触算法，虽然当时也参加了学校的暑假集训但是自己没有认真去学。记得那年作为替补去看了一次省赛，当时对自己的感触很大，然后回来后自己再认真学习算法，还记得到了大二才开始自学快排。大二时才学习了dp，搜索等算法。
回顾2015年一年，打了一场省赛，一场区域赛，还有很多场在线的cf，bc，百度之星，编程之美，计蒜客，每次去都被虐。本来以为自己学了一些东西比上一年进步了很多，但是每次都]]></description><category></category></item><item><title><![CDATA[G - 免费馅饼]]></title><link>https://blog.youkuaiyun.com/ZZ_AC/article/details/50459576</link><guid>https://blog.youkuaiyun.com/ZZ_AC/article/details/50459576</guid><author>ZZ_AC</author><pubDate>Tue, 05 Jan 2016 00:23:41 +0800</pubDate><description><![CDATA[G - 免费馅饼
Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d
 & %I64u
Submit Status Practice HDU
 1176


Appoint description: 
prayerhgq  (2015-07-28)System Crawler  (2015-12-]]></description><category></category></item><item><title><![CDATA[F - Piggy-Bank]]></title><link>https://blog.youkuaiyun.com/ZZ_AC/article/details/50459554</link><guid>https://blog.youkuaiyun.com/ZZ_AC/article/details/50459554</guid><author>ZZ_AC</author><pubDate>Tue, 05 Jan 2016 00:13:53 +0800</pubDate><description><![CDATA[F - Piggy-Bank
Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d
 & %I64u
Submit Status Practice HDU
 1114


Appoint description: 
System Crawler  (2016-01-02)


Descript]]></description><category></category></item><item><title><![CDATA[E - Super Jumping! Jumping! Jumping!]]></title><link>https://blog.youkuaiyun.com/ZZ_AC/article/details/50459541</link><guid>https://blog.youkuaiyun.com/ZZ_AC/article/details/50459541</guid><author>ZZ_AC</author><pubDate>Tue, 05 Jan 2016 00:07:03 +0800</pubDate><description><![CDATA[E - Super Jumping! Jumping! Jumping!
Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d
 & %I64u
Submit Status Practice HDU
 1087


Appoint description: 
System Crawler  (201]]></description><category></category></item><item><title><![CDATA[assert()函数用法总结]]></title><link>https://blog.youkuaiyun.com/ZZ_AC/article/details/50444803</link><guid>https://blog.youkuaiyun.com/ZZ_AC/article/details/50444803</guid><author>ZZ_AC</author><pubDate>Fri, 01 Jan 2016 13:09:18 +0800</pubDate><description><![CDATA[assert()函数用法总结


assert宏的原型定义在中，其作用是如果它的条件返回错误，则终止程序执行，原型定义：

#include assert.h>
void assert( int expression );


　　assert的作用是现计算表达式 expression ，如果其值为假（即为0），那么它先向stderr打印一条出错信息，然后通过调用 abort 来终]]></description><category></category></item><item><title><![CDATA[Codeforces Round #336 (Div. 2)B. Hamming Distance Sum]]></title><link>https://blog.youkuaiyun.com/ZZ_AC/article/details/50396202</link><guid>https://blog.youkuaiyun.com/ZZ_AC/article/details/50396202</guid><author>ZZ_AC</author><pubDate>Thu, 24 Dec 2015 18:22:45 +0800</pubDate><description><![CDATA[B. Hamming Distance Sum


time limit per test
2 seconds


memory limit per test
256 megabytes


input
standard input


output
standard output



Genos needs your help. He was asked]]></description><category></category></item><item><title><![CDATA[Codeforces Round #336 (Div. 2)A. Saitama Destroys Hotel]]></title><link>https://blog.youkuaiyun.com/ZZ_AC/article/details/50396160</link><guid>https://blog.youkuaiyun.com/ZZ_AC/article/details/50396160</guid><author>ZZ_AC</author><pubDate>Thu, 24 Dec 2015 18:14:16 +0800</pubDate><description><![CDATA[A. Saitama Destroys Hotel


time limit per test
1 second


memory limit per test
256 megabytes


input
standard input


output
standard output



Saitama accidentally destroyed a h]]></description><category></category></item><item><title><![CDATA[SRM675(div2) Level One	LengthUnitCalculator]]></title><link>https://blog.youkuaiyun.com/ZZ_AC/article/details/50274145</link><guid>https://blog.youkuaiyun.com/ZZ_AC/article/details/50274145</guid><author>ZZ_AC</author><pubDate>Sat, 12 Dec 2015 12:53:29 +0800</pubDate><description><![CDATA[SRM675(div2) Level One
LengthUnitCalculator















   Problem Statement  






















 Problem Statement for LengthUnitCalculator





]]></description><category></category></item><item><title><![CDATA[SRM675(div2)  Level Two  ShortestPathWithMagic]]></title><link>https://blog.youkuaiyun.com/ZZ_AC/article/details/50273911</link><guid>https://blog.youkuaiyun.com/ZZ_AC/article/details/50273911</guid><author>ZZ_AC</author><pubDate>Sat, 12 Dec 2015 12:04:36 +0800</pubDate><description><![CDATA[SRM675(div2)  Level One
LengthUnitCalculator















   Problem Statement  






















 Problem Statement for ShortestPathWithMagic]]></description><category></category></item><item><title><![CDATA[51nod 1066 Bash游戏]]></title><link>https://blog.youkuaiyun.com/ZZ_AC/article/details/50234165</link><guid>https://blog.youkuaiyun.com/ZZ_AC/article/details/50234165</guid><author>ZZ_AC</author><pubDate>Wed, 09 Dec 2015 11:38:10 +0800</pubDate><description><![CDATA[1066 Bash游戏

基准时间限制：1 秒 空间限制：131072 KB 分值: 0 难度：基础题








有一堆石子共有N个。A B两个人轮流拿，A先拿。每次最少拿1颗，最多拿K颗，拿到最后1颗石子的人获胜。假设A B都非常聪明，拿石子的过程中不会出现失误。给出N和K，问最后谁能赢得比赛。
例如N = 3，K = 2。无论A如何拿，B都可以拿到最后1颗石子。]]></description><category></category></item><item><title><![CDATA[51nod 1058 N的阶乘的长度]]></title><link>https://blog.youkuaiyun.com/ZZ_AC/article/details/50234023</link><guid>https://blog.youkuaiyun.com/ZZ_AC/article/details/50234023</guid><author>ZZ_AC</author><pubDate>Wed, 09 Dec 2015 11:29:20 +0800</pubDate><description><![CDATA[1058 N的阶乘的长度

基准时间限制：1 秒 空间限制：131072 KB 分值: 0 难度：基础题




 收藏


 关注




输入N求N的阶乘的10进制表示的长度。例如6! = 720，长度为3。






Input
输入N(1 

Output
输出N的阶乘的长度

Input示例
6

Output示例
3
]]></description><category></category></item><item><title><![CDATA[51nod  1019 逆序数]]></title><link>https://blog.youkuaiyun.com/ZZ_AC/article/details/50224889</link><guid>https://blog.youkuaiyun.com/ZZ_AC/article/details/50224889</guid><author>ZZ_AC</author><pubDate>Tue, 08 Dec 2015 21:47:06 +0800</pubDate><description><![CDATA[1019 逆序数

基准时间限制：1 秒 空间限制：131072 KB 分值: 0 难度：基础题








在一个排列中，如果一对数的前后位置与大小顺序相反，即前面的数大于后面的数，那么它们就称为一个逆序。一个排列中逆序的总数就称为这个排列的逆序数。

如2 4 3 1中，2 1，4 3，4 1，3 1是逆序，逆序数是4。给出一个整数序列，求该序列的逆序数。]]></description><category></category></item><item><title><![CDATA[I - 最少拦截系统]]></title><link>https://blog.youkuaiyun.com/ZZ_AC/article/details/50164861</link><guid>https://blog.youkuaiyun.com/ZZ_AC/article/details/50164861</guid><author>ZZ_AC</author><pubDate>Thu, 03 Dec 2015 18:50:47 +0800</pubDate><description><![CDATA[I - 最少拦截系统
Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u
Submit Status Practice HDU
 1257


Appoint description: 
System Crawler  (2015-12-02)


Description]]></description><category></category></item><item><title><![CDATA[nyist79 拦截导弹]]></title><link>https://blog.youkuaiyun.com/ZZ_AC/article/details/50164787</link><guid>https://blog.youkuaiyun.com/ZZ_AC/article/details/50164787</guid><author>ZZ_AC</author><pubDate>Thu, 03 Dec 2015 18:41:47 +0800</pubDate><description><![CDATA[拦截导弹
时间限制：3000 ms  |  内存限制：65535 KB
难度：3





描述

某国为了防御敌国的导弹袭击，发展中一种导弹拦截系统。但是这种导弹拦截系统有一个缺陷：虽然它的第一发炮弹能够到达任意的高度，但是以后每一发炮弹都不能高于等于前一发的高度。某天，雷达捕捉到敌国导弹来袭。由于该系统还在试用阶段，所以只用一套系统，因此有可能不能拦截所有的导弹。]]></description><category></category></item><item><title><![CDATA[Codeforces Round #334 (Div. 2) C. Alternative Thinking]]></title><link>https://blog.youkuaiyun.com/ZZ_AC/article/details/50160187</link><guid>https://blog.youkuaiyun.com/ZZ_AC/article/details/50160187</guid><author>ZZ_AC</author><pubDate>Thu, 03 Dec 2015 14:21:29 +0800</pubDate><description><![CDATA[C. Alternative Thinking


time limit per test
2 seconds


memory limit per test
256 megabytes


input
standard input


output
standard output



Kevin has just recevied his disappo]]></description><category></category></item><item><title><![CDATA[Codeforces Round #334 (Div. 2) B. More Cowbell]]></title><link>https://blog.youkuaiyun.com/ZZ_AC/article/details/50159547</link><guid>https://blog.youkuaiyun.com/ZZ_AC/article/details/50159547</guid><author>ZZ_AC</author><pubDate>Thu, 03 Dec 2015 13:37:53 +0800</pubDate><description><![CDATA[B. More Cowbell


time limit per test
2 seconds


memory limit per test
256 megabytes


input
standard input


output
standard output



Kevin Sun wants to move his precious collec]]></description><category></category></item><item><title><![CDATA[Codeforces Round #334 (Div. 2) A. Uncowed Forces]]></title><link>https://blog.youkuaiyun.com/ZZ_AC/article/details/50159435</link><guid>https://blog.youkuaiyun.com/ZZ_AC/article/details/50159435</guid><author>ZZ_AC</author><pubDate>Thu, 03 Dec 2015 13:27:14 +0800</pubDate><description><![CDATA[A. Uncowed Forces


time limit per test
1 second


memory limit per test
256 megabytes


input
standard input


output
standard output



Kevin Sun has just finished competing in C]]></description><category></category></item><item><title><![CDATA[BestCoder Round #64 (div.1) B.Array]]></title><link>https://blog.youkuaiyun.com/ZZ_AC/article/details/50087009</link><guid>https://blog.youkuaiyun.com/ZZ_AC/article/details/50087009</guid><author>ZZ_AC</author><pubDate>Sat, 28 Nov 2015 20:37:44 +0800</pubDate><description><![CDATA[Array
 

 Time Limit: 2000/1000 MS (Java/Others)
 
 Memory Limit: 131072/131072 K (Java/Others)




问题描述
Vicky是个热爱数学的魔法师，拥有复制创造的能力。
一开始他拥有一个数列{1}。每过一天，他将他当天的数列复制一遍，放在数列尾，并在两个数列间用0隔开。Vicky想做]]></description><category></category></item><item><title><![CDATA[BestCoder Round #64 (div.1) A.Sum]]></title><link>https://blog.youkuaiyun.com/ZZ_AC/article/details/50086883</link><guid>https://blog.youkuaiyun.com/ZZ_AC/article/details/50086883</guid><author>ZZ_AC</author><pubDate>Sat, 28 Nov 2015 20:26:08 +0800</pubDate><description><![CDATA[Sum
 
 

 Time Limit: 2000/1000 MS (Java/Others)
 
 Memory Limit: 65536/65536 K (Java/Others)




问题描述
给n个数{A}_{1},{A}_{2}....{A}_{n}A​1​​,A​2​​....A​n​​,你可以选择一个区间(也可以不选)，区间里每个数x变成f(x),其中f]]></description><category></category></item></channel></rss>