算法入门经典
文章平均质量分 77
github.com/4gnosed
这个作者很懒,什么都没留下…
展开
-
《算法竞赛入门经典》之开发环境与方法小收获
1.windows下的命令 6.15 cmd 打开命令窗口dir 文件列表cd\md\rd 改变\创建\删除目录cd\ 返回根目录more\type 显示文件内容fc 比较两个文件内容del 删除文件copy\xcopy 文件名+目标目录 复制文件ren 原名+改名 文件改名fin原创 2017-09-06 14:47:22 · 252 阅读 · 0 评论 -
UVA 136 Ugly Number(优先队列)
题目 Ugly numbers are numbers whose only prime factors are 2, 3 or 5. The sequence1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, ...shows the first 11 ugly numbers. By convention, 1 is included.原创 2017-09-29 23:26:58 · 300 阅读 · 0 评论 -
UVA 400 Unix Is
The 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 is to write原创 2017-09-30 21:26:44 · 384 阅读 · 0 评论 -
UVA 221 Urban Elevations (离散化)
An elevation of a collection of buildings is an orthogonal projection of the buildings onto a vertical plane. An external elevation of a city would show the skyline and the faces of the ``visible" bui原创 2017-10-03 12:15:06 · 346 阅读 · 0 评论 -
UVA 1594 Ducci Sequence
思路:开个新的数组来保存Ducci 序列,每次abs后,作判断。只有两种LOOP或ZERO结果,只需判断一项。#include #include #include using namespace std;bool zeo_jud(int *a,int len){ for(int i=0;i<len;i++) { if(a[i]!=0)原创 2017-10-03 17:29:28 · 208 阅读 · 0 评论 -
UVA 1593 Alignment of Code
You 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 takes a piece of原创 2017-10-03 13:40:35 · 246 阅读 · 0 评论 -
UVA 210 Concurrency Simulator(deque,queue,模拟)
Programs executed concurrently on a uniprocessor system appear to be executed at the same time, butin reality the single CPU alternates between the programs, executing some number of instructions fr原创 2017-10-15 18:17:17 · 238 阅读 · 0 评论 -
UVA 10935 Throwing cards away I (queue)
Given is an ordered deck of n cards numbered 1 to n with card 1 at the top and card n at the bottom. The following operation is performed as long as there are at least two cards in the deck: Throw原创 2017-10-05 19:30:23 · 269 阅读 · 0 评论 -
UVA 10763 Foreign Exchange
思路:每一个想从A学校换到B学校的学生必须找到一个唯一的从B学校换到A学校的学生。可以定义一个arr[ ]数组作为AB的关系,并对每一对关系进行swap(arr[a],arr[b]),如果交换成功,最后的对于每一个 i,必有arr[ i ]= i。#include #include #include using namespace std;const int maxn=5000原创 2017-10-05 21:38:50 · 244 阅读 · 0 评论 -
UVA 230 Borrowers(多种STL运用)
详细题目:https://vjudge.net/problem/UVA-230思路:根据题意先对各本书进行排序(按ASCII码先作者后书名),建立一个结构体 book 对每本书的作者和状态(入藏,借出,归还但未上架)进行储存,并通过建立 map 的键值关系。对于每次 SHELVE 操作,找到第三种状态的书,确定其插入的位置(先前排序的作用于此)。代码:#include #incl原创 2017-10-08 16:55:45 · 284 阅读 · 0 评论 -
UVA 1595 Symmetry(暴力)
The figure shown on the left is left-right symmetric as it is possible to fold the sheet of paper along a vertical line, drawn as a dashed line, and to cut the figure into two identical halves. The fi原创 2017-10-06 16:33:07 · 264 阅读 · 0 评论 -
UVA 156 Ananagrams (map应用)
Most crossword puzzle fans are used to anagrams--groups of words with the same letters in different orders--for example OPTS, SPOT, STOP, POTS and POST. Some words however do not have this attribute,原创 2017-09-24 11:58:26 · 242 阅读 · 0 评论 -
UVA 10815 Andy's First Dictionary(set的应用)
Andy, 8, has a dream - he wants to produce his very own dictionary. This is not an easy task for him, as the number of words that he knows is, well, not quite enough. Instead of thinking up all the wo原创 2017-09-21 23:15:59 · 230 阅读 · 0 评论 -
UVA 12096 The SetStack Computer(stack及其它STL容器综合使用)
Background from Wikipedia: “Set theory is a branch of mathematics created principally by the German mathe-matician Georg Cantor at the end of the 19th century.Initially controversial, set theory has c原创 2017-09-25 20:54:38 · 310 阅读 · 0 评论 -
UVA 1592 Database(map)
Peter studies the theory of relational databases. Table in the relational database consists of values that are arranged in rows and columns.There are different normal forms that database may adher原创 2017-09-18 23:46:11 · 501 阅读 · 0 评论 -
UVA 10391 Compound Words
You are to find all the two-word compound words in a dictionary. A two-word compound word is a word in the dictionary that is theconcatenation of exactly two other words in the dictionary.Input原创 2017-10-06 16:08:33 · 251 阅读 · 0 评论 -
习题2-6_排列(permutation)
排列(permutation)用1,2,3,…,9组成3个三位数 abc, def, 和ghi,每个数字恰好使用一次,要求 abc:def:ghi = 1:2:3。输出所有解。提示:不必太动脑筋。思路:设i从123到329,j=2*i,k=3*i。分解i,j,k的各个位数,用一个长度为9、下标从1到9的数组储存各个位数出现的次数,如果全部为1,则输出i,j,k;如其中有一个数组元素不为1,则全原创 2017-09-06 14:47:30 · 289 阅读 · 0 评论 -
UVA 540 Team Queue(queue的使用)
Queues and Priority Queues are data structures which are known to most computer scientists. The Team Queue, however, is not so well known, though it occurs often in everyday life. At lunch time the qu原创 2017-09-27 23:46:14 · 301 阅读 · 0 评论 -
UVA 12100 Printer Queue(队列,优先队列)
详细题目:https://vjudge.net/problem/UVA-12100思路:用队列模拟,开一个 的队列,分别表示任务的优先级和位置。再开一个 的优先队列,默认任务的优先级为从大到小的优先顺序。每次取出队列首任务,若其优先级不是最高的(根据优先队列判断),将其入队;否则,ans++,再判断其位置是否为所求任务完成的时刻,若是则输出ans结束。#inclu原创 2017-10-06 22:33:23 · 320 阅读 · 0 评论 -
UVA 12504 Updatig a Dictionary(map)
In this problem, a dictionary is collection of key-value pairs, where keys are lower-case letters, and values are non-negative integers. Given an old dictionary and a new dictionary, find out what wer原创 2017-10-11 22:36:10 · 248 阅读 · 0 评论