06 2013 档案
摘要：KingTime Limit:1000MSMemory Limit:10000KTotal Submissions:8660Accepted:3263DescriptionOnce, in one kingdom, there was a queen and that queen was expecting a baby. The queen prayed: ``If my child was a son and if only he was a sound king.'' After nine months her child was born, and indeed, sh
阅读全文
摘要：THE MATRIX PROBLEMTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5437Accepted Submission(s): 1372Problem DescriptionYou have been given a matrix CN*M, each element E of CN*Mis positive and no more than 1000, The problem is that if there exist N nu
阅读全文
摘要：HOJ1402 整数划分http://acm.hit.edu.cn/hoj/problem/view?id=1402【题目描述】整数划分是一个经典的问题。希望这道题会对你的组合数学的解题能力有所帮助。Input每组输入是两个整数n和k。(1 #include#includeusing namespace std;const int maxn = 51;int n,k;int f[maxn][maxn], g[maxn][maxn];int f1[maxn][maxn], f2[maxn][maxn];int main () { int i, j; int ans1, ans2, a...
阅读全文
摘要：Human Gene FunctionsTime Limit:1000MSMemory Limit:10000KTotal Submissions:15269Accepted:8469DescriptionIt is well known that a human gene can be considered as a sequence, consisting of four nucleotides, which are simply denoted by four letters, A, C, G, and T. Biologists have been interested in iden
阅读全文
摘要：PearlsTime Limit:1000MSMemory Limit:10000KTotal Submissions:6383Accepted:3084DescriptionIn Pearlania everybody is fond of pearls. One company, called The Royal Pearl, produces a lot of jewelry with pearls in it. The Royal Pearl has its name because it delivers to the royal family of Pearlania. But i
阅读全文
摘要：AlignmentTime Limit:1000MSMemory Limit:30000KTotal Submissions:10804Accepted:3464DescriptionIn the army, a platoon is composed by n soldiers. During the morning inspection, the soldiers are aligned in a straight line in front of the captain. The captain is not satisfied with the way his soldiers are
阅读全文
摘要：The Cow LexiconTime Limit:2000MSMemory Limit:65536KTotal Submissions:7088Accepted:3299DescriptionFew know that the cows have their own dictionary withW(1 ≤W≤ 600) words, each containing no more 25 of the characters 'a'..'z'. Their cowmunication system, based on mooing, is not very ac
阅读全文
摘要：The number of stepsTime Limit: 1000ms Memory limit: 65536K有疑问？点这里^_^题目描述 Mary stands in a strange maze, the maze looks like a triangle（the first layer have one room，the second layer have two rooms，the third layer have three rooms …）. Now she stands at the top point(the first layer), and the KEY of .
阅读全文
摘要：Alice and BobTime Limit: 1000ms Memory limit: 65536K有疑问？点这里^_^题目描述 Alice and Bob like playing games very much.Today, they introduce a new game. There is apolynomial like this:(a0*x^(2^0)+1) * (a1* x^(2^1)+1)*.......*(an-1* x^(2^(n-1))+1). Then Alice ask Bob Q questions. In theexpansion of the Poly..
阅读全文
摘要：Matrix Power SeriesTime Limit:3000MSMemory Limit:131072KTotal Submissions:11954Accepted:5105DescriptionGiven an×nmatrixAand a positive integerk, find the sumS=A+A2+A3+ … +Ak.InputThe input contains exactly one test case. The first line of input contains three positive integersn(n≤ 30),k(k≤ 109)
阅读全文
摘要：DNA SequenceTime Limit:1000MSMemory Limit:65536KTotal Submissions:9889Accepted:3712DescriptionIt's well known that DNA Sequence is a sequence only contains A, C, T and G, and it's very useful to analyze a segment of DNA Sequence，For example, if a animal's DNA sequence contains segment AT
阅读全文
摘要：DNA repairTime Limit:2000MSMemory Limit:65536KTotal Submissions:4815Accepted:2237DescriptionBiologists finally invent techniques of repairing DNA that contains segments causing kinds of inherited diseases. For the sake of simplicity, a DNA is represented as a string containing characters 'A'
阅读全文
摘要：QueuingTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1949Accepted Submission(s): 911Problem DescriptionQueues and Priority Queues are data structures which are known to most computer scientists. The Queue occurs often in our daily life. There ar
阅读全文
摘要：Problem of PrecisionTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 686Accepted Submission(s): 386Problem DescriptionInputThe first line of input gives the number of cases, T. T test cases follow, each on a separate line. Each test case contains on
阅读全文
摘要：A Simple Math ProblemTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1697Accepted Submission(s): 959Problem DescriptionLele now is thinking about a simple function f(x).If x < 10 f(x) = x.If x >= 10 f(x) = a0 * f(x-1) + a1 * f(x-2) + a2 * f(x
阅读全文
摘要：A Multiplication GameTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2674Accepted Submission(s): 1532Problem DescriptionStan and Ollie play the game of multiplication by multiplying an integer p by one of the numbers 2 to 9. Stan always starts with
阅读全文
摘要：Organize Your Train part IITime Limit:1000MSMemory Limit:65536KTotal Submissions:6478Accepted:1871DescriptionRJ Freight, a Japanese railroad company for freight operations has recently constructed exchange lines at Hazawa, Yokohama. The layout of the lines is shown in Figure 1.Figure 1: Layout of th
阅读全文
摘要：Surprising StringsTime Limit:1000MSMemory Limit:65536KTotal Submissions:5081Accepted:3336DescriptionTheD-pairsof a string of letters are the ordered pairs of letters that are distance D from each other. A string isD-uniqueif all of its D-pairs are different. A string issurprisingif it is D-unique fo
阅读全文
摘要：Rescue The PrincessTime Limit: 1000ms Memory limit: 65536K有疑问？点这里^_^题目描述 Several days ago, a beast caught a beautiful princess and the princess was put in prison. To rescue the princess, a prince who wanted to marry the princess set out immediately. Yet, the beast set a maze. Only if the prince find
阅读全文
摘要：TautologyTime Limit:1000MSMemory Limit:65536KTotal Submissions:7716Accepted:2935DescriptionWFF 'N PROOF is a logic game played with dice. Each die has six faces representing some subset of the possible symbols K, A, N, C, E, p, q, r, s, t. A Well-formed formula (WFF) is any string of these symbo
阅读全文
摘要：TilingTime Limit:1000MSMemory Limit:65536KTotal Submissions:6746Accepted:3291DescriptionIn how many ways can you tile a 2xn rectangle by 2x1 or 2x2 tiles?Here is a sample tiling of a 2x17 rectangle.InputInput is a sequence of lines, each line containing an integer number 0 <= n <= 250.OutputFo
阅读全文
摘要：Y2K Accounting BugTime Limit:1000MSMemory Limit:65536KTotal Submissions:8282Accepted:4106DescriptionAccounting for Computer Machinists (ACM) has sufferred from the Y2K bug and lost some vital data for preparing annual report for MS Inc.All what they remember is that MS Inc. posted a surplus or a def
阅读全文
摘要：The Pilots Brothers' refrigeratorTime Limit:1000MSMemory Limit:65536KTotal Submissions:15136Accepted:5660Special JudgeDescriptionThe game “The Pilots Brothers: following the stripy elephant” has a quest where a player needs to open a refrigerator.There are 16 handles on the refrigerator door. Ev
阅读全文
摘要：Binary TreeTime Limit:1000MSMemory Limit:65536KTotal Submissions:5399Accepted:2502DescriptionBackgroundBinary trees are a common data structure in computer science. In this problem we will look at an infinite binary tree where the nodes contain a pair of integers. The tree is constructed like this:T
阅读全文
摘要：Dirichlet's Theorem on Arithmetic ProgressionsTime Limit:1000MSMemory Limit:65536KTotal Submissions:13636Accepted:6808DescriptionIfaanddare relatively prime positive integers, the arithmetic sequence beginning withaand increasing byd, i.e.,a,a+d,a+ 2d,a+ 3d,a+ 4d, ..., contains infinitely many p
阅读全文
摘要：Balanced LineupTime Limit:5000MSMemory Limit:65536KTotal Submissions:27567Accepted:12955Case Time Limit:2000MSDescriptionFor the daily milking, Farmer John'sNcows (1 ≤N≤ 50,000) always line up in the same order. One day Farmer John decides to organize a game of Ultimate Frisbee with some of the
阅读全文
摘要：Nearest Common AncestorsTime Limit:1000MSMemory Limit:10000KTotal Submissions:14221Accepted:7596DescriptionA rooted tree is a well-known data structure in computer science and engineering. An example is shown below:In the figure, each node is labeled with an integer from {1, 2,...,16}. Node 8 is the
阅读全文
摘要：Hawk-and-ChickenTime Limit: 6000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1259Accepted Submission(s): 360Problem DescriptionKids in kindergarten enjoy playing a game called Hawk-and-Chicken. But there always exists a big problem: every kid in this game want
阅读全文
摘要：The King’s ProblemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1142Accepted Submission(s): 424Problem DescriptionIn the Kingdom of Silence, the king has a new problem. There are N cities in the kingdom and there are M directional roads between t
阅读全文
摘要：Summer HolidayTime Limit: 10000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1147Accepted Submission(s): 503Problem DescriptionTo see a World in a Grain of SandAnd a Heaven in a Wild Flower,Hold Infinity in the palm of your handAnd Eternity in an hour.—— William
阅读全文
摘要：Proving EquivalencesTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1842Accepted Submission(s): 698Problem DescriptionConsider the following exercise, found in a generic linear algebra textbook.Let A be an n × n matrix. Prove that the followin
阅读全文
摘要：安装指令：sudo apt-get install apache2安装结束后：产生的启动和停止文件是：/etc/init.d/apache2启动：sudo apache2 start停止：sudo apache2 stop重新启动：sudo apache2 restart配置文件保存在 /etc/apache2 目录下 普通的apache发行版本配置文件是：httpd.conf，Ubuntu发行版本的主配置文件是：apache2.conf conf.d目录，包含的配置文件也会影响全局，其它包如果需要使用 apache 来为之服务的话可能会往里面添加文件、符号链接 envvars文件，在里面..
阅读全文
摘要：一，至于怎样安装配置mysql，网上有很多教程。。。。。。。。。。二, 登录到mysql服务器上： mysql -uroot -p 紧接着输入密码就可以了。三,my sql 命令的使用：以分号或\g结束，\c取消一行命令，\h帮助 1、显示数据库：show databases; 2、建数据库：create database [if not exists] 数据库名; 3、建数据表： create table [if not exists] 表名 (字段名1 类型。。。。。。。。) eg: create table student (编号 int auto...
阅读全文
摘要：gcc/g++参数详解2009-02-18 16:21这 篇文档是我的关于gcc参数的笔记,我很怀念dos年代我用小本子,纪录所有的dos 命令的参数.哈哈,下面的东西可能也不是很全面,我参考了很多的书,和gcc的帮助.不全的原因是,有可能我还没有看到这个参数,另一种原因是,我可能还 不会用它 不过,我会慢慢的补齐的.哈哈 如果你要转在本文章请保留我email(pianopan@beeship.com)和文章的全面性.[介绍]gcc and g++分别是gnu的c & c++编译器 gcc/g++在执行编译工作的时候，总共需要4步1.预处理,生成.i的文件[预处理器cpp]2.将预处理
阅读全文
摘要：pcap，即packet capture library 抓包库，这个抓包库给抓包系统提供了一个高层次的接口。所有网络上的数据包，甚至是那些发送给其他主机的，通过这种机制，都是可以捕获的。它也支持把捕获的数据包保存为本地文件和从本地文件读取信息。 还有一些详细介绍可以参考：http://baike.baidu.com/view/6584893.htm libpcap 的一些介绍，http://baike.baidu.com/view/1319961.htm and 这是libpcap的下载资料 http://www.tcpdump.org/release/有一些步骤或者安装错误的解...
阅读全文
摘要：apt-get安装(快)sudo apt-get install libxext6 libxext-devlibqt4-devlibqt4-gui libqt4-sql qt4-dev-tools qt4-doc qt4-designer qt4-qtconfig "python-qt4-*"python-qt4编译安装(慢) 1, 安装SIP 从 http://www.riverbankcomputing.co.uk/software/sip/download 下载压缩包解压 sudo python configure.py make sudo make inst...
阅读全文
摘要：一个月前研究了下PyQt4，感觉比较不错。相比wxpython，界面美观了很多，并且将界面设计与代码逻辑很好的分离了开来。关于PyQt4的资料也不少，这里我将我找到的资料汇总一下，以防自己以后忘得一干二净。1.PyQt4资料链接http://www.riverbankcomputing.comhttp://wiki.woodpecker.org.cn/moin/PyQthttp://www.commandprompt.com/community/pyqt/book1http://wiki.python.org/moin/PyQthttp://code.google.com/p/pyqt-doc
阅读全文
摘要：最近学习python语言，碰到数据类型间的转换问题。看到一篇文章总结的挺详细，收藏之备用。类型转换 : 1 int(x [,base ]) 将x转换为一个整数 2 long(x [,base ]) 将x转换为一个长整数 3 float(x ) 将x转换到一个浮点数 4 complex(real [,imag ]) 创建一个复数 5 str(x ) 将对象 x 转换为字符串 6 repr(x ) 将对象 x 转换为表达式字符串 7 eval(str ) ...
阅读全文
摘要：Python的文件处理和相关输入输出能力。介绍文件对象（它的内建函数，内建方法和属性），标准文件，同时讨论文件系统的访问方法，文件执行，以及相关文件模块。一，内建函数open（）和file（） 语法：file_object = open(fiel_name, access_mode=’r’, buffering=-1) File_name是要打开的文件名字的字符串，可以使相对路径或者绝对路径，access_mode可选参数，表示文件打开的模式，’r’,’w’,’a’ 分别代表读取，写入和追加。还有个’U’模式，代表通用换行符支持。 ‘r’或者’U’模式打开的文件必须是已经...
阅读全文
摘要：关于Unicode的详细情况可以参考百度百科：http://baike.baidu.com/view/40801.htm这里简单的说一下。（下面内容基本上时从《Python.Core.Programming.2ed》上摘的）Unicode是计算机可以支持这个星球上的多种语言的秘密武器，在Unicode之前，用的都是ASCII，ASCII吗非常简单，每个英文字符都用7位二进制数的方式存储在计算机内，其范围是32到126.它的实现原理这里也不说了。但是ASCII码只能表示95个可打印的字符，后来把ASCII扩展到了8位，这样就能表示223个字符了，虽然这个来表示欧美字母语言已经足够了，但是对于像中
阅读全文
摘要：1, 从文件的读取与输出： http://www.cnblogs.com/xuxn/archive/2011/07/27/read-a-file-with-python.html http://www.cnblogs.com/sysuoyj/archive/2012/03/14/2395789.html2,Python程序输出到文件中： http://www.cnblogs.com/sysuoyj/archive/2012/03/14/2395868.html3,Python 学习-常用工具： http://www.cnblogs.com/sysuoyj/archive/2012/03...
阅读全文
摘要：1,C语言实验——图形输出（字符常量练习）: http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=1112python中用print总是会出现回车空格，非常讨厌，然而，Python 3.0下print已经从语句变为函数了，我用的使python2.7.4,所以呢，还不行。。。。。但是我们可以用其他方法：import syssys.stdout.write("abc")sys.stdout.write("def")#!/usr/bin/env python#co
阅读全文
摘要：方格取数(2)Time Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3387Accepted Submission(s): 1045Problem Description给你一个m*n的格子的棋盘，每个格子里面有一个非负数。从中取出若干个数，使得任意的两个数所在的格子没有公共边，就是说所取数所在的2个格子不能相邻，并且取出的数的和最大。Input包括多个测试实例，每个测试实例包括2整数m,n和m*n个非负数(m<=50,n<=50)Ou
阅读全文
摘要：http://www.programlife.net/gdb-manual.htmlhttp://blog.csdn.net/liuhongxiangm/article/details/78687117篇GDB调试程序（很不错的）：http://blog.csdn.net/haoel/article/details/2879（14篇）makefile的学习：http://blog.csdn.net/haoel/article/details/2886GDB命令行参数启动GDB：lgdb executablelgdb -e executable -c core-filelgdb executab
阅读全文
摘要：gdb常用命令：http://www.cnblogs.com/wangkangluo1/archive/2012/05/28/2521432.html
阅读全文
摘要：1, 先写一个简单的冒泡排序吧：#!/usr/bin/env python# coding=utf-8#这是一个简单的python冒泡排序array = [1,2,5,3,6,8,4]for i in range(len(array)-1,0,-1): for j in range(0,i): if array[j]>array[j+1]: array[j],array[j+1] = array[j+1],array[j]print arrayrange函数详解见：http://www.cnblogs.com/buro79xxd/archive/201...
阅读全文
摘要：ubuntu下 gnome 自带的截图工具其实也还不错，有快捷键，可以在命令行下用 --window 的方式指定对某窗进行截图，也可以使用 --border 来指定是否包含窗体边框，甚至可以有阴影。但我还是不满意，因为我经常需要用鼠标划定一个范围来截图，GNOME自带的就没法做到了。Scrot，也是一个命令行下使用的截图工具，支持全屏、窗口、选取、多设备、缩略图、延时，甚至可以截图完毕之后指定某程序打开截好的图片。安装：可以打开新立得搜索 scrot 并安装，也可以在终端：sudo apt-get install scrot来进行安装。Scrot 使用：--------------------
阅读全文
摘要：1, A+B Problem ：http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=1000#!/usr/bin/env python # coding=utf-8 a=[] for x in raw_input().split(): a.append(int(x)) print sum(a) 下面的代码只有一行，，可惜不是我想出来的！！！！：print sum(int(x) for x in raw_input().split()) 2,A+B for Input-Out...
阅读全文
摘要：原文链接 catchattrchgrpchmodchowncksumcmpdiffdiffstatfilefindgitgitviewindentcutlnlesslocateisattrmattribmcmdelmdirmktempmoremmovemreadmrenmtoolsmtoolstestmvodpastepatchrcprmslocatesplitteetmpwatchtouchumaskwhichcpinmcopymshowfatrhmaskwhereis cddfdirsduedquotaejectmcdmdeltreemdumkdirmlabelmmdmrdmzippwdq
阅读全文
摘要：键盘移动 (Move)一切都从键盘的移动k-> 上 upj-> 下 downh-> 左 leftl-> 右 rightz-> 重画屏幕，当前光标变成屏幕的第一行 (redraw current line at top of window)CTRL-f-> 跳到下一页 (page down)CTRL-b-> 跳到上一页 (page up)跳跃指令 (jumps)跳跃指令类似于游览器中的<前进><后退>按钮CTRL-]-> 跟着link/tag转入 (follow link/tag)CTRL-o-> 回到上一次的jump
阅读全文
