UVA
一种坚持__
这个作者很懒,什么都没留下…
展开
-
uva Cube painting(bfs水过)
Cube painting We 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原创 2015-01-15 19:40:06 · 584 阅读 · 0 评论 -
UVA 156 Ananagrams (字符串模拟)
AnanagramsTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescription Ananagrams Most crossword puzzle fans are used to原创 2014-12-11 19:56:05 · 634 阅读 · 0 评论 -
Excuses, Excuses!(字符串查找)
Excuses, Excuses!Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescription Excuses, Excuses! Judge Ito is having a prob原创 2014-12-04 09:14:19 · 618 阅读 · 0 评论 -
Artificial Intelligence?(字符串处理)
Artificial Intelligence?Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescription Artificial Intelligence? Physics tea原创 2014-12-03 21:30:05 · 668 阅读 · 0 评论 -
UVa 10763 Foreign Exchange(水题)
Foreign ExchangeInput: standard inputOutput: standard outputTime Limit: 1 secondYour non-profit organization (iCORE - international Confederation of Revolver Enthusiasts) coordinates a ver原创 2015-02-02 09:46:55 · 590 阅读 · 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 cam原创 2015-02-03 16:35:41 · 565 阅读 · 0 评论 -
UVA 10132 File Fragmentation(字符串还原)
File FragmentationTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionQuestion 2: File FragmentationThe ProblemYour friend, a bioc原创 2015-02-04 09:47:44 · 514 阅读 · 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-04 08:29:45 · 557 阅读 · 0 评论 -
UVA 10200 Minimal coverage (区间覆盖贪心)
Minimal coverage The ProblemGiven several segments of line (int the X axis) with coordinates [Li,Ri]. You are to choose the minimal amount of them, such they would completely cov原创 2015-02-03 20:40:45 · 591 阅读 · 0 评论 -
uva 147 Dollars(完全背包)
DollarsTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescription Dollars New Zealand currency consis原创 2015-01-19 10:31:08 · 505 阅读 · 0 评论 -
uva 10100 Longest Match(最长公共子序列)
Longest MatchInput: standard inputOutput: standard outputA newly opened detective agency is struggling with their limited intelligence to find out a secret information passing technique among原创 2015-01-19 15:53:50 · 1490 阅读 · 0 评论 -
UVA 10954 Add All(优先队列)
Add AllInput: standard inputOutput: standard outputYup!! The problem name reflects your task; just add a set of numbers. But you may feel yourselves condescended, to write a C/C++ program ju原创 2015-02-02 19:27:33 · 546 阅读 · 0 评论 -
UVA 10341Solve 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-02 15:46:32 · 640 阅读 · 0 评论 -
uva 10534 Wavio Sequence (最大递增和递减序列 n*logn)
Wavio Sequence Input: Standard InputOutput: Standard OutputTime Limit: 2 Seconds Wavio is a sequence of integers. It has some interesting properties.· Wavio is of odd length i.e. L = 2*n原创 2015-01-20 15:48:57 · 613 阅读 · 0 评论 -
UVA 10161 Ant on a Chessboard(规律)
Problem A.Ant on a Chessboard Background One day, an ant called Alice came to an M*M chessboard. She wanted to go around all the grids. So she began to walk along the chessboard acco原创 2015-01-15 18:41:26 · 630 阅读 · 0 评论 -
Automatic Editing(字符串替换)
Automatic EditingTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionProblem E: Automatic EditingSource file:autoedit.{c,原创 2014-12-04 20:43:08 · 533 阅读 · 0 评论 -
Product(大数乘法模板)
K -ProductTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescription Product The ProblemThe problem is to mult原创 2014-12-03 12:47:46 · 533 阅读 · 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-02 14:40:23 · 545 阅读 · 0 评论 -
UVA 10905 Children's Game(数字组合求最大)
Children's GameTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescription4thIIUCInter-University Programming Contest, 2005原创 2015-02-02 09:16:08 · 714 阅读 · 0 评论 -
uva Simple calculations (数学推导)
Simple calculations The ProblemThere is a sequence of n+2 elements a0, a1,…, an+1 (n i 1000). It is known that ai = (ai–1 + ai+1)/2 – ci for each i=1, 2, ..., n. You are given a0,原创 2015-01-16 10:37:13 · 601 阅读 · 0 评论 -
UVA 714 Copying Books(最大值最小化)
Copying BooksTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescription Copying Books Before the invention of book-pr原创 2015-02-04 21:28:02 · 533 阅读 · 0 评论