深搜广搜
文章平均质量分 87
Zeny_L
:-
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
UVA 784 (13.08.09)
Maze Exploration A maze of rectangular rooms is represented on a twodimensional grid as illustrated in figure 1a. Each point of thegrid is represented by a character. The points of room wa原创 2013-07-12 16:20:11 · 809 阅读 · 0 评论 -
UVA 11218 (KTV唱歌 回溯法 13.11.09)
Problem K KTV One song is extremely popular recently, so you and your friends decided to sing it in KTV. The song has 3 characters, so exactly 3 people should sing together each time (yes, there a原创 2013-11-09 19:54:53 · 1195 阅读 · 0 评论 -
UVA 10624 (13.11.27)
Problem B Super Number Input: Standard Input Output: Standard Output Time Limit: 3 Seconds Don't you think 162456723 very special? Look at the picturebelow if you are unable to find its specia原创 2013-11-27 16:46:40 · 755 阅读 · 0 评论 -
UVA 639 (13.08.25)
Don't Get Rooked In chess, the rook is a piece that can move any number of squaresvertically or horizontally. In this problem we will consider smallchess boards (at most 44) that can als原创 2013-08-25 17:42:08 · 770 阅读 · 0 评论 -
UVA 539 (13.07.08)
题意: 给出n, m,代表n个结点, m条边 n个结点编号从0到n-1 m个条边, 利用一个load数组储存是否存在, 下标为该边的两个结点编号, 存在则为1, 不存在则为0; 要求:找出不重复边的遍历结点数最大是多少~ 代码如下: #include #include #include int max; int load[50][50]; void sear原创 2013-07-08 19:16:39 · 653 阅读 · 0 评论 -
UVAlive 3635 (13.08.23)
Problem C - Pie Time limit: 1 second My birthday is coming up and traditionally I'm serving pie. Not justone pie, no, I have a number N of them, of various tastes andof various sizes. F of my frien原创 2013-08-23 21:27:24 · 1213 阅读 · 0 评论 -
UVA 839 (13.08.20)
Not so Mobile Before being an ubiquous communications gadget, a mobile wasjust a structure made of strings and wires suspending colourfullthings. This kind of mobile is usually found hangi原创 2013-08-20 18:08:17 · 799 阅读 · 0 评论 -
UVA 112 (13.08.19)
Tree Summing Background LISP was one of the earliest high-level programming languages and, withFORTRAN, is one of the oldest languages currently being used. Lists,which are the fundamen原创 2013-08-19 20:49:21 · 738 阅读 · 0 评论 -
UVA 167 (13.07.26)
The Sultan's Successors The Sultan of Nubia has no children, so she has decided that thecountry will be split into up to k separate parts on her death andeach part will be inherited by wh原创 2013-07-26 12:14:27 · 763 阅读 · 0 评论 -
UVA 10603 (13.07.24)
Problem D Fill There are three jugs with a volume of a, b and c liters. (a,b, and c are positive integers not greater than 200). The first and the secondjug are initially empty, while the third原创 2013-07-25 11:03:30 · 683 阅读 · 0 评论 -
UVA 165 (13.07.29)
Stamps The government of Nova Mareterrania requires that various legaldocuments have stamps attached to them so that the government canderive revenue from them. In terms of recent legislat原创 2013-07-31 12:02:59 · 739 阅读 · 0 评论 -
UVA 10004 (13.07.09)
Bicoloring In 1976 the ``Four Color Map Theorem" was proven with the assistance of acomputer. This theorem states that every map can be colored using only fourcolors, in such a way that no原创 2013-07-12 16:27:30 · 751 阅读 · 0 评论 -
UVA 216 (13.07.19)
Getting in Line Computer networking requires that the computers in the network be linked. This problem considers a ``linear" network in which the computers are chainedtogether so that e原创 2013-07-20 17:28:57 · 746 阅读 · 0 评论 -
UVA 10344 (13.07.19)
Problem I 23 Out of 5 Input: standard input Output: standardoutput Time Limit: 1 second Memory Limit: 32 MB Your task is to writea program that can decide whether you can find an arithmetic expr原创 2013-07-20 17:32:54 · 731 阅读 · 0 评论 -
UVA 10167 (13.07.17)
Problem G. Birthday Cake Background Lucy and Lily are twins. Today is their birthday. Mother buys a birthday cake for them.Now we put the cake onto a Descartes coordinate. Its center is原创 2013-07-17 18:51:57 · 732 阅读 · 0 评论 -
HDU 3912 (13.07.08)
Turn Right Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 881 Accepted Submission(s): 297 Problem Description This summer, ELT and原创 2013-07-12 16:14:56 · 767 阅读 · 0 评论 -
HDU 1175 (13.07.08)
连连看 Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 13319 Accepted Submission(s): 3477 Problem Description “连连看”相信很多人都玩过。没玩过也没关系,下原创 2013-07-12 16:01:49 · 700 阅读 · 0 评论 -
UVA 439 (骑士移动 第一道DFS 13.07.17)
Knight Moves A friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a given set o原创 2013-07-18 12:29:07 · 939 阅读 · 0 评论
分享