<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[evi__的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/evi__</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; evi__]]></copyright><item><title><![CDATA[Linux重新开始]]></title><link>https://blog.youkuaiyun.com/evi__/article/details/135599276</link><guid>https://blog.youkuaiyun.com/evi__/article/details/135599276</guid><author>evi__</author><pubDate>Mon, 15 Jan 2024 13:39:07 +0800</pubDate><description><![CDATA[从0开始，热度不知道可以维持几天。]]></description><category></category></item><item><title><![CDATA[hdu2098--拆分素数和--数论]]></title><link>https://blog.youkuaiyun.com/evi__/article/details/22199929</link><guid>https://blog.youkuaiyun.com/evi__/article/details/22199929</guid><author>evi__</author><pubDate>Wed, 26 Mar 2014 18:14:08 +0800</pubDate><description><![CDATA[分拆素数和
Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 18944    Accepted Submission(s): 8252



Problem Description

把一个偶数拆成两个不同素数的和，有几种]]></description><category></category></item><item><title><![CDATA[HDU 1160 FatMouse's Speed--经典DP]]></title><link>https://blog.youkuaiyun.com/evi__/article/details/21984939</link><guid>https://blog.youkuaiyun.com/evi__/article/details/21984939</guid><author>evi__</author><pubDate>Mon, 24 Mar 2014 20:19:55 +0800</pubDate><description><![CDATA[FatMouse's Speed
Time Limit: 2000/1000 MS (Java/Others)
Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 4910 Accepted Submission(s): 2130
Special Judge


Problem Description

F]]></description><category></category></item><item><title><![CDATA[SDJZU--E坤哥的难题]]></title><link>https://blog.youkuaiyun.com/evi__/article/details/20210987</link><guid>https://blog.youkuaiyun.com/evi__/article/details/20210987</guid><author>evi__</author><pubDate>Sat, 01 Mar 2014 12:33:08 +0800</pubDate><description><![CDATA[题目链接

问题 E : 坤哥的难题


时间限制：1 秒

内存限制：256 兆

特殊判题： 否

提交：16

解决： 7




题目描述



八百年才能出现的好事接二连三的发生在了坤哥头上，可是你们总是让他的好事泡汤。坤哥不愿意了，他决心考考你们,先给你一个六位数，然后曲这个六位数中间四位，然后在让这个四位数平方，得到的这个数在取它的后六位。]]></description><category></category></item><item><title><![CDATA[sdjzu--画8]]></title><link>https://blog.youkuaiyun.com/evi__/article/details/20210939</link><guid>https://blog.youkuaiyun.com/evi__/article/details/20210939</guid><author>evi__</author><pubDate>Sat, 01 Mar 2014 12:15:24 +0800</pubDate><description><![CDATA[题目链接



问题 F : 8


时间限制：1 秒

内存限制：256 兆

特殊判题： 否

提交：38

解决： 10




题目描述



人们都喜欢8这个数字，手机号希望全是8，车牌号也希望全是8.在这个无发不在的世界，8俨然成为了人们发财的数字。为了以后我们的前途，大家来画8吧，谁画的标准，好看，谁的前途就越好。



输入格]]></description><category></category></item><item><title><![CDATA[sdjzu--人生三大幻觉 ----组合数学polya]]></title><link>https://blog.youkuaiyun.com/evi__/article/details/20210395</link><guid>https://blog.youkuaiyun.com/evi__/article/details/20210395</guid><author>evi__</author><pubDate>Sat, 01 Mar 2014 12:02:07 +0800</pubDate><description><![CDATA[问题 A : 人生三大幻觉


时间限制：1 秒

内存限制：256 兆

特殊判题： 否

提交：13

解决： 7



题目描述



人生三大幻觉是手机在震动、有人叫你、还有Ta喜欢你。可是这第三条幻觉偏偏就真正的发生在了坤哥身上，坤哥很是高兴。但是......，那妹子对坤哥说了“我脖子上戴的这串项链有n个珠子，可以用c种颜色对珠子涂染，你能告诉我能形]]></description><category></category></item><item><title><![CDATA[hdu 1072 Nightmare--bfs]]></title><link>https://blog.youkuaiyun.com/evi__/article/details/19971531</link><guid>https://blog.youkuaiyun.com/evi__/article/details/19971531</guid><author>evi__</author><pubDate>Wed, 26 Feb 2014 11:47:43 +0800</pubDate><description><![CDATA[题目链接
 
