- 博客(83)
- 资源 (1)
- 收藏
- 关注
RSS订阅转载 【POJ1061】青蛙的约会
青蛙的约会Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 106013 Accepted: 20943Description两只青蛙在网上相识了，它们聊得很开心，于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上，于是它们约定各自朝西跳，直到碰
2016-07-31 20:50:05
324
原创 【POJ1328】Radar Installation
Radar InstallationTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%lld & %lluSubmit Status Practice POJ 1328DescriptionAssume the coasting is an infinite straigh
2016-07-31 19:46:57
161
原创 light oj1078
If an integer is not divisible by 2 or 5, some multiple of that number in decimal notation is a sequence of only a digit. Now you are given the number and the only allowable digit, you should report t
2016-07-30 20:55:36
224
原创 light oj贪心
DescriptionYour karate club challenged another karate club in your town. Each club enters N players into the match, and each player plays one game against a player from the other team. Each game t
2016-07-30 20:15:45
191
转载 【POJ3984】迷宫问题
迷宫问题Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit Status Practice POJ 3984Description定义一个二维数组： int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1,
2016-07-29 21:07:50
216
转载 poj题目分类
转载：http://www.cnblogs.com/kuangbin/archive/2011/07/29/2120667.html初期:一.基本算法: (1)枚举. (poj1753,poj2965) (2)贪心(poj1328,poj2109,poj2586) (3)递归和分治法. (4)递推. (5)构造法.(poj32
2016-07-29 18:18:38
193
原创 【杭电1242】广搜+队列
RescueTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionAngel was caught by the MOLIGPY! He was put in prison by Moligpy. The pr
2016-07-29 16:29:31
233
原创 【杭电1241】Oil Deposits（DFS）
Oil DepositsTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionThe GeoSurvComp geologic survey company is responsible for detecting
2016-07-29 11:09:11
340
原创 【杭电1181】变形课
变形课Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription呃......变形课上Harry碰到了一点小麻烦,因为他并不像Hermione那样能够记住所有的咒语而随意的将一个棒球变成刺猬什么的,但是他发现了变形
2016-07-28 21:13:32
287
原创 【杭电2553】N皇后
N皇后问题Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription在N*N的方格棋盘放置了N个皇后，使得它们不相互攻击（即任意2个皇后不允许处在同一排，同一列，也不允许处在与棋盘边框成45角的斜线上。 你的任
2016-07-28 20:27:26
991
原创 【POJ 3620】Avoid The Lakes
Avoid The LakesTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionFarmer John's farm was flooded in the most recent storm, a fact
2016-07-28 19:06:46
353
原创 【POJ1321】棋盘问题
棋盘问题Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%lld & %lluSubmit StatusDescription在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对于给定形状和
2016-07-28 17:09:07
308
原创 【南阳acm】最少步数
最少步数时间限制：3000 ms | 内存限制：65535 KB难度：4描述这有一个迷宫，有0~8行和0~8列： 1,1,1,1,1,1,1,1,1 1,0,0,1,0,0,1,0,1 1,0,0,1,1,0,0,0,1 1,0,1,0,1,1,0,1,1 1,0,0,0,0,1,0,0,1 1,1,0,1,0,1,0
2016-07-28 15:50:42
597
原创 【POJ1979】
Red and BlackTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionThere is a rectangular room, covered with square tiles. Each tile i
2016-07-28 11:37:32
241
原创 【杭电4907】Task schedule
Task scheduleTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription有一台机器，并且给你这台机器的工作表，工作表上有n个任务，机器在ti时间执行第i个任务，1秒即可完成1个任务。 有m个询问，每
2016-07-27 20:54:27
244
原创 Red packet~二分
Red packetTime Limit:1000MS Memory Limit:65535KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionNew Year is coming! Our big boss Wine93 will distribute some “Red Pa
2016-07-27 17:57:55
313
原创 Pie（二分）
PieTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionMy birthday is coming up and traditionally I'm serving pie. Not just one pi
2016-07-27 16:10:30
241
原创 【POJ1905】
Expanding RodsTime Limit:500MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionWhen a thin rod of length L is heated n degrees, it expands to a new le
2016-07-27 11:21:11
215
原创 未整理
/*#include//二进制数中1的个数 main(){ int N,M,t,s;scanf("%d",&M);while(M--){scanf("%d",&N);s=0;while(N!=0){t=N%2;N=N/2;if(t==1)s++;}printf("%d\n",s);}return 0;}*//*#inc
2016-07-27 09:33:42
185
原创 Crossed Ladders
Crossed LaddersTime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionA narrow street is lined with tall buildings. An x foot long ladder i
2016-07-27 09:24:20
338
原创 【杭电2141】Can you find it?
Can you find it?Time Limit:3000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionGive you three sequences of numbers A, B, C, then we give you
2016-07-26 21:04:56
195
原创 【POJ】River Hopscotch
River HopscotchTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionEvery year the cows hold an event featuring a peculiar version
2016-07-26 18:02:20
369
原创 【杭电4004】The Frog's Games Time 青蛙过河
The Frog's GamesTime Limit:1000MS Memory Limit:65768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionThe annual Games in frogs' kingdom started again. The most fam
2016-07-26 16:05:40
422
原创 【杭电1551】Cable master
Cable masterTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionInhabitants of the Wonderland have decided to hold a regional prog
2016-07-26 12:04:54
273
原创 【杭电2199】找方程的解 （二分法）
Can you solve this equation?Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription现在，给出等式8* X^4+ 7* X^3+ 2* X^2+ 3 * X +6= Y，请找出他在0和
2016-07-26 10:29:25
252
原创 括号配对 栈
题意：, {}, [], ()都是RBS，RBS, {RBS}RBS, [RBS]RBS, (RBS)RBS也是RBS，意思就是如果, {}, [], ()里包含有字符串那么被包含的字符串也得失RBS。现在有一段字符串，称'思路：用栈模拟，遍历字符串数组，只能放进开类型，当遇到闭类型时，如果栈顶的字符是和它匹配的就不用转换，否则需要转换；当遇到闭类型时，如果栈为空的话，这个时候就是“Impos
2016-07-25 21:35:18
471
原创 【POJ1363】栈
B - IITime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionThere is a famous railway station in PopPush City. Country there is incred
2016-07-25 19:58:21
294
原创 【杭电1702】基础 队列和栈
A - ITime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionACboy was kidnapped!! he miss his mother very much and is very scare no
2016-07-25 17:24:27
445
原创 队列和栈
使用标准库的栈和队列时，先包含相关的头文件#include#include定义栈如下：stack stk;定义队列如下：queue q;栈提供了如下的操作[cpp] view plain copys.empty() 如果栈为空返回true，否则返回false s
2016-07-25 15:45:02
227
原创 优先队列
在优先队列中，优先级高的元素先出队列。标准库默认使用元素类型的操作符来确定它们之间的优先级关系。优先队列的第一种用法，也是最常用的用法：priority_queueint> qi;通过操作符可知在整数中元素大的优先级高。故示例1中输出结果为：9 6 5 3 2第二种方法：在示例1中，如果我们要把元素从小到大输出怎么办呢？这时我们可以传入一个比较函数，使用func
2016-07-25 08:51:46
153
原创 转换成二进制数
#include//转换为二进制 void b(int n);main(){int n;scanf("%d",&n);b(n);printf("\n");return 0;}void b(int n){if(n>=1)b(n/2);printf("%d",n%2);}
2016-07-24 21:45:19
737
原创 【杭电2098】分拆素数和
分拆素数和Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 2098Description把一个偶数拆成两个不同素数的和，有几种拆法呢？ Input输入包含一些正的
2016-07-24 20:37:55
244
原创 【杭电2012】素数判定
素数判定Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 2012Description对于表达式n^2+n+41，当n在（x,y）范围内取整数值时（包括x,y）(-39Input
2016-07-24 20:35:22
336
原创 【杭电1108】最小公倍数
最小公倍数Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1108Description给定两个正整数，计算这两个数的最小公倍数。 Input输入包含多组测试数据
2016-07-24 20:33:27
257
原创 【杭电1722】Cake
CakeTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1722Description一次生日Party可能有p人或者q人参加,现准备有一个大蛋糕.问最少要将蛋糕切成多少块(每块大小不一定相等)
2016-07-24 20:24:56
296
原创 【杭电1222】互质
Wolf and RabbitTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1222DescriptionThere is a hill with n holes around. The ho
2016-07-24 20:21:59
221
原创 【杭电4548】美素数
美素数Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 4548Description 小明对数的研究比较热爱，一谈到数，脑子里就涌现出好多数的问题，今天，小明想考考你对素数的认识。 问
2016-07-24 19:46:53
349
原创 【杭电1212】大数除法
Big NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7331 Accepted Submission(s): 5062Problem DescriptionAs we know, Big Num
2016-07-24 19:35:41
291
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人