<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[魔神翼]]></title><description><![CDATA[ACM库]]></description><link>https://blog.csdn.net/power721</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; power721]]></copyright><item><title><![CDATA[恭喜Minya Konka获得第一块银牌！]]></title><link>https://blog.csdn.net/power721/article/details/12890629</link><guid>https://blog.csdn.net/power721/article/details/12890629</guid><author>power721</author><pubDate>Sun, 20 Oct 2013 21:35:35 +0800</pubDate><description><![CDATA[S#

School

Rk

Team

Slv.

Time

A
37/160

B
44/355

C
3/14

D
40/286

E
1/2

F
122/424

G
3/52

H
165/189

I
0/46

J
105/434



1

清华大学

1

NowOrNev]]></description><category></category></item><item><title><![CDATA[DLX算法解数独游戏 Java版]]></title><link>https://blog.csdn.net/power721/article/details/9297045</link><guid>https://blog.csdn.net/power721/article/details/9297045</guid><author>power721</author><pubDate>Thu, 11 Jul 2013 09:38:50 +0800</pubDate><description><![CDATA[使用DLX算法解数独游戏。
初学Java，算法代码是由C代码转换的。
DLX.java是算法类，Sudoku.java是界面类。
解号称世界上最难的数独用时10ms以内。


算法详解
Sudoku 数独 Dancing Links模板
使用方法
int n = 9;
DLX dlx = new DLX(n * n * n + 1, 4 * n * n);
         ]]></description><category></category></item><item><title><![CDATA[Python获取命令行参数]]></title><link>https://blog.csdn.net/power721/article/details/8749576</link><guid>https://blog.csdn.net/power721/article/details/8749576</guid><author>power721</author><pubDate>Tue, 02 Apr 2013 08:53:07 +0800</pubDate><description><![CDATA[sys.argv[]
 
包含命令行参数的字符串列表，通过下标获取参数。
 
例如:
 


#!/usr/bin/python
# Filename: using_sys.py
  
import sys
  
print 'The command line arguments are:'
for i in sys.argv:
    print i
  
print '\n\n]]></description><category></category></item><item><title><![CDATA[MYSQL数据库由latin1转换为utf8]]></title><link>https://blog.csdn.net/power721/article/details/8733725</link><guid>https://blog.csdn.net/power721/article/details/8733725</guid><author>power721</author><pubDate>Thu, 28 Mar 2013 21:24:41 +0800</pubDate><description><![CDATA[需要将MySQL数据库由latin1编码转换为utf8编码，网上搜了些方法都不管用。
自己多次摸索找出了一个可行方法：
0.下载工具Navicat for MySQL
1.将数据库的表结构导出 mysqldump -uuser -p -d db > db.sql
2.编辑db.sql，将latin1替换为utf8
3.新建一个新的数据库newdb，运行db.sql创建表
4.用Navi]]></description><category></category></item><item><title><![CDATA[杀毒软件误杀]]></title><link>https://blog.csdn.net/power721/article/details/8569492</link><guid>https://blog.csdn.net/power721/article/details/8569492</guid><author>power721</author><pubDate>Mon, 04 Feb 2013 16:45:02 +0800</pubDate><description><![CDATA[今天早上来上班的时候，杀毒软件弹出提示：发现了几个病毒程序。
我一看是我很久以前写的HDU的水题程序，怎么现在才报毒呢。
这个肯定是误报，早就听同事讲了，电脑中毒会收到警告信。
果然给我发Email了，说下次再发现就要报告经理了。
中午没想通果断回邮件说是误杀。

I can guarantee that they are not virus.
They are some simpl]]></description><category></category></item><item><title><![CDATA[Python正则表达式指南]]></title><link>https://blog.csdn.net/power721/article/details/8245985</link><guid>https://blog.csdn.net/power721/article/details/8245985</guid><author>power721</author><pubDate>Sat, 01 Dec 2012 11:32:09 +0800</pubDate><description><![CDATA[本文介绍了Python对于正则表达式的支持，包括正则表达式基础以及Python正则表达式标准库的完整介绍及使用示例。本文的内容不包括如何编写高效的正则表达式、如何优化正则表达式，这些主题请查看其他教程。

注意：本文基于Python2.4完成；如果看到不明白的词汇请记得百度谷歌或维基，whatever。