Nightmare
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6225    Accepted Submission(s): 3051



Problem Description
Ignatius]]></description><category></category></item><item><title><![CDATA[hdu 1026   Ignatius and the Princess I----bfs+递归]]></title><link>https://blog.youkuaiyun.com/evi__/article/details/19840369</link><guid>https://blog.youkuaiyun.com/evi__/article/details/19840369</guid><author>evi__</author><pubDate>Mon, 24 Feb 2014 20:33:50 +0800</pubDate><description><![CDATA[题目链接
Ignatius and the Princess I
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 10724 Accepted Submission(s): 3272
Special Judge


Problem]]></description><category></category></item><item><title><![CDATA[hdu1104 Remaindr-----bfs+数论]]></title><link>https://blog.youkuaiyun.com/evi__/article/details/19685985</link><guid>https://blog.youkuaiyun.com/evi__/article/details/19685985</guid><author>evi__</author><pubDate>Sat, 22 Feb 2014 15:26:08 +0800</pubDate><description><![CDATA[本题链接
 
题意:输入3个数 n,k,m ,问通过对n对m进行若干 +, - , * , % 4种操作后 ,能不能得到一个数N,使得 N%k == (n+1)%k
　　 若能,则输出进行操作次数 若不能,则输出0
　　 输入有多组数据,输入0 0 0表示所有数据结束.

这里的 % 不能直接使用 因为,题目中的%是数论中的取模.
%： 如果 a = b * q + r (q > 0]]></description><category></category></item><item><title><![CDATA[BFS DFS]]></title><link>https://blog.youkuaiyun.com/evi__/article/details/19566571</link><guid>https://blog.youkuaiyun.com/evi__/article/details/19566571</guid><author>evi__</author><pubDate>Thu, 20 Feb 2014 18:30:36 +0800</pubDate><description><![CDATA[广度优先搜索(Breadth-First-Search)和深度优先搜索(Deep－First－Search)是搜索策略中最经常用到的两种方法,特别常用于图的搜索.其中有很多的算法都用到了这两种思想,比如:Dijkstra单源最短路径算法和Prim最小生成树算法都采用了和宽度优先搜索类似的思想。

BFS的思想：
从一个图的某一个顶点V0出发，首先访问和V0相邻的且未被访问过的顶点V1、V2、]]></description><category></category></item><item><title><![CDATA[poj1016 Prime Ring Problem---dfs]]></title><link>https://blog.youkuaiyun.com/evi__/article/details/19559195</link><guid>https://blog.youkuaiyun.com/evi__/article/details/19559195</guid><author>evi__</author><pubDate>Thu, 20 Feb 2014 15:56:42 +0800</pubDate><description><![CDATA[Prime Ring Problem
Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 22718    Accepted Submission(s): 10116



Problem Description
A ring ]]></description><category></category></item><item><title><![CDATA[POJ1426 Find the multiple]]></title><link>https://blog.youkuaiyun.com/evi__/article/details/19422483</link><guid>https://blog.youkuaiyun.com/evi__/article/details/19422483</guid><author>evi__</author><pubDate>Tue, 18 Feb 2014 19:57:54 +0800</pubDate><description><![CDATA[Find The Multiple




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 16144
 
Accepted: 6600
 
Special Judge




Description

Given a positive integer n, write a pr]]></description><category></category></item><item><title><![CDATA[NBUT1220 spy]]></title><link>https://blog.youkuaiyun.com/evi__/article/details/19240829</link><guid>https://blog.youkuaiyun.com/evi__/article/details/19240829</guid><author>evi__</author><pubDate>Sat, 15 Feb 2014 15:00:58 +0800</pubDate><description><![CDATA[[1220] SPY

时间限制: 1000 ms　内存限制: 131072 K
问题描述




The
 National Intelligence Council of X Nation receives a piece of credible information that Nation Y will send spies to steal Nation X’sconf]]></description><category></category></item><item><title><![CDATA[NBUT1219 Time]]></title><link>https://blog.youkuaiyun.com/evi__/article/details/19233173</link><guid>https://blog.youkuaiyun.com/evi__/article/details/19233173</guid><author>evi__</author><pubDate>Sat, 15 Feb 2014 09:17:36 +0800</pubDate><description><![CDATA[[1219] Time

