<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[>>--» 唯n1．情缘«--<<]]></title><description><![CDATA[一个你，一个我，一颗心，不松手，不转身，在一起，一辈子。唯爱一生！]]></description><link>https://blog.youkuaiyun.com/hdweilao</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; hdweilao]]></copyright><item><title><![CDATA[epoll+线程池实现http文件下载]]></title><link>https://blog.youkuaiyun.com/hdweilao/article/details/52087425</link><guid>https://blog.youkuaiyun.com/hdweilao/article/details/52087425</guid><author>hdweilao</author><pubDate>Mon, 01 Aug 2016 17:16:20 +0800</pubDate><description><![CDATA[server.c
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include"threadpool.h"
#include
#include
#define MAX_LEN 1024
#define MAX_SIZE 100

void *worker(voi]]></description><category></category></item><item><title><![CDATA[HDoj.1864  最大报销额【动归、背包】  2016/04/11]]></title><link>https://blog.youkuaiyun.com/hdweilao/article/details/51124388</link><guid>https://blog.youkuaiyun.com/hdweilao/article/details/51124388</guid><author>hdweilao</author><pubDate>Mon, 11 Apr 2016 19:07:05 +0800</pubDate><description><![CDATA[最大报销额
Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 21058    Accepted Submission(s): 6313



Problem Description

现有一笔经费可以报销一定额度的发票。允]]></description><category></category></item><item><title><![CDATA[HDoj.2955  Robberies【动归、背包】  2016/04/11]]></title><link>https://blog.youkuaiyun.com/hdweilao/article/details/51123952</link><guid>https://blog.youkuaiyun.com/hdweilao/article/details/51123952</guid><author>hdweilao</author><pubDate>Mon, 11 Apr 2016 18:16:55 +0800</pubDate><description><![CDATA[Robberies
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 18710    Accepted Submission(s): 6906



Problem Description

The aspiring Ro]]></description><category></category></item><item><title><![CDATA[HDoj.1789  Doing Homework again【贪心】  2016/04/11]]></title><link>https://blog.youkuaiyun.com/hdweilao/article/details/51123125</link><guid>https://blog.youkuaiyun.com/hdweilao/article/details/51123125</guid><author>hdweilao</author><pubDate>Mon, 11 Apr 2016 17:00:44 +0800</pubDate><description><![CDATA[Doing Homework again
Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 10533    Accepted Submission(s): 6168



Problem Description

Igna]]></description><category></category></item><item><title><![CDATA[HDoj.5655  CA Loves Stick【基础】  2016/04/04]]></title><link>https://blog.youkuaiyun.com/hdweilao/article/details/51056460</link><guid>https://blog.youkuaiyun.com/hdweilao/article/details/51056460</guid><author>hdweilao</author><pubDate>Mon, 04 Apr 2016 14:37:05 +0800</pubDate><description><![CDATA[CA Loves Stick

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)

Total Submission(s): 636    Accepted Submission(s): 224


Problem Description
CA loves to]]></description><category></category></item><item><title><![CDATA[Hdoj.4291  A Short problem【矩阵快速幂+循环节处理】  2015/12/09]]></title><link>https://blog.youkuaiyun.com/hdweilao/article/details/50233669</link><guid>https://blog.youkuaiyun.com/hdweilao/article/details/50233669</guid><author>hdweilao</author><pubDate>Wed, 09 Dec 2015 11:13:45 +0800</pubDate><description><![CDATA[A Short problem
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2384    Accepted Submission(s): 834



Problem Description

　　According]]></description><category></category></item><item><title><![CDATA[Hdoj.5407  CRB and Candies【数论。。。】   2015/12/05]]></title><link>https://blog.youkuaiyun.com/hdweilao/article/details/50189455</link><guid>https://blog.youkuaiyun.com/hdweilao/article/details/50189455</guid><author>hdweilao</author><pubDate>Sat, 05 Dec 2015 21:38:55 +0800</pubDate><description><![CDATA[CRB and Candies

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)