尊重作者的劳动，转载请注明作者及原文地址http://www.cnblogs.com]]></description><category></category></item><item><title><![CDATA[Python素数筛选法]]></title><link>https://blog.csdn.net/power721/article/details/8216619</link><guid>https://blog.csdn.net/power721/article/details/8216619</guid><author>power721</author><pubDate>Fri, 23 Nov 2012 14:37:49 +0800</pubDate><description><![CDATA[原理：
　　素数，指在一个大于1的自然数中，除了1和此整数自身外，不能被其他自然数整除的数。在加密应用中起重要的位置，比如广为人知的RSA算法中，就是基于大整数的因式分解难题，寻找两个超大的素数然后相乘作为密钥的。一个比较常见的求素数的办法是埃拉托斯特尼筛法(the
 Sieve of Eratosthenes) ，说简单一点就是画表格，然后删表格，如图所示：

　　从2开始依次往后面数，]]></description><category></category></item><item><title><![CDATA[PHP, Perl, Python, Ruby语言对比]]></title><link>https://blog.csdn.net/power721/article/details/8199603</link><guid>https://blog.csdn.net/power721/article/details/8199603</guid><author>power721</author><pubDate>Mon, 19 Nov 2012 14:57:46 +0800</pubDate><description><![CDATA[原文 http://hyperpolyglot.org/scripting

Hyperpolyglot




Interpreted Languages: PHP, Perl, Python, Ruby (Sheet One) 

a side-by-side reference sheet
sheet one: variables and expressions |ari]]></description><category></category></item><item><title><![CDATA[C 变量存储类型]]></title><link>https://blog.csdn.net/power721/article/details/8199547</link><guid>https://blog.csdn.net/power721/article/details/8199547</guid><author>power721</author><pubDate>Mon, 19 Nov 2012 14:48:00 +0800</pubDate><description><![CDATA[在C语言中，供用户使用的存储空间分为三类：程序区、静态存储区、动态存储区。

程序存放的是可执行程序的机器指令；静态存储区存放的是在程序运行过程中需要占用的固定存储单元的变量，如全局变量动态存储区存放的是在程序运行过程中根据需要动态分配内容空间的变量，如形式参数、局部变量

变量存储类型
 
 变量存储类型指的是数据在内存中存储的方式。变量的存储方式可以分为两类：静态存储类和动态存储类]]></description><category></category></item><item><title><![CDATA[php效率高写法]]></title><link>https://blog.csdn.net/power721/article/details/7376926</link><guid>https://blog.csdn.net/power721/article/details/7376926</guid><author>power721</author><pubDate>Wed, 21 Mar 2012 10:33:40 +0800</pubDate><description><![CDATA[0、用单引号代替双引号来包含字符串，这样做会更快一些。因为PHP会在双引号包围的字符串中搜寻变量，单引号则不会，注意：只有echo能这么做，它是一种可以把多个字符串当作参数的“函数”（译注：PHP手册中说echo是语言结构，不是真正的函数，故把函数加上了双引号）。

1、如果能将类的方法定义成static，就尽量定义成static，它的速度会提升将近4倍。
2、$row[’id’] 的速度是]]></description><category></category></item><item><title><![CDATA[POJ 3921 HDU 2485 Destroying the bus stations 最小费用最大流]]></title><link>https://blog.csdn.net/power721/article/details/6978157</link><guid>https://blog.csdn.net/power721/article/details/6978157</guid><author>power721</author><pubDate>Wed, 16 Nov 2011 19:18:29 +0800</pubDate><description><![CDATA[Destroying the bus stations




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 641
 
Accepted: 188




Description
Gabiluso is one of the greatest spies in his countr]]></description><category></category></item><item><title><![CDATA[HDU 3696 FZU 2006 -- Farm Game SPFA最长路 2010福州区域赛]]></title><link>https://blog.csdn.net/power721/article/details/6968014</link><guid>https://blog.csdn.net/power721/article/details/6968014</guid><author>power721</author><pubDate>Mon, 14 Nov 2011 11:30:42 +0800</pubDate><description><![CDATA[Farm Game
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 62768/32768 K (Java/Others)
Total Submission(s): 148 Accepted Submission(s): 65



