UVA
lyhvoyage
不抛弃,不放弃!
展开
-
UVA 445 - Marvelous Mazes
Marvelous MazesYour mission, if you decide to accept it, is to create a maze drawing program. A maze will consist of the alphabetic characters A-Z, * (asterisk), and spaces.Input and OutputY原创 2013-07-11 12:58:29 · 2581 阅读 · 0 评论 -
UVA 10198 Counting
CountingThe ProblemGustavo knows how to count, but he is now learning how write numbers. As he is a very good student, he already learned 1, 2, 3 and 4. But he didn't realize yet tha原创 2014-07-16 18:29:14 · 1199 阅读 · 0 评论 -
UVA 10139 Factovisors(数论)
FactovisorsThe factorial function, n! is defined thus for n a non-negative integer: 0! = 1 n! = n * (n-1)! (n > 0)We say that a divides b if there exists an integer k such that k*a =原创 2014-07-17 17:45:14 · 1498 阅读 · 0 评论 -
UVA 10168 Summation of Four Primes(数论)
Summation of Four PrimesInput: standard inputOutput: standard outputTime Limit: 4 secondsEuler proved in one of his classic theorems that prime numbers are infinite in number. But can every nu原创 2014-07-17 18:10:49 · 1526 阅读 · 0 评论 -
UVA 10042 Smith Numbers(数论)
Smith NumbersBackgroundWhile skimming his phone directory in 1982, Albert Wilansky, a mathematician of Lehigh University , noticed that the telephone number of his brother-in-law H. Smith had原创 2014-07-17 19:42:00 · 1850 阅读 · 0 评论 -
UVA 10090 Marbles(扩展欧几里得)
MarblesInput: standard inputOutput: standard outputI have some (say, n) marbles (small glass balls) and I am going to buy some boxes to store them. The boxes are of two types:Type 1: each原创 2014-07-18 17:04:57 · 2119 阅读 · 2 评论 -
UVA 10196 Morning Walk(欧拉回路)
Problem HMorning WalkTime Limit3 SecondsKamalis a Motashotaguy. He has got a new job in Chittagong. So, he has moved to Chittagong fromDinajpur. He was getting fatter i原创 2014-07-17 12:43:24 · 1465 阅读 · 0 评论 -
CodeForce 356A Knight Tournament(set应用)
Knight Tournamenttime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputHooray! Berl II, the king of Berland is m原创 2014-07-20 18:38:30 · 1697 阅读 · 0 评论 -
UVA 111 - History Grading(动态规划)
History Grading BackgroundMany problems in Computer Science involve maximizing some measure according to constraints.Consider a history exam in which students are asked to put severa原创 2013-07-30 14:14:20 · 2081 阅读 · 0 评论 -
UVA 568 - Just the Facts(数论)
Just the FactsThe expression N!, read as ``N factorial," denotes the product of the first N positive integers, where N is nonnegative. So, for example,NN!0111原创 2013-07-12 10:23:43 · 2967 阅读 · 1 评论 -
UVA 11235 Frequent values(RMQ)
Frequent values TimeLimit:3000MsYou are given a sequence of n integers a1 , a2 , ... , an in non-decreasing order. In addition to that, you are given several queries consisting of indices原创 2014-07-30 18:49:43 · 1268 阅读 · 0 评论 -
UVA 11178 Morley’s Theorem(莫雷定理 计算几何)
Morley’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 an equilat原创 2014-09-12 14:45:02 · 2881 阅读 · 0 评论 -
UVA 10465 - Homer Simpson 贪心
Homer SimpsonTime Limit: 3 secondsMemory Limit: 32 MBHomer Simpson, a very smart guy, likes eating Krusty-burgers. It takes Homer m minutes to eat a Krusty- burger. However原创 2013-08-02 18:29:27 · 1795 阅读 · 0 评论 -
UVA 10566 Crossed Ladders (几何题)
Crossed LaddersInput: Standard InputOutput: Standard OutputTime Limit: 1 Second A narrow street is lined with tall buildings. An x foot long ladder is rested at the base of the building on原创 2014-01-12 17:56:25 · 2361 阅读 · 0 评论 -
UVA 10820 - Send a Table 数论 (欧拉函数)
Send a TableInput: Standard InputOutput: Standard Output When participating in programming contests, you sometimes face the following problem: You know how to calcutale the output for the give原创 2013-08-03 18:26:49 · 2106 阅读 · 0 评论 -
UVA 490 Rotating Sentences
Rotating SentencesIn ``Rotating Sentences,'' you are asked to rotate a series of input sentences 90 degrees clockwise. So instead of displaying the input sentences from left to right and top t原创 2013-07-11 11:28:02 · 2373 阅读 · 0 评论 -
UVA 489 - Hangman Judge
Hangman JudgeIn ``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原创 2013-07-11 15:56:16 · 3383 阅读 · 0 评论 -
UVA 216 - Getting in Line
216 - Getting in LineComputer networking requires that the computers in the network be linked.This problem considers a ``linear" network in which the computers are chained together so that eac原创 2013-07-17 09:38:15 · 1581 阅读 · 0 评论 -
UVA 146 - ID Codes 枚举排列
ID CodesIt is 2084 and the year of Big Brother has finally arrived, albeit a century late. In order to exercise greater control over its citizens and thereby to counter a chronic breakdown in law an原创 2013-07-16 17:55:39 · 2183 阅读 · 0 评论 -
UVA 657 - The die is cast 深度搜索
657 - The die is castInterGames is a high-tech startup company that specializes in developing technology that allows users to play games over the Internet. A market analysis has alerted them to th原创 2013-07-17 18:42:03 · 2355 阅读 · 3 评论 -
UVA 102 - Ecological Bin Packing(动态规划)
Ecological Bin Packing BackgroundBin packing, or the placement of objects of certain weights into different bins subject to certain constraints, is an historically interesting problem.原创 2013-07-30 15:35:57 · 3159 阅读 · 0 评论 -
UVA 10405 - Longest Common Subsequence
Longest Common SubsequenceSequence 1: Sequence 2: Given two sequences of characters, print the length of the longest common subsequence of both sequences. For原创 2013-07-30 16:13:59 · 1012 阅读 · 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原创 2013-07-24 14:30:50 · 1272 阅读 · 0 评论 -
UVA 507 - Jill Rides Again 动态规划
Jill Rides Again Jill likes to ride her bicycle, but since the pretty city of Greenhills where she lives has grown, Jill often uses the excellent public bus system for part of her journey.原创 2013-07-25 15:23:57 · 1613 阅读 · 1 评论 -
UVA 10285 - Longest Run on a Snowboard (记忆化搜索+dp)
Longest Run on a SnowboardInput: standard inputOutput: standard outputTime Limit: 5 secondsMemory Limit: 32 MB Michael likes snowboarding. That's not very surprising, since snowboarding is原创 2013-08-02 19:25:22 · 1358 阅读 · 0 评论 -
UVA 10006 - Carmichael Numbers 数论(快速幂取模 + 筛法求素数)
Carmichael Numbers An important topic nowadays in computer science is cryptography. Some people even think that cryptography is the only important field in computer science, and that life原创 2013-08-03 15:13:42 · 2935 阅读 · 0 评论 -
LA 2659 && poj 3076 && zoj 3122 Sudoku(精确覆盖 + DLX)
题目链接:https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=660TimeLimit: 3.000 secondsA Sudoku grid is a 16 x 16 grid of cells grouped in sixteen原创 2014-11-17 20:36:16 · 2143 阅读 · 0 评论