- 博客(9)
- 资源 (2)
- 收藏
- 关注
原创 hdu--1873畅通工程续
畅通工程续Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 27556 Accepted Submission(s): 9951Problem Description某省自从实行了很多年的畅通工程计划后,
2014-08-01 09:32:28 313
原创 poj--3009
Curling 2.0Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11324 Accepted: 4783DescriptionOn Planet MM-21, after their Olympic games this year, curling
2014-07-29 10:08:59 298
原创 海之树
DescriptionBeing a programmer, you like arrays a lot. For your birthday, your friends have given you an array a consisting of ndistinct integers.Unfortunately, the size of a is too small. You wa
2014-07-28 15:40:04 466
原创 UVa 10608 - Friends
FRIENDS There is a town with N citizens. It is known that some pairs of people are friends. According to the famous saying that The friends of my friends are my friends, too it follows that if
2014-07-28 15:36:55 350
原创 poj-- 2243 Knight Moves
Knight MovesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11410 Accepted: 6423DescriptionA friend of you is doing research on the Traveling Knight Pro
2014-07-25 10:08:08 255
原创 POJ--3620 Avoid The Lakes
Avoid The LakesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6261 Accepted: 3388DescriptionFarmer John's farm was flooded in the most recent storm, a
2014-07-24 17:15:10 257
原创 POJ--1163 The Triangle
The TriangleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 37088 Accepted: 22209Description73 88 1 02 7 4 44 5 2 6 5(Figure
2014-07-24 15:54:00 233
原创 POJ 2342
#include #include #include #include #include #include #include #include #include #include #include #define MAX 100010 using namespace std; struct
2014-07-23 22:14:21 468
原创 POJ 3984
Description定义一个二维数组: int maze[5][5] = {0, 1, 0, 0, 0,0, 1, 0, 1, 0,0, 0, 0, 0, 0,0, 1, 1, 1, 0,0, 0, 0, 1, 0,};它表示一个迷宫,其中的1表示墙壁,0表示可以走的路,只能横着走或竖着走,不能斜着走,要求编程序找出从左上角到 右下角的最短路线。I
2014-07-19 17:31:49 406
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人