时间限制: 1000 ms　内存限制: 131072 K
问题描述


Digital
 clock use 4 digits to express time, each digit is described by 3*3 characters (including”|”,”_”and” “).now given the current time, plea]]></description><category></category></item><item><title><![CDATA[NBUT1218 You are my brother]]></title><link>https://blog.youkuaiyun.com/evi__/article/details/19233063</link><guid>https://blog.youkuaiyun.com/evi__/article/details/19233063</guid><author>evi__</author><pubDate>Sat, 15 Feb 2014 09:12:26 +0800</pubDate><description><![CDATA[[1218] You are my brother

时间限制: 1000 ms　内存限制: 131072 K
问题描述


Little
 A gets to know a new friend, Little B, recently. One day, they realize that they are family 500 years ago. Now, Little A w]]></description><category></category></item><item><title><![CDATA[NBUT 1217 Dinner]]></title><link>https://blog.youkuaiyun.com/evi__/article/details/19232977</link><guid>https://blog.youkuaiyun.com/evi__/article/details/19232977</guid><author>evi__</author><pubDate>Sat, 15 Feb 2014 09:07:39 +0800</pubDate><description><![CDATA[[1217] Dinner

时间限制: 1000 ms　内存限制: 32768 K
问题描述

Little A is one member of ACM team. He had just won the gold in World Final. To celebrate, he decided to invite all to have one meal. As bowl, kni]]></description><category></category></item><item><title><![CDATA[素数个数的位数nefu117]]></title><link>https://blog.youkuaiyun.com/evi__/article/details/19157065</link><guid>https://blog.youkuaiyun.com/evi__/article/details/19157065</guid><author>evi__</author><pubDate>Thu, 13 Feb 2014 11:56:53 +0800</pubDate><description><![CDATA[Time Limit 1000ms

Memory Limit 65536K








description




小明是一个聪明的孩子，对数论有着很浓烈的兴趣。他发现求1到正整数10n 之间有多少个素数是一个很难的问题，该问题的难以决定于n 值的大小。现在的问题是，告诉你n的值，让你帮助小明计算小于10n的素数的个数值共有多少位？
							

]]></description><category></category></item><item><title><![CDATA[五指山nefu84]]></title><link>https://blog.youkuaiyun.com/evi__/article/details/19129617</link><guid>https://blog.youkuaiyun.com/evi__/article/details/19129617</guid><author>evi__</author><pubDate>Wed, 12 Feb 2014 20:38:30 +0800</pubDate><description><![CDATA[description




西游记中孙吾空大闹天宫，如来佛祖前来降伏他，说道：“我与你打个赌赛；你若有本事，一筋斗打出我这右手掌中，算你赢，再不用动刀兵苦争战，就请玉帝到西方居住，把天宫让你；若不能打出手掌，你还下界为妖，再修几劫，却来争吵。”
那大圣闻言，暗笑道：“这如来十分好呆！我老孙一筋斗去十万八千里。他那手掌，方圆不满一尺，如何跳不出去？”急发声道：“既如此说，你可做得主张？]]></description><category></category></item><item><title><![CDATA[扩展欧几里得原理]]></title><link>https://blog.youkuaiyun.com/evi__/article/details/19122979</link><guid>https://blog.youkuaiyun.com/evi__/article/details/19122979</guid><author>evi__</author><pubDate>Wed, 12 Feb 2014 16:38:06 +0800</pubDate><description><![CDATA[欧几里德算法
概述
欧几里德算法又称辗转相除法，用于计算两个整数a,b的最大公约数。其计算原理依赖于下面的定理：
gcd函数就是用来求(a,b)的最大公约数的。
gcd函数的基本性质：
gcd(a,b)=gcd(b,a)=gcd(-a,b)=gcd(|a|,|b|)
 
 

C++语言实现









int
Gcd(int 
a, int b){]]></description><category></category></item><item><title><![CDATA[继续畅通工程]]></title><link>https://blog.youkuaiyun.com/evi__/article/details/19090035</link><guid>https://blog.youkuaiyun.com/evi__/article/details/19090035</guid><author>evi__</author><pubDate>Tue, 11 Feb 2014 22:12:24 +0800</pubDate><description><![CDATA[继续畅通工程
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 11375    Accepted Submission(s): 4984



Problem Description

省政府“畅通工程”的目标是使全省任何]]></description><category></category></item></channel></rss>