摘要： Power of CryptographyTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 17945Accepted: 9053DescriptionCurrent work in cryptography involves (amo... 阅读全文

摘要： Radar InstallationTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 49381Accepted: 11033DescriptionAssume the coasting is an infinite straight ... 阅读全文

摘要： The Pilots Brothers' refrigeratorTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 17620Accepted: 6676Special JudgeDescriptionThe game “The Pil... 阅读全文

摘要： Flip GameTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 29059Accepted: 12568DescriptionFlip game is played on a rectangular 4x4 field with t... 阅读全文

摘要： 翻纸牌游戏Time Limit: 9000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2086Accepted Submission(s): 747Problem Descri... 阅读全文

摘要： 文件系统或磁盘的挂载 通常我们使用mount命令挂载格式化好的磁盘或分区 命令格式如下： mount xxx1 xxx2 （xxx1代表要挂载的分区，xxx2代表挂载点） 例子： mount /dev/sda3 /mnt 挂载完后，可用mount命令查看所有挂载的设备 常用的参数:... 阅读全文

摘要： 废话少说，先上图。。。。贴vim配置文件。位置在~/.vimrc 1 call pathogen#infect() 2 """""""""""""""""""""""""""""""""""""""" 阅读全文

摘要： Labeling BallsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 9070Accepted: 2451DescriptionWindy has N balls of distinct weights from 1 unit to N units. Now he tries to label them with 1 to N in such a way that:No two balls share the same label.The labeling satisfies several constrains like 阅读全文

摘要： 区间最大数Time Limit:1 SecMemory Limit:128 MBSubmit:16Solved:4[Submit][Status][Discuss]Description给出一列数共N个，将其从1到N编号，进行M次查询[X,Y](X<=Y)，给出第X个数到第Y个数间最大的数Input一组测试数据，第一行输入N，M（1<=N,M<=10^5），第二行N个数；之后M行，每行分别为X，Y。给出一列数共N个，将其从1到N编号，进行M次查询[X,Y](X<=Y)，给出第X个数到第Y个数间最大的数。Output对于每个[X,Y]输出编号在X和Y之间（包括X，Y）的最 阅读全文

摘要： Wooden SticksTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8280Accepted Submission(s): 3371Problem DescriptionThere is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodwo 阅读全文