<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[chengouxuan的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/chengouxuan</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; chengouxuan]]></copyright><item><title><![CDATA[zoj 3583 simple path]]></title><link>https://blog.youkuaiyun.com/chengouxuan/article/details/7412516</link><guid>https://blog.youkuaiyun.com/chengouxuan/article/details/7412516</guid><author>chengouxuan</author><pubDate>Fri, 30 Mar 2012 17:51:26 +0800</pubDate><description><![CDATA[Simple Path

Time Limit: 2 Seconds      Memory Limit: 65536 KB


A path with no repeated vertices of an undirected graph is called a simple path. Given an undirected graph and two verteices S and]]></description><category></category></item><item><title><![CDATA[zoj 3590 -3+1]]></title><link>https://blog.youkuaiyun.com/chengouxuan/article/details/7400611</link><guid>https://blog.youkuaiyun.com/chengouxuan/article/details/7400611</guid><author>chengouxuan</author><pubDate>Tue, 27 Mar 2012 21:18:52 +0800</pubDate><description><![CDATA[-3+1

Time Limit: 2 Seconds      Memory Limit: 65536 KB

ZOJ is 10 years old! For celebrating, we are offering the easiest problem in the world to you.
Recently we received a long sequence. We ca]]></description><category></category></item><item><title><![CDATA[zoj 3578 matrix]]></title><link>https://blog.youkuaiyun.com/chengouxuan/article/details/7329725</link><guid>https://blog.youkuaiyun.com/chengouxuan/article/details/7329725</guid><author>chengouxuan</author><pubDate>Wed, 07 Mar 2012 17:22:22 +0800</pubDate><description><![CDATA[Matrix

Time Limit: 10 Seconds      Memory Limit: 131072 KB


A N*M coordinate plane ((0, 0)~(n, m)). Initially the value of all N*M grids are 0.
An operation T(a, b, h, x, y) is defined as foll]]></description><category></category></item><item><title><![CDATA[zoj 3580 angry birds 愤怒的小鸟（zoj 的题目就是与时俱进啊）]]></title><link>https://blog.youkuaiyun.com/chengouxuan/article/details/7329156</link><guid>https://blog.youkuaiyun.com/chengouxuan/article/details/7329156</guid><author>chengouxuan</author><pubDate>Wed, 07 Mar 2012 15:45:11 +0800</pubDate><description><![CDATA[Angry Birds

Time Limit: 4 Seconds      Memory Limit: 65536 KB


In the famous game Angry Birds, players can choose a direction to shoot a blue bird, which can be spilt into three birds to hit th]]></description><category></category></item><item><title><![CDATA[uva 10042 smith numbers]]></title><link>https://blog.youkuaiyun.com/chengouxuan/article/details/7211310</link><guid>https://blog.youkuaiyun.com/chengouxuan/article/details/7211310</guid><author>chengouxuan</author><pubDate>Thu, 19 Jan 2012 17:37:56 +0800</pubDate><description><![CDATA[Problem D: Smith Numbers 







Background 
While skimming his phone directory in 1982, Albert Wilansky, a mathematician of Lehigh University , noticed that the telephone number of his broth]]></description><category></category></item><item><title><![CDATA[uva 10168 summation of four primes]]></title><link>https://blog.youkuaiyun.com/chengouxuan/article/details/7211180</link><guid>https://blog.youkuaiyun.com/chengouxuan/article/details/7211180</guid><author>chengouxuan</author><pubDate>Thu, 19 Jan 2012 16:42:25 +0800</pubDate><description><![CDATA[Problem A
Summation of Four Primes
Input: standard input
Output: standard output
Time Limit: 4 seconds
 