Problem Description
“Farm Game” is one of the m]]></description><category></category></item><item><title><![CDATA[POJ 3894 System Engineer 二分图匹配 Hopcroft_Carp 最大流]]></title><link>https://blog.csdn.net/power721/article/details/6960090</link><guid>https://blog.csdn.net/power721/article/details/6960090</guid><author>power721</author><pubDate>Fri, 11 Nov 2011 15:41:52 +0800</pubDate><description><![CDATA[System Engineer




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 236
 
Accepted: 98




Description
Bob is a skilled system engineer. He is always facing challengin]]></description><category></category></item><item><title><![CDATA[HDU 4115 Eliminate the Conflict 2-sat]]></title><link>https://blog.csdn.net/power721/article/details/6958695</link><guid>https://blog.csdn.net/power721/article/details/6958695</guid><author>power721</author><pubDate>Fri, 11 Nov 2011 10:03:39 +0800</pubDate><description><![CDATA[Eliminate the Conflict
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 128 Accepted Submission(s): 67



Problem Description
Conflicts are]]></description><category></category></item><item><title><![CDATA[成都赛区2]]></title><link>https://blog.csdn.net/power721/article/details/6955959</link><guid>https://blog.csdn.net/power721/article/details/6955959</guid><author>power721</author><pubDate>Thu, 10 Nov 2011 14:10:40 +0800</pubDate><description><![CDATA[今年我们学校三支队伍出战成都赛区，其中我们学院两支队伍，获得三个铜奖的成绩。
这个成绩是我们学校目前为止最好的成绩了。
但是我们的银牌目标还是没达到，我们计划自费去福州赛区争取拿银牌。
不管结果怎么样，这是我ACM的最后一战了。
比赛结束后，我就要去工作实习，ACM生涯可能就从此终结了。
希望再次去福州能留下美好的回忆。
我们学校的未来就靠你们了！
加油吧！少年们。]]></description><category></category></item><item><title><![CDATA[POJ 3614 Sunscreen 最大流、多重匹配、贪心]]></title><link>https://blog.csdn.net/power721/article/details/6931676</link><guid>https://blog.csdn.net/power721/article/details/6931676</guid><author>power721</author><pubDate>Thu, 03 Nov 2011 12:32:13 +0800</pubDate><description><![CDATA[Sunscreen




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 1966
 
Accepted: 688




Description


To avoid unsightly burns while tanning, each of the C (1 ≤ C ≤ 2]]></description><category></category></item><item><title><![CDATA[HDU 4109 Instrction Arrangement 差分约束系统]]></title><link>https://blog.csdn.net/power721/article/details/6928107</link><guid>https://blog.csdn.net/power721/article/details/6928107</guid><author>power721</author><pubDate>Wed, 02 Nov 2011 13:19:21 +0800</pubDate><description><![CDATA[Instrction Arrangement
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 107 Accepted Submission(s): 48



Problem Description
Ali has taken]]></description><category></category></item><item><title><![CDATA[POJ3662 Telephone Lines 二分+最短路]]></title><link>https://blog.csdn.net/power721/article/details/6917521</link><guid>https://blog.csdn.net/power721/article/details/6917521</guid><author>power721</author><pubDate>Sat, 29 Oct 2011 20:31:53 +0800</pubDate><description><![CDATA[Telephone Lines




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 3468
 
Accepted: 1245




Description


Farmer John wants to set up a telephone line at his farm.]]></description><category></category></item><item><title><![CDATA[POJ 2286 HDU 1667 ZOJ 2396 The Rotation Game IDA*迭代加深搜索]]></title><link>https://blog.csdn.net/power721/article/details/6876878</link><guid>https://blog.csdn.net/power721/article/details/6876878</guid><author>power721</author><pubDate>Sat, 15 Oct 2011 21:38:37 +0800</pubDate><description><![CDATA[The Rotation Game




Time Limit: 15000MS
 
Memory Limit: 150000K


Total Submissions: 3819
 
Accepted: 1262




Descriptio]]></description><category></category></item><item><title><![CDATA[HDU2821 Pusher HDU3500 Fling DFS搜索]]></title><link>https://blog.csdn.net/power721/article/details/6860792</link><guid>https://blog.csdn.net/power721/article/details/6860792</guid><author>power721</author><pubDate>Mon, 10 Oct 2011 22:15:42 +0800</pubDate><description><![CDATA[Pusher
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/65536 K (Java/Others)
Total Submission(s): 169 Accepted Submission(s): 6]]></description><category></category></item></channel></rss>