UVA
文章平均质量分 82
Rocky0429
我愿能朝着太阳生长,做一个温暖的人。
展开
-
UVALive 7147- World Cup
题目地址:UVALive 7147 题意:一场比赛,赢的队得A分,输的得C分,平手都得B分。有n支队伍,分别比赛一次,选前m个队伍晋级(分数相同的随机排名)。问:可能的最大淘汰分数,可能的最小晋级分数。#include <cstdio>#include <cstring>#include <cmath>#include <map>#include <set>#include <vecto原创 2015-10-05 18:24:25 · 1584 阅读 · 0 评论 -
UVA 784-Maze Exploration(dfs)
Maze Exploration A maze of rectangular rooms is represented on a two dimensional grid as illustrated in figure 1a. Each point of the grid is represented by a character. The points of room walls are原创 2015-02-14 00:11:07 · 1312 阅读 · 0 评论 -
UVA 657-The die is cast(dfs*2)
The die is castTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionInterGames is a high-tech startup company that specializes in develop原创 2015-02-13 20:23:03 · 1290 阅读 · 0 评论 -
UVA 156-Ananagrams(字符串排序按序输出无重复单词)
AnanagramsTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescription Ananagrams Most crossword puzzle fans are used to原创 2015-01-03 15:46:08 · 2132 阅读 · 2 评论 -
UVA 340-Master-Mind Hints(STL-map)
Master-Mind HintsTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionMasterMind is a game for two players. One of them, Designer, selects原创 2015-01-03 12:16:30 · 1280 阅读 · 0 评论 -
UVA 113-Power of Cryptography(二分+double处理大数据)
Power of CryptographyTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescription Power of Cryptography BackgroundCu原创 2015-01-03 23:40:54 · 1518 阅读 · 0 评论 -
UVA 299- Train Swapping(冒泡排序中交换次数)
Train SwappingTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescription Train Swapping At an old railway station, you原创 2015-01-02 22:50:43 · 1348 阅读 · 0 评论 -
UVA 10010- Where's Waldorf?(八方向寻找字符串)
Where's Waldorf?Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescription Where's Waldorf? Given a m by n grid of lett原创 2015-01-02 16:40:17 · 1517 阅读 · 0 评论 -
UVA 152-Tree's a Crowd(暴力求解三维坐标求最短距离)
Tree's a CrowdTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescription Tree's a Crowd Dr William Larch, noted plant ps原创 2015-01-02 18:26:05 · 1213 阅读 · 0 评论 -
UVA 10420-List of Conquests(STL-map的应用)
List of ConquestsTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionProblem BList of ConquestsInput: standard inputOutput: standard o原创 2015-01-02 17:32:19 · 1258 阅读 · 0 评论 -
UVA 439-Knight Moves(bfs)
Knight MovesTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionA friend of you is doing research on the Traveling Knight Problem (TKP)原创 2015-02-15 00:55:01 · 1376 阅读 · 0 评论 -
UVA 532- Dungeon Master(三维bfs)
Dungeon MasterTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionYou are trapped in a 3D dungeon and need to find the quickest way ou原创 2015-02-14 22:41:23 · 1219 阅读 · 0 评论 -
UVA 12493-Stars(欧拉函数)
题目地址:UVA 12493 题意:圆上有N个点把圆分成N等分,求隔相同的点能一笔画完所有点的方法 思路:要一笔画出,那么(N,K)必定没有在中间相交,而只能在起始位置(把K当作是K等分),所以K就是与N互质的个数,又因为K=1和K=N-1,结果是一样的,所以最后的结果除以2。#include <stdio.h>#include <math.h>#include <string.h>#in原创 2015-09-06 19:39:59 · 1187 阅读 · 0 评论 -
UVA 10100- Longest Match(dp之最长公共子序列)
题目地址:UVA 10100 题意:求两组字符串中最大的按顺序出现的相同单词数目。 思路:将字串中的连续的字母认作一个单词,依次计算出两个字符串中的单词,其中第1个字符串的单词序列为t1.word[1]…..t1.word[n],第2个字符串的单词序列为t2.word[1]…..t2.word[m]。然后将每个单词当成一个字符,使用LCS算法计算出两个字符串的最长公共子序列,该序列的长度就是最长原创 2015-08-18 19:59:48 · 1690 阅读 · 0 评论 -
UVA 147- Dollars(dp之子集和问题)
题目地址:UVA 147 题意:给定11种面值分别为100元, 50元, 20元, 10元, and 5元 and 2元, 1元, 50分, 20分, 10分 and 5分的钱,现在给定一个钱数,求出可以组成的种类数。 思路:子集和问题:S={ x1 , x2 ,…, xn }是一个正整数的集合,c是一个正整数。子集和问题判定是否存在S的一个子集S1,使得s1中的各元素之和等于c。 最突出的事原创 2015-08-17 21:11:18 · 1883 阅读 · 0 评论 -
UVA 11796- Dog Distance(计算几何_求最大距离和最小距离之差)
题意:甲乙两条狗分别沿着一条折线奔跑,两只狗的速度未知,但已知他们同时出发,同时到达,并且都是匀速奔跑,试求甲和乙在奔跑过程中最远距离和最近距离之差。思路:因为运动是相对的,因此也可以认为甲静止不动,乙自己沿着直线走,因此问题转化为求点到线段的最小或最大距离。然后模拟求解。大白P262#include #include #include #include #include原创 2015-05-17 11:54:42 · 1933 阅读 · 0 评论 -
UVA 11178-Morley's Theorem(计算几何_莫雷定理)
Problem DMorley’s TheoremInput: Standard InputOutput: Standard Output Morley’s theorem states that that the lines trisecting the angles of an arbitrary plane triangle meet at the vertices of a原创 2015-05-16 16:58:07 · 1873 阅读 · 0 评论 -
UVA 539-The Settlers of Catan(dfs)
The Settlers of CatanTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionWithin Settlers of Catan, the 1995 German原创 2015-03-14 16:44:45 · 1207 阅读 · 0 评论 -
UVA 10815-Andy's First Dictionary(字符串模拟+排序+重复删除||STL-set)
Andy's First DictionaryTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionProblem B: Andy's First DictionaryTime li原创 2014-12-27 11:47:33 · 1677 阅读 · 0 评论 -
UVA 572- Oil Deposits(简单dfs)
Oil DepositsTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionThe GeoSurvComp geologic survey company is responsible for detecting u原创 2015-02-13 17:37:11 · 1579 阅读 · 0 评论 -
UVA 10305- Ordering Tasks(经典拓扑排序)
Problem FOrdering TasksInput: standard inputOutput: standard outputTime Limit: 1 secondMemory Limit: 32 MB John has n tasks to do. Unfortunately, the tasks are not independent and the ex原创 2015-02-15 01:20:45 · 1639 阅读 · 0 评论 -
UVA 537-Artificial Intelligence?(模拟)
Artificial Intelligence?Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescription Artificial Intelligence? Physics tea原创 2015-01-01 21:33:29 · 1220 阅读 · 0 评论 -
UVA 10714-Ants(求花费的最大最小时间)
AntsTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionProblem B: AntsAn army of ants walk on a horizontal pole of length l cm, eac原创 2015-02-07 16:33:03 · 1321 阅读 · 0 评论 -
UVA 10341- Solve It(二分+精度求解方程值)
Problem FSolve ItInput: standard inputOutput: standard outputTime Limit: 1 secondMemory Limit: 32 MBSolve the equation: p*e-x+ q*sin(x) + r*cos(x) + s*tan(x) + t*x2 + u = 0原创 2015-02-05 14:11:23 · 1380 阅读 · 0 评论 -
UVA 10905- Children's Game(sort处理string字符串)
Children's GameTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescription4thIIUCInter-University Programming Contest, 2005原创 2015-02-04 14:39:18 · 1330 阅读 · 0 评论 -
UVA 10878-Decode the tape(模拟)
Decode the tapeTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescription "Machines take me by surprise with great frequency."Al原创 2014-12-26 00:45:11 · 1440 阅读 · 0 评论 -
UVA 10494-If We Were a Child Again(大数除法及取余)
If We Were a Child AgainTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionProblem CIf We Were a Child AgainInput: standard inputOutp原创 2014-12-10 23:33:23 · 1479 阅读 · 0 评论 -
UVA 465- Overflow(借助atof函数将字符串改为double型)
OverflowTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescription Overflow Write a program that reads an expression c原创 2014-12-09 23:52:00 · 1318 阅读 · 0 评论 -
UVA 10361-Automatic Poetry(模拟)
Automatic PoetryTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionProblem IAutomatic PoetryInput: standard inputOutput: standard out原创 2014-12-09 23:46:16 · 1191 阅读 · 0 评论 -
UVA 10106-Product(大数乘法)
ProductTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescription Product The ProblemThe problem is to multiply two原创 2014-12-08 00:05:31 · 1235 阅读 · 0 评论 -
UVA 424-Integer Inquiry(大数加法)
Integer InquiryTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescription Integer Inquiry One of the first users of BI原创 2014-12-07 22:53:34 · 1412 阅读 · 0 评论 -
UVA 401-Palindromes(模拟)
PalindromesTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionA regular palindrome is a string of numbers or letters that is the same for原创 2014-12-07 22:43:23 · 1248 阅读 · 0 评论 -
UVA 10534-Wavio Sequence(dp_正序逆序最长上升子序列)
Wavio SequenceTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionProblem DWavio Sequence Input: Standard InputOutput: Standard Output原创 2015-01-29 19:20:16 · 1423 阅读 · 0 评论 -
UVA 644- Immediate Decodability (寻找是否有相同前缀)
Immediate Decodability An encoding of a set of symbols is said to be immediately decodable if no code for one symbol is the prefix of a code for another symbol. We will assume for this原创 2014-12-27 14:14:20 · 1160 阅读 · 0 评论 -
UVA 10026-Shoemaker’s problem(贪心)
Shoemaker's ProblemShoemaker has N jobs (orders from customers) which he must make. Shoemaker can work on only one job in each day. For each ithjob, it is known the integer Ti (1i<=1000), th原创 2015-02-05 10:57:31 · 1837 阅读 · 0 评论 -
UVA 10487-Closest Sums(遍历水题)
Closest SumsInput: standard inputOutput: standard outputTime Limit: 3 seconds Given is a set of integers and then a sequence of queries. A query gives you a number and asks to find a sum of原创 2015-02-06 13:14:30 · 1243 阅读 · 0 评论 -
UVA 10700-Camel trading(栈求表达式的最大最小值)
Camel tradingTime Limit: 1 secondBackgroundAroud 800 A.D., El Mamum, Calif of Baghdad was presented the formula 1+2*3*4+5, which had its origin in the financial accounts of a c原创 2015-02-05 20:53:30 · 1282 阅读 · 0 评论 -
UVA 270-Lining Up(多点共线)
Lining UpTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescription Lining Up ``How am I ever going to solve this prob原创 2015-02-06 11:07:15 · 1449 阅读 · 0 评论 -
UVA 10132-File Fragmentation(map还原字符串)
File FragmentationThe ProblemYour friend, a biochemistry major, tripped while carrying a tray of computer files through the lab. All of the files fell to the ground and broke. Your friend pick原创 2015-02-06 10:25:23 · 1262 阅读 · 0 评论 -
UVA 10763-Foreign Exchange(求入度出度是否相等)
Foreign ExchangeTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionProblem EForeign ExchangeInput: standard inputOutput: standard out原创 2015-02-04 20:33:41 · 1289 阅读 · 0 评论