Euler proved in one of his classic theorems that prime numbers are infinite in number. Bu]]></description><category></category></item><item><title><![CDATA[uva 10139 factovisors]]></title><link>https://blog.youkuaiyun.com/chengouxuan/article/details/7210555</link><guid>https://blog.youkuaiyun.com/chengouxuan/article/details/7210555</guid><author>chengouxuan</author><pubDate>Thu, 19 Jan 2012 13:00:55 +0800</pubDate><description><![CDATA[Problem D: Factovisors
The factorial function, n! is defined thus for n a non-negative integer:
   0! = 1
   n! = n * (n-1)!   (n > 0)

We say that a divides b if there exists an integer k such tha]]></description><category></category></item><item><title><![CDATA[uva 10049 self describing sequence]]></title><link>https://blog.youkuaiyun.com/chengouxuan/article/details/7209887</link><guid>https://blog.youkuaiyun.com/chengouxuan/article/details/7209887</guid><author>chengouxuan</author><pubDate>Wed, 18 Jan 2012 21:47:06 +0800</pubDate><description><![CDATA[Problem C: Self­describing Sequence 





Solomon Golomb's self­describing sequence  is
 the only non­decreasing sequence of positive integers with the property that it contains exactly f(k)]]></description><category></category></item><item><title><![CDATA[uva 10254 the priest mathematician]]></title><link>https://blog.youkuaiyun.com/chengouxuan/article/details/7209462</link><guid>https://blog.youkuaiyun.com/chengouxuan/article/details/7209462</guid><author>chengouxuan</author><pubDate>Wed, 18 Jan 2012 16:17:52 +0800</pubDate><description><![CDATA[Problem I
The Priest Mathematician
Input: standard input
Output: standard output
Time Limit: 10 seconds
 
The ancient folklore behind the "Towers of Hanoi" puzzle invented by E. Lucas in 1883 is]]></description><category></category></item><item><title><![CDATA[uva 10247 complete tree labeling]]></title><link>https://blog.youkuaiyun.com/chengouxuan/article/details/7208757</link><guid>https://blog.youkuaiyun.com/chengouxuan/article/details/7208757</guid><author>chengouxuan</author><pubDate>Wed, 18 Jan 2012 11:20:18 +0800</pubDate><description><![CDATA[Problem B
Complete Tree Labeling!
Input: standard input
Output: standard output
Time Limit: 45 seconds
Memory Limit: 32 MB
 
A complete k-ary tree is a k-ary tree in which all leaves have same]]></description><category></category></item><item><title><![CDATA[uva 10157 expressions]]></title><link>https://blog.youkuaiyun.com/chengouxuan/article/details/7207873</link><guid>https://blog.youkuaiyun.com/chengouxuan/article/details/7207873</guid><author>chengouxuan</author><pubDate>Tue, 17 Jan 2012 20:11:02 +0800</pubDate><description><![CDATA[Problem A: EXPRESSIONS 




Let X be the set of correctly built parenthesis expressions. The elements of X are strings consisting only of the characters �(� and �)�. The set X is defined as follo]]></description><category></category></item><item><title><![CDATA[uva 107 the cat in the hat]]></title><link>https://blog.youkuaiyun.com/chengouxuan/article/details/7198883</link><guid>https://blog.youkuaiyun.com/chengouxuan/article/details/7198883</guid><author>chengouxuan</author><pubDate>Fri, 13 Jan 2012 15:05:02 +0800</pubDate><description><![CDATA[The Cat in the Hat 






Background
(An homage to Theodore Seuss Geisel)
The Cat in the Hat is a nasty creature,
But the striped hat he is wearing has a rather nifty feature.
With one flic]]></description><category></category></item><item><title><![CDATA[uva 439 knight moves]]></title><link>https://blog.youkuaiyun.com/chengouxuan/article/details/7191312</link><guid>https://blog.youkuaiyun.com/chengouxuan/article/details/7191312</guid><author>chengouxuan</author><pubDate>Tue, 10 Jan 2012 16:24:04 +0800</pubDate><description><![CDATA[BFS








 Knight Moves 






A friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each]]></description><category></category></item><item><title><![CDATA[uva 294 divisors]]></title><link>https://blog.youkuaiyun.com/chengouxuan/article/details/7188781</link><guid>https://blog.youkuaiyun.com/chengouxuan/article/details/7188781</guid><author>chengouxuan</author><pubDate>Mon, 09 Jan 2012 23:57:46 +0800</pubDate><description><![CDATA[Divisors 





Mathematicians love all sorts of odd properties of numbers. For instance, they consider 945 to be an interesting number, since it is the first odd number for which the sum of its]]></description><category></category></item><item><title><![CDATA[uva 568 just the facts]]></title><link>https://blog.youkuaiyun.com/chengouxuan/article/details/7188245</link><guid>https://blog.youkuaiyun.com/chengouxuan/article/details/7188245</guid><author>chengouxuan</author><pubDate>Mon, 09 Jan 2012 18:34:04 +0800</pubDate><description><![CDATA[Just the Facts 





The expression N!, read as ``N factorial,"
 denotes the product of the first N positive
 integers, where N is nonnegative.
 So, for example,






N
N!


0
1]]></description><category></category></item><item><title><![CDATA[strassen矩阵乘法]]></title><link>https://blog.youkuaiyun.com/chengouxuan/article/details/6943833</link><guid>https://blog.youkuaiyun.com/chengouxuan/article/details/6943833</guid><author>chengouxuan</author><pubDate>Mon, 07 Nov 2011 16:22:32 +0800</pubDate><description><![CDATA[出处: http://www.ahhf45.com/info/data_structures_and_algorithms/algorithm/commonalg/misc/strassen/strassen.htm











上一页 | 返回目录 | 下一页




Strassen矩阵乘法
矩阵乘法是线性代数中最常见的运算之一，它在数值计算中有广]]></description><category></category></item><item><title><![CDATA[hdu 3363 ice sugar gourd]]></title><link>https://blog.youkuaiyun.com/chengouxuan/article/details/6939227</link><guid>https://blog.youkuaiyun.com/chengouxuan/article/details/6939227</guid><author>chengouxuan</author><pubDate>Sat, 05 Nov 2011 20:32:00 +0800</pubDate><description><![CDATA[Ice-sugar Gourd
Time Limit: 5000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 568    Accepted Submission(s): 207



Problem Description

Ice-sugar go]]></description><category></category></item><item><title><![CDATA[hdu 1799]]></title><link>https://blog.youkuaiyun.com/chengouxuan/article/details/6938153</link><guid>https://blog.youkuaiyun.com/chengouxuan/article/details/6938153</guid><author>chengouxuan</author><pubDate>Sat, 05 Nov 2011 11:48:16 +0800</pubDate><description><![CDATA[循环多少次？
Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1343    Accepted Submission(s): 485



Problem Description

  我们知道，在编程中，我们时常需要考虑]]></description><category></category></item><item><title><![CDATA[hdu 1716]]></title><link>https://blog.youkuaiyun.com/chengouxuan/article/details/6937901</link><guid>https://blog.youkuaiyun.com/chengouxuan/article/details/6937901</guid><author>chengouxuan</author><pubDate>Sat, 05 Nov 2011 10:12:40 +0800</pubDate><description><![CDATA[排列2
Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1853    Accepted Submission(s): 717



Problem Description

Ray又对数字的列产生了兴趣：
现有四张卡片]]></description><category></category></item><item><title><![CDATA[hdu 1521]]></title><link>https://blog.youkuaiyun.com/chengouxuan/article/details/6937637</link><guid>https://blog.youkuaiyun.com/chengouxuan/article/details/6937637</guid><author>chengouxuan</author><pubDate>Sat, 05 Nov 2011 01:15:41 +0800</pubDate><description><![CDATA[排列组合
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 811    Accepted Submission(s): 325



Problem Description

有n种物品，并且知道每种物品的数量。要求从中选]]></description><category></category></item></channel></rss>