- 博客(43)
- 资源 (1)
- 收藏
- 关注
原创 NYOJ 题目860 又见01背包(01背包变形)
又见01背包时间限制:1000 ms | 内存限制:65535 KB难度:3描述 有n个重量和价值分别为wi 和 vi 的 物品,从这些物品中选择总重量不超过 W 的物品,求所有挑选方案中物品价值总和的最大值。 1 1 1 1 输入多组测试数据。每组测试数据第一行输入,n 和 W ,接下来有n行,每行输
2015-01-31 18:18:22 610 1
原创 NYOJ 题目236 心急的C小加(贪心)
心急的C小加时间限制:1000 ms | 内存限制:65535 KB难度:4描述C小加有一些木棒,它们的长度和质量都已经知道,需要一个机器处理这些木棒,机器开启的时候需要耗费一个单位的时间,如果第i+1个木棒的重量和长度都大于等于第i个处理的木棒,那么将不会耗费时间,否则需要消耗一个单位的时间。因为急着去约会,C小加想在最短的时间内把木棒处理完,你能告诉
2015-01-31 15:25:11 504
原创 NYOJ 题目708 ones(dp水)
ones时间限制:1000 ms | 内存限制:65535 KB难度:3描述Given a positive integer N (0<=N<=10000), you are to find an expression equals to N using only 1,+,*,(,). 1 should not appear continuously, i.
2015-01-31 11:03:29 503
原创 POJ 题目1256 Anagram(next_permutation)
AnagramTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 18081 Accepted: 7345DescriptionYou are to write a program that has to generate all possible words
2015-01-31 01:23:22 512
原创 HDOJ 题目4006 The kth great number(优先队列水)
The kth great numberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 7100 Accepted Submission(s): 2904Problem DescriptionXiao Ming
2015-01-31 00:37:36 470
原创 POJ 题目2377 Bad Cowtractors(最大生成树)
Bad CowtractorsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10952 Accepted: 4619DescriptionBessie has been hired to build a cheap internet network am
2015-01-30 22:21:10 400
原创 POJ 题目2253 Frogger(最短路变形)
FroggerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 27255 Accepted: 8858DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Suddenl
2015-01-30 20:10:29 491
原创 POJ 题目1789 Truck History(最小生成树)
Truck HistoryTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 19511 Accepted: 7526DescriptionAdvanced Cargo Movement, Ltd. uses trucks of different types
2015-01-30 16:00:51 385
原创 HDOJ 题目1728 逃离迷宫(BFS)
逃离迷宫Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16771 Accepted Submission(s): 4090Problem Description 给定一个m × n (m行, n列)的迷宫,
2015-01-29 22:38:29 495
原创 HDOJ 题目1253 胜利大逃亡(BFS)
胜利大逃亡Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 27498 Accepted Submission(s): 10481Problem DescriptionIgnatius被魔王抓走了,有一天魔王出差
2015-01-29 15:57:53 584
原创 NYOJ 题目926 概率计算(数学,水题)
概率计算时间限制:1000 ms | 内存限制:65535 KB难度:1描述A和B两个人参加一场答题比赛。比赛的过程大概是A和B两个人轮流答题,A先答。一旦某人没有正确回答问题,则对手立即获胜。所以,两个人比赛的时候在一定程度上靠的是运气,希望自己晚点碰到不会的题目,而对手早点碰到不会的题目。为了简化问题,我们假设A答对问题的概率为a%, B答对问题
2015-01-27 21:52:41 933
原创 POJ 题目1006 Biorhythms(中国剩余定理)
BiorhythmsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 116784 Accepted: 36629DescriptionSome people believe that there are three cycles in a person's
2015-01-27 20:29:17 468
原创 NYOJ题目1129 Salvation(dfs,技巧)
Salvation时间限制:1000 ms | 内存限制:65535 KB难度:3描述 神秘瀑布镇是一个神秘的地方,那里有吸血鬼,狼人,巫师,二重身。 Klaus(吸血鬼祖先) 为了利用 Elena 的血液发展他的混血大军(吸血鬼&狼人),也来到了神秘瀑布镇。Stefan 因为深爱着 Elena ,于是 Stefan 决定去唤醒吸
2015-01-27 01:33:58 705
原创 NYOJ 题目927 The partial sum problem(dfs,剪枝)
The partial sum problem时间限制:1000 ms | 内存限制:65535 KB难度:2描述One day,Tom’s girlfriend give him an array A which contains N integers and asked him:Can you choose some integers from the N
2015-01-26 21:07:51 492
原创 NYOJ题目353 3D dungeon(BFS)
3D dungeon时间限制:1000 ms | 内存限制:65535 KB难度:2描述You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be fil
2015-01-26 00:55:36 583
原创 NYOJ 题目952 最大四边形(几何,技巧)
最大四边形时间限制:1000 ms | 内存限制:65535 KB难度:2描述平面坐标上有n个点,你知道能组成四边形中面积最大的是多少吗?输入有多组测试数据第一行整数n,表示有n个点,( 4然后n行,每行x,y表示点的坐标。(没有重复的点)输出最大四边形的面积.(保留六位小数)样例输入50 00 44 04 42 3
2015-01-25 21:16:20 871
原创 NYOJ 题目743复杂度(数学)
复杂度时间限制:1000 ms | 内存限制:65535 KB难度:3描述for(i=1;i for(j=i+1;j for(k=j+1;k operation;你知道 operation 共执行了多少次吗;输入输入 m 和n 表示m为for循环的层数,n为for中的n。(n,m输
2015-01-25 17:58:35 414
原创 NYOJ 题目328 完全覆盖(数学)
完全覆盖时间限制:2000 ms | 内存限制:65535 KB难度:3描述有一天小董子在玩一种游戏----用2*1或1*2的骨牌把m*n的棋盘完全覆盖。但他感觉游戏过于简单,于是就随机生成了两个方块的位置(可能相同),标记一下,标记后的方块不用覆盖。还要注意小董子只有在m*n的棋盘能被完全覆盖后才会进行标记。现在他想知道:如果标记前m*n的棋盘能被完全覆盖,标
2015-01-25 17:24:08 961
原创 NYOJ 题目412 Same binary weight(bitset)
Same binary weight时间限制:300 ms | 内存限制:65535 KB难度:3描述The binary weight of a positive integer is the number of 1's in its binary representation.for example,the decmial number 1 has
2015-01-25 12:14:42 404
原创 NYOJ 题目991 Registration system(set)
Registration system时间限制:1000 ms | 内存限制:65535 KB难度:2描述A new e-mail service "Berlandesk" is going to be opened in Berland in the near future. The site administration wants to l
2015-01-25 11:24:49 463
原创 POJ 题目1511 Invitation Cards(最短路)
Invitation CardsTime Limit: 8000MS Memory Limit: 262144KTotal Submissions: 20224 Accepted: 6608DescriptionIn the age of television, not many people attend theater
2015-01-22 17:11:42 829
原创 HDOJ 题目1384 Intervals(差分约束)
IntervalsTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3029 Accepted Submission(s): 1117Problem DescriptionYou are given n
2015-01-15 00:03:11 527
原创 HDOJ 题目1531King(差分约束)
KingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1115 Accepted Submission(s): 507Problem DescriptionOnce, in one kingdom,
2015-01-14 14:47:46 495
原创 HDOJ 题目3555 Bomb(数位dp)
BombTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 8666 Accepted Submission(s): 3030Problem DescriptionThe counter-terroris
2015-01-13 12:14:55 399
原创 HDOJ 题目3555 Bomb(数位dp)
BombTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 8666 Accepted Submission(s): 3030Problem DescriptionThe counter-terroris
2015-01-13 12:14:12 540
原创 HDOJ 题目3456 Universal Oracle(模拟,水)
Universal OracleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 586 Accepted Submission(s): 242Problem DescriptionIn computer
2015-01-12 22:42:47 580
原创 HDOJ 题目2662 Coin(数学)
CoinTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 735 Accepted Submission(s): 365Problem DescriptionMoon has many coins, bu
2015-01-12 11:11:15 619
原创 POJ 题目1401 Factorial(数学)
FactorialTime Limit: 1500MS Memory Limit: 65536KTotal Submissions: 14671 Accepted: 9081DescriptionThe most important part of a GSM network is so called Base Trans
2015-01-12 10:22:00 389
原创 POJ 题目1496 Word Index(排列组合)
Word IndexTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4700 Accepted: 2666DescriptionEncoding schemes are often used in situations requiring encrypti
2015-01-11 18:33:14 567
原创 POJ 题目1850 Code(组合数学)
CodeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 8404 Accepted: 3976DescriptionTransmitting and memorizing information is a task that requires differ
2015-01-11 18:20:47 786
原创 POJ 题目1094Sorting It All Out(拓扑排序)
Sorting It All OutTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 28575 Accepted: 9875DescriptionAn ascending sorted sequence of distinct values is one
2015-01-11 16:10:12 445
原创 POJ 题目2752 Seek the Name, Seek the Fame(KMP)
Seek the Name, Seek the FameTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 12752 Accepted: 6280DescriptionThe little cat is so famous, that many couple
2015-01-10 18:49:52 438
原创 NYOJ 题目442字串和之差(动态规划)
字串和之差时间限制:3000 ms | 内存限制:65535 KB难度:4描述给出一个数列{a1,a2,a3,a4……an},选出一个连续非空子序列,使该序列的绝对值max最大,再选出一个非空子序列(与第一个序列的选择无关),使该序列的绝对值min最小。输出max与min的差值。输入第一行是一个整数m(m每组数据第一行是一个整数 n(n输出输
2015-01-10 16:55:22 694
原创 NYOJ 题目138找球号(二)(哈希)
找球号(二)时间限制:1000 ms | 内存限制:65535 KB难度:5描述在某一国度里流行着一种游戏。游戏规则为:现有一堆球中,每个球上都有一个整数编号i(0<=i<=100000000),编号可重复,还有一个空箱子,现在有两种动作:一种是"ADD",表示向空箱子里放m(0<m<=100)个球,另一种是"QUERY”,表示说出M(0<M<=100)个随机整
2015-01-10 15:18:48 577
原创 POJ 题目1274 The Perfect Stall(二分图最大匹配)
The Perfect StallTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 19252 Accepted: 8729DescriptionFarmer John completed his new barn just last week, compl
2015-01-10 15:15:34 450
原创 POJ 题目2975 Nim(nim)
NimTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4892 Accepted: 2269DescriptionNim is a 2-player game featuring several piles of stones. Players alt
2015-01-10 00:52:05 558
原创 POJ 题目1611 The Suspects(简单并查集,带权值)
The SuspectsTime Limit: 1000MS Memory Limit: 20000KTotal Submissions: 23605 Accepted: 11508DescriptionSevere acute respiratory syndrome (SARS), an atypical pneumo
2015-01-09 22:01:00 460
原创 HPUoj题目 1080 做幻方(找规律,格式好坑)
1080: 做幻方时间限制: 1 Sec 内存限制: 128 MB提交: 5 解决: 1[提交][状态][讨论版]题目描述Apple最近迷上了做幻方,Apple还是个中高手,只要你说个奇数N就能把N*N的幻方做出来。其实你可以比他做得更好的。Apple总是画得很乱,而你可以利用程序排得很整齐^_^ 幻方的要求:每一行,每一列,还有两条斜线上数字的和都相等.输
2015-01-09 12:35:23 1006
原创 HPUoj题目1062 能量项链(区间dp)
1062: 【能量项链】时间限制: 1 Sec 内存限制: 128 MB提交: 5 解决: 1[提交][状态][讨论版]题目描述在Mars星球上,每个Mars人都随身佩带着一串能量项链。在项链上有N颗能量珠。能量珠是一颗有头标记与尾标记的珠子,这些标记对应着某个正整数。并且,对于相邻的两颗珠子,前一颗珠子的尾标记一定等于后一颗珠子的头标记。因为只有这样,通过吸盘(吸盘是
2015-01-09 11:58:14 539
原创 HPUoj 题目1019 【C语言训练】尼科彻斯定理(水题,数学)
1019: 【C语言训练】尼科彻斯定理时间限制: 1 Sec 内存限制: 128 MB提交: 9 解决: 5[提交][状态][讨论版]题目描述验证尼科彻斯定理,即:任何一个正整数的立方都可以写成一串连续奇数的和。输入任一正整数输出该数的立方分解为一串连续奇数的和样例输入13样例输出13*13*13=2197=157+1
2015-01-09 11:13:31 3053 1
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人