算法
文章平均质量分 73
epsilon1
这个作者很懒,什么都没留下…
展开
-
模拟退火算法TSP
Simulation Annealing 1982年,KirkPatrick将退火思想引入组合优化领域,提出一种解大规模组合优化问题的算法,对NP完全组合优化问题尤其有效。这源于固体的退火过程,即先将温度加到很高,再缓慢降温(即退火),使达到能量最低点。如果急速降温(即为淬火)则不能达到最低点.。 模拟退火算法是一种能应用到求最小值问题或基本先前的更新的学习过程(随机或决定性的)原创 2015-04-04 15:58:31 · 2737 阅读 · 0 评论 -
UVA - 12166 Equilibrium Mobile
A mobile is a type of kinetic sculpture constructed to take advantage of the principle of equilibrium. It consists of a number of rods, from which weighted objects or further rods hang. The objects ha原创 2015-10-17 00:42:11 · 684 阅读 · 1 评论 -
UVA - 1368 DNA Consensus String
Input Your program is to read from standard input. The input consists of T test cases. The number of test cases T is given in the first line of the input. Each test case starts with a line contain原创 2015-10-16 13:30:50 · 351 阅读 · 0 评论 -
UVA - 439 Knight Moves
DescriptionA 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 of n sq原创 2015-10-16 14:40:45 · 419 阅读 · 0 评论 -
UVA - 1600 Patrol Robot
DescriptionA robot has to patrol around a rectangular area which is in a form of mxn grid (m rows and n columns). The rows are labeled from 1 to m. The columns are labeled from 1 to n. A cel原创 2015-10-16 19:17:44 · 991 阅读 · 0 评论 -
UVA - 1583 Digit Generator
DescriptionFor a positive integer N , the digit-sum ofN is defined as the sum of N itself and its digits. When M is the digitsum ofN , we call N agenerator of M . For example, the digit-原创 2015-10-02 16:33:42 · 484 阅读 · 0 评论 -
UVA - 1584 Circular Sequence
DescriptionSome DNA sequences exist in circular forms as in the following figure, which shows a circular sequence ``CGAGTCAGCT", that is, the last symbol ``T" in ``CGAGTCAGCT" is connected to the原创 2015-10-02 17:07:35 · 542 阅读 · 0 评论 -
蛇形填数
#include #include #include #define MAXN 50int a[MAXN][MAXN];int main(){ int n; int x,y; int total; while(~scanf("%d",&n)) { total = 0; x = 0; y = n-1;原创 2015-10-02 10:46:31 · 569 阅读 · 0 评论 -
韩信点兵--中国剩余定理
传说西汉大将韩信,由于比较年轻,开始他的部下对他不很佩服。有一次阅兵时,韩信要求士兵分三路纵队,结果末尾多2人,改成五路纵队,结果末尾多3人,再改成七路纵队,结果又余下2人,后来下级军官向他报告共有士兵2395人,韩信立即笑笑说不对(因2395除以3余数是1,不是2),由于已经知道士兵总人数在2300?/FONT>2400之间,所以韩信根据23,128,233,------,每相邻两数的间隔是10原创 2015-10-01 13:37:46 · 4325 阅读 · 0 评论 -
WERTYU
Problem DescriptionA common typing error is to place the hands on the keyboard one rowto the right of the correct position. So "Q" is typed as "W" and"J" is typed as "K" and so on. You are to deco原创 2015-10-02 12:09:31 · 528 阅读 · 0 评论 -
UVA - 340 Master-Mind Hints
DescriptionMasterMind is a game for two players. One of them, Designer, selects a secret code. The other,Breaker, tries to break it. A code is no more than a row of colored dots. At the beginnin原创 2015-10-02 15:14:46 · 390 阅读 · 0 评论 -
UVA 401-- Palindromes
Palindromes A regular palindrome is a string of numbers or letters that is the same forward as backward. For example, the string"ABCDEDCBA" is a palindrome because it is the same whe原创 2015-10-02 13:18:04 · 498 阅读 · 0 评论 -
竖式问题
题目:找出所有形如abc*de(三位数乘以两位数)的算式,使得在完整的竖式中,所有数字都属于一个特定的数字集合。输入数字集合(相邻数字之间没有空格),输出所有竖式。每个竖式前应有编号,之后应有一个空行。最后输出解的总数。具体格式见样例输出(为了便于观察,竖式中的空格改用小数点显示,但你的程序应该输出空格,而非小数点)。样例输入:2357样例输出:..775原创 2015-10-02 11:28:32 · 749 阅读 · 0 评论 -
tex quotes
TeX is a typesetting language developed by Donald Knuth. It takes source text together with a few typesetting instructions and produces, one hopes, a beautiful document. Beautiful documents use `` and原创 2015-10-02 11:50:51 · 588 阅读 · 0 评论 -
DP--UVA - 1025 A Spy in the Metro
分析:时间是单向流逝的,是一个天然的“序"。影响到决策的只有当前时间和所处的车站,所以可以用d(i,j)表示时刻i,你在车站j,最少还需要等待多长时间。边界条件是d(T,n)=0,其它d(T,i)为正无穷。有如下3种决策。决策1:等1分钟。决策2:搭乘往右开的车(如果有)。决策3:搭乘往左开的车(如果有)。程序中用到 has_train 数组,其中 has_train[t][i][原创 2015-11-04 13:25:10 · 484 阅读 · 0 评论 -
DP--UVA - 437 The Tower of Babylon
DescriptionPerhaps you have heard of the legend of the Tower of Babylon. Nowadays many details of this tale have been forgotten. So now, in line with the educational nature of this contest, we原创 2015-11-04 13:30:10 · 485 阅读 · 0 评论 -
DP--UVA - 116 Unidirectional TSP
DescriptionBackgroundProblems that require minimum paths through some domain appear in many different areas of computer science. For example, one of the constraints in VLSI routing problem原创 2015-11-04 14:02:47 · 468 阅读 · 0 评论 -
UVA - 227 Puzzle
个人觉得这个题很简单,只是刚开始可能各种格式和字符读取问题有点绕,下面是代码:#include #include #include using namespace std;char matrix[5][5];int main(){ int c; int kase = 0; while((c=getchar())) { if(c=原创 2015-10-02 22:27:40 · 437 阅读 · 0 评论 -
C++:set_union is not a member of std;
这是什么鬼错,写程序都是include一大堆头文件,确实也有include set,但是依然报错,using namespace std;也没用,后来去C++官网逛了下,发现原来set_union和set并没有什么直接的关系,应该说set_union是一种算法,而set是一种数据结构,所以应该include algorithm点击查看C++ reference原创 2015-10-05 13:29:34 · 1088 阅读 · 0 评论 -
UVA - 232 Crossword Answers
点击查看原题此题先读取二维方格,然后遍历数组找到所有起始格存在另一个数组中,最后分别对数组进行行、列遍历,找到每行、列的所有‘单词’,注意对于列扫描的默认顺序不是从小到大的,要另外开一个数组存放起始格标号,然后把‘单词’放在数组中,最后进行排序,输出所有‘单词’。#include #include #include using namespace std;const int m原创 2015-10-03 12:39:41 · 416 阅读 · 0 评论 -
UVA - 1588 Kickdown
题意:给出两个长度分别为n1,n2且每列高度只为1,或者2的长条,需要将它们放入一个高度为3的容器,问容器的最短长度。分别以bottom为标准,平移,得出一个长度sum1再以top为标准,得出一个长度sum2注意题目并没有说底下的比上面的长,所以要分别讨论。#include #include #include #include const int maxn = 110;原创 2015-10-03 15:37:57 · 537 阅读 · 0 评论 -
UVA_400: Unix ls
DescriptionThe computer company you work for is introducing a brand new computer line and is developing a new Unix-like operating system to be introduced along with the new computer. Your assignment原创 2015-10-05 17:34:58 · 750 阅读 · 0 评论 -
信息学奥赛辅导 残缺棋盘——分治算法
/* 残缺棋盘一个有2k×2k个方格的棋盘,其中恰有一个方格残缺。在残缺棋盘问题中,要求用三格板(triominoes)覆盖残缺棋盘。在此覆盖中,两个三格板不能重叠。三格板不能覆盖残缺方格,但必须覆盖其他所有的方格。在这种限制条件下,所需要的三格板总数为(22k-1)/3 ,可以验证(22k-1)/3是一个整数。2k×2k棋盘一个很自然的划分方法就是将它划分为4个2k-1×2k-1棋原创 2015-10-19 23:38:26 · 1585 阅读 · 0 评论 -
UVA - 489 Hangman Judge
DescriptionIn ``Hangman Judge,'' you are to write a program that judges a series of Hangman games. For each game, the answer to the puzzle is given as well as the guesses. Rules are the same as th原创 2015-10-03 21:21:22 · 420 阅读 · 0 评论 -
UVA_12096: The SetStack Computer
点击查看原题分析:本题的集合并不是数字或字母,而是集合的集合。我们不妨给每个集合分配唯一的ID,则每个集合都可以表示成所包含元素的ID集合,这就可以用set来表示了,而整个栈则是stack,注意这里所谓的ID并不是真实的数字,而是集合数组的标号。#include #include #include #include #include #include #include原创 2015-10-05 13:40:04 · 508 阅读 · 0 评论 -
UVA - 10340 All in All
You have devised a new encryption technique which encodes a message by inserting between its charac-ters randomly generated strings in a clever way. Because of pending patent issues we will not dis原创 2015-10-03 12:51:39 · 464 阅读 · 0 评论 -
UVA_12108: Extraordinarily Tired Students
InputThe input consists of several test cases. The first line of each case contains a single integer n(1<=n<=10), the number of students. This is followed by n lines, each describing a student. Each原创 2015-10-04 19:54:09 · 562 阅读 · 0 评论 -
UVA - 101 The Blocks Problem
DescriptionBackground Many areas of Computer Science use simple, abstract domains for both analytical and empirical studies. For example, an early AI study of planning and robotics (STRIPS) used原创 2015-10-05 10:42:26 · 408 阅读 · 0 评论 -
UVA_156: Ananagrams
DescriptionMost crossword puzzle fans are used to anagrams--groupsof words with the same letters in different orders--for exampleOPTS, SPOT, STOP, POTS and POST. Some words however do not have thisa原创 2015-10-05 11:35:22 · 709 阅读 · 0 评论 -
UVA_540: Team Queue
DescriptionQueues and Priority Queues are data structures which are known to most computer scientists. TheTeam Queue, however, is not so well known, though it occurs often in everyday life. At l原创 2015-10-05 15:07:39 · 466 阅读 · 0 评论 -
UVA - 1339 Ancient Cipher
DescriptionAncient Roman empirehad a strong government system with various departments, includinga secret service department. Important documents were sent betweenprovinces and the capital in encryp原创 2015-10-03 20:11:29 · 751 阅读 · 0 评论 -
UVA - 1587 Box
InputInput file contains several test cases. Each of them consists of six lines. Each line describes one palletand contains two integer numbers w and h (1OutputFor each test case, print on原创 2015-10-03 13:28:34 · 514 阅读 · 0 评论 -
UVA_10815: Andy's First Dictionary
InputThe input file is a text with no more than 5000 lines. An input line has at most 200 characters. Input is terminated by EOF.OutputYour output should give a list of different words that原创 2015-10-05 11:04:05 · 412 阅读 · 0 评论 -
UVA_213: Message Decoding
DescriptionSome message encoding schemes require that an encoded message be sent in two parts. The first part, called the header, contains the characters of the message. The second part contains a p原创 2015-10-04 12:23:43 · 466 阅读 · 0 评论 -
UVA - 136 Ugly Numbers
DescriptionUgly numbers are numbers whose only prime factors are 2, 3 or 5. The sequence 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, ... shows the first 11 ugly numbers. By convention, 1 is included.原创 2015-10-05 15:46:22 · 1031 阅读 · 0 评论 -
UVA - 133 The Dole Queue
DescriptionIn a serious attempt to downsize (reduce) the dole queue, The New National Green Labour Rhinoceros Party has decided on the following strategy. Every day all dole applicants will be pla原创 2015-10-04 09:29:56 · 452 阅读 · 0 评论 -
UVA_815: Flooded!
DescriptionTo enable homebuyers to estimate the cost of flood insurance, a real-estate firmprovides clients with the elevation ofeach 10-meter by 10-meter square of land in regions where homes may b原创 2015-10-04 16:34:04 · 636 阅读 · 0 评论 -
UVA - 253 Cube painting
DescriptionWe have a machine for painting cubes. It is supplied with three different colors: blue, red and green. Each face of the cube gets one of these colors. The cube's faces are numbered as i原创 2015-10-04 21:09:03 · 451 阅读 · 0 评论 -
UVA_1592: Database
DescriptionPeter studies the theory of relational databases. Table in the relational database consists of values that are arranged in rows and columns. There are differentnormal forms that databas原创 2015-10-05 21:21:34 · 594 阅读 · 0 评论 -
UVA_1593: Alignment of Code
DescriptionYou are working in a team that writes Incredibly Customizable Programming Codewriter (ICPC) which is basically a text editor with bells and whistles. You are working on a module that take原创 2015-10-05 22:24:48 · 634 阅读 · 0 评论