Total Submission(s): 845    Accepted Submission(s): 405


Problem Description
CRB has N
 ]]></description><category></category></item><item><title><![CDATA[Hdoj.5578  Friendship of Frog【字符串，暴力】  2015/12/04]]></title><link>https://blog.youkuaiyun.com/hdweilao/article/details/50179631</link><guid>https://blog.youkuaiyun.com/hdweilao/article/details/50179631</guid><author>hdweilao</author><pubDate>Fri, 04 Dec 2015 21:06:30 +0800</pubDate><description><![CDATA[Friendship of Frog

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)

Total Submission(s): 181    Accepted Submission(s): 130


Problem Description
N
 frogs]]></description><category></category></item><item><title><![CDATA[Hdoj.5584  LCM Walk【数论，规律】  2015/12/04]]></title><link>https://blog.youkuaiyun.com/hdweilao/article/details/50179387</link><guid>https://blog.youkuaiyun.com/hdweilao/article/details/50179387</guid><author>hdweilao</author><pubDate>Fri, 04 Dec 2015 20:52:24 +0800</pubDate><description><![CDATA[LCM Walk

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)

Total Submission(s): 205    Accepted Submission(s): 111


Problem Description
A frog has just lea]]></description><category></category></item><item><title><![CDATA[Hdoj.5585  Numbers【简单题，水】  2015/12/03]]></title><link>https://blog.youkuaiyun.com/hdweilao/article/details/50166217</link><guid>https://blog.youkuaiyun.com/hdweilao/article/details/50166217</guid><author>hdweilao</author><pubDate>Thu, 03 Dec 2015 21:04:11 +0800</pubDate><description><![CDATA[Numbers

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)

Total Submission(s): 448    Accepted Submission(s): 279


Problem Description
There is a number N.]]></description><category></category></item><item><title><![CDATA[Hdoj.2058  The sum problem【数列】  2015/11/24]]></title><link>https://blog.youkuaiyun.com/hdweilao/article/details/50019609</link><guid>https://blog.youkuaiyun.com/hdweilao/article/details/50019609</guid><author>hdweilao</author><pubDate>Tue, 24 Nov 2015 22:26:43 +0800</pubDate><description><![CDATA[The sum problem

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 19595    Accepted Submission(s): 5779


Problem Description
Given a s]]></description><category></category></item><item><title><![CDATA[Poj.2689  Prime Distance【素数筛选】  2015/11/13]]></title><link>https://blog.youkuaiyun.com/hdweilao/article/details/49824239</link><guid>https://blog.youkuaiyun.com/hdweilao/article/details/49824239</guid><author>hdweilao</author><pubDate>Fri, 13 Nov 2015 21:52:04 +0800</pubDate><description><![CDATA[Prime Distance




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 14884
 
Accepted: 3949




Description

The branch of mathematics called number theory is about pro]]></description><category></category></item><item><title><![CDATA[Poj.1730  Perfect Pth Powers【数学】  2015/11/13]]></title><link>https://blog.youkuaiyun.com/hdweilao/article/details/49822565</link><guid>https://blog.youkuaiyun.com/hdweilao/article/details/49822565</guid><author>hdweilao</author><pubDate>Fri, 13 Nov 2015 20:11:56 +0800</pubDate><description><![CDATA[Perfect Pth Powers




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 17232
 
Accepted: 3946




Description

We say that x is a perfect square if, for some integer ]]></description><category></category></item><item><title><![CDATA[ZOJ.2952  Find All M^N Please【数学】  2015/10/20]]></title><link>https://blog.youkuaiyun.com/hdweilao/article/details/49284927</link><guid>https://blog.youkuaiyun.com/hdweilao/article/details/49284927</guid><author>hdweilao</author><pubDate>Tue, 20 Oct 2015 22:31:40 +0800</pubDate><description><![CDATA[Find All M^N Please

Time Limit: 2 Seconds      
Memory Limit: 65536 KB 


Recently, Joey has special interest in the positive numbers that could be represented as
M ^ N (M to the power N), whe]]></description><category></category></item><item><title><![CDATA[ZOJ.1439  Area Ratio【三角形外接圆内切圆】  2015/10/20]]></title><link>https://blog.youkuaiyun.com/hdweilao/article/details/49281747</link><guid>https://blog.youkuaiyun.com/hdweilao/article/details/49281747</guid><author>hdweilao</author><pubDate>Tue, 20 Oct 2015 19:53:38 +0800</pubDate><description><![CDATA[Area Ratio

Time Limit: 2 Seconds      
Memory Limit: 65536 KB 


To make things easier, WishingBone decides to put this simple geometry problem at the beginning. Given a triangle, what is the r]]></description><category></category></item><item><title><![CDATA[ZOJ.1152  A Mathematical Curiosity  2015/10/12]]></title><link>https://blog.youkuaiyun.com/hdweilao/article/details/49081539</link><guid>https://blog.youkuaiyun.com/hdweilao/article/details/49081539</guid><author>hdweilao</author><pubDate>Mon, 12 Oct 2015 22:19:50 +0800</pubDate><description><![CDATA[A Mathematical Curiosity

Time Limit: 2 Seconds      
Memory Limit: 65536 KB 


Given two integers n and m, count the number of pairs of integers (a,b) such that 0 

This problem contains mult]]></description><category></category></item><item><title><![CDATA[ZOJ.2679  Old Bill【水】  2015/10/12]]></title><link>https://blog.youkuaiyun.com/hdweilao/article/details/49081311</link><guid>https://blog.youkuaiyun.com/hdweilao/article/details/49081311</guid><author>hdweilao</author><pubDate>Mon, 12 Oct 2015 22:03:47 +0800</pubDate><description><![CDATA[Old Bill

Time Limit: 2 Seconds      
Memory Limit: 65536 KB 


Among grandfather��s papers a bill was found:
72 turkeys $_679_
The first and the last digits of the number that obviously repre]]></description><category></category></item><item><title><![CDATA[Poj.1775  Sum of Factorials【略坑】  2015/10/12]]></title><link>https://blog.youkuaiyun.com/hdweilao/article/details/49069759</link><guid>https://blog.youkuaiyun.com/hdweilao/article/details/49069759</guid><author>hdweilao</author><pubDate>Mon, 12 Oct 2015 12:15:02 +0800</pubDate><description><![CDATA[Sum of Factorials




Time Limit: 1000MS
 
Memory Limit: 30000K


Total Submissions: 13191
 
Accepted: 4371




Description
John von Neumann, b. Dec. 28, 1903, d. Feb. 8, 1957, was a]]></description><category></category></item><item><title><![CDATA[ZOJ.2358  Sum of Factorials【略坑】  2015/10/12]]></title><link>https://blog.youkuaiyun.com/hdweilao/article/details/49069723</link><guid>https://blog.youkuaiyun.com/hdweilao/article/details/49069723</guid><author>hdweilao</author><pubDate>Mon, 12 Oct 2015 09:50:00 +0800</pubDate><description><![CDATA[Sum of Factorials

Time Limit: 2 Seconds      
Memory Limit: 65536 KB 


John von Neumann, b. Dec. 28, 1903, d. Feb. 8, 1957, was a Hungarian-American mathematician who made important contributi]]></description><category></category></item><item><title><![CDATA[ZOJ.3131  Digital Clock【打表】  2015/10/11]]></title><link>https://blog.youkuaiyun.com/hdweilao/article/details/49053351</link><guid>https://blog.youkuaiyun.com/hdweilao/article/details/49053351</guid><author>hdweilao</author><pubDate>Sun, 11 Oct 2015 21:40:47 +0800</pubDate><description><![CDATA[Digital Clock

Time Limit: 1 Second      
Memory Limit: 32768 KB 



Digital clocks usually show the time in the form hh:mm:ss, where hh is a number between 00 and 23, and both mm and ss are nu]]></description><category></category></item></channel></rss>