uva timecard

Finally on the UVA AC 50 questions, feel there is a long way to go!!!It's a bit of a problem, or it's written in STL.1#include 2#include 3#include 4#include Set>5#include 6 using namespacestd;7 Const intmaxx=1010;8typedefstructNode9 {Ten stringBook,name; One BOOL operatorConst structNode x)Const A { - if(Name!=x.name)returnnameX.name; - returnbookX.book; the } - }node; - intMain () - { + //freopen ("In.txt", "R", st

UVA 11624 fire! Topic: J Work in the Maze, one day The Maze fire, the fire has many places. Every second, the fire will spread to four directions, J will also move to four directions, asked J can run out, to output him to run out of the shortest time, otherwise output "impossible" problem-solving ideas: first to carry out a BFS, find every point of flame spread to the shortest time of the place. Then, according to the "Fire map", the path of J is BFS.

Topic Portal1 /*2 Test instructions: To change the minimum number of 0 1, so that each element around the and is an even3 enumeration: Enumerates all possible (14 finally check the different quantity, take the minimum value5 */6#include 7#include 8#include 9 using namespacestd;Ten One Const intMAXN = -; A Const intINF =0x3f3f3f3f; - intA[MAXN][MAXN], B[MAXN][MAXN]; - intN; the - intCheckints) { -memset (b,0,sizeof(b)); - for(intI=0; ii) { + if(S (10][i] =1; - Else if(a[0]

Set> -#include -#include in#include - using namespacestd; to + #defineLson L, Mid, RT - #defineRson mid + 1, R, RT thetypedefLong Longll; * Const intMAXN = 5e2 +Ten; $ Const intINF =0x3f3f3f3f;Panax Notoginseng Const intMOD = 1e9 +7; - intA[MAXN][MAXN], B[MAXN][MAXN]; the intSUM1[MAXN][MAXN], SUM2[MAXN][MAXN]; + intDP[MAXN][MAXN]; A the intMainvoid) {//UVA 1366 Martian Mining + intN, M; - while(SCANF ("%d%d", n, m) = =2) { $

Topic: A robot walking in a maze, its instructions are direction control (forward, left, right), give you the initial position and some instructions;Ask to stop at the last place.Analysis: Simulation. Direct simulation, pay attention to the details.If you cannot walk (the border or the wall wall) stop in place, the instruction is to the end of ' Q '.Note: Notice that there is a newline between multiple sets of outputs, otherwise it will wa,uva the PE

UVA 725 Division (Division)A-Brute Force solutionTime limit:3000MS Memory Limit:0KB 64bit IO Format:%lld %llu DescriptionWrite a program, finds and displays all pairs of 5-digit numbers, between them use the digits 0 through 9 Once each, such the first number divided by the second are equal to an integer N, where. That's,Abcde/fghij = NWhere each letter represents a different digit. The first digit of the numerals is allowed to be zero.InputEach line

Topic Link: UVA 11529-strange tax calculationThe main topic: give a number of points, to ensure that the random three points not collinear. Randomly select three points as triangle lines, and other points within the triangle, it is the inner point of the triangle. Ask how many internal points each triangle has on average.How to solve the problem: the total number of triangles is very easyC ( 3 n ) , now is the total number of points r

UVA 11374 Airport ExpressIn a small city called Iokh, a train service, Airport-express, takes residents to the Airport more quickly than other Tran Sports. There is types of trains in Airport-express, the economy-xpress and the commercial-xpress. They travel at different speeds, take different routes and has different costs.Jason is going to the airport to meet his friend. He wants to take the commercial-xpress which was supposed to being faster, but

This problem and calculates the prime number of the phase interval. Thinking in unison.Note the problem:1 I may be greater than or equal to J--upload here. Read test instructions carefully, I did not say this place is not guaranteed. Special handling Required2 The number of integers that may overflow during the calculation is greater than the maximum value, a long long must be usedAbout efficiency and time issues:1 is able to use an array to save intermediate results, so execution is fast. The m

UVA 1291-dance Dance RevolutionThere is a dancing machine. The origin is 0, there are four directions, on the left lower right, respectively labeled (1234), the initial player two feet stand in 0 position, dance opportunity to give a series of numbers, the player to follow the order of four direction of the number. Moving the foot consumes the player's energy, moves from 0 to four, consumes 2 energy, moves from one direction to another, consumes 3 poi

Mathematical expectation/Markov processdp/Memory SearchRujia Teacher petition on the example ...1 //UVA 117622#include 3#include 4#include 5#include 6#include 7#include 8 #defineRep (i,n) for (int i=0;i9 #defineF (i,j,n) for (int i=j;iTen #defineD (i,j,n) for (int i=j;i>=n;--i) One using namespacestd; A intGetint () { - intv=0, sign=1;CharCh=GetChar (); - while(ch'0'|| Ch>'9'){if(ch=='-') sign=-1; Ch=GetChar ();} the while(ch>='0'ch'9')

Topic Link: UVA 1017-merrily, We roll along!By connecting all the points in turn to form a curve, the trajectory of the center movement is actually the curve of the moment and its distance to R.For a segment is panning, for a point is a circle. The required trajectory is actually the contour of all segments and circles, so starting from the starting position, each time the violence is the next point to move to, the distance is the final and.For point

Topic Link: UVA 319-pendulumNote that height can not be higher than horizontal line, a period is around a point has been circling, a period is to return to the starting point.#include Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced. UVA 319-pendulum (geometry)

Topic Link: UVA 11978-fukushima nuclear BlastTwo points, circle and polygon area intersection. Splits the polygon into an n-part triangle (each two points and the center of the circle) to calculate the direction area. The area of each triangle and circle is discussed in four categories.#include Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced. UVA 1

UVA 10564 Paths through the HourglassPaths through the HourglassInput: standard inputOutput: Standard OutputTime Limit: 2 SecondsThe hourglass to the right a path is marked. A path always starts at the first row and ends at the last row. Each cell in the path (except the first) should is directly below to the left or right of the cell in the path in the Prev IOUs row. The value of a path is the sum of the values in each of the cells in the path.A path

UVA unidirectional TSPBackgroundProblems that require minimum paths through some domain appear in many different areas of computer science. For example, one of the constraints in VLSI routing problems are minimizing wire length. The Traveling salesperson problem (TSP) –finding whether all the cities on a salesperson ' s route can be visited exactly o NCE with a specified limit on travel time–is one of the canonical examples of a np-complete problem; S

UVA 1434-yaptchaTopic linksTest instructions: Find out the answer to the formula in the questionIdeas:When 3? k + 7 Non-prime time, then (3? ) k + 6 )! (Two factors must be found to multiply)So the original is 0When 3? k + 7 As a prime number, according to the Wilson theorem,((3?k+6)!+1)%(3?k+7)==0, so the primitive can be converted to [x-(x-1)] = 1So the question turns to just to infer that 3 * k + 7 is not a prime number, then it is very good

() ( )) ) ) )Note that with this formulation all leaves of a tree is of the form (Integer () ())Since an empty tree have no root-to-leaf paths, any query as to whether a path exists whose sum are a specified integer in a n Empty tree must be answered negatively.InputThe input consists of a sequence of test cases in the form of integer/tree pairs. Each test case consists of an integer followed by one or more spaces followed by a binary tree formatted as an S-expressio N as described above. All b

Topic Connection: UVA 11722-joining with FriendYou and your friends take the train, and will pass a city. Given that two people may arrive at City A, the train will stop W. Ask the probability that two people can meet.Problem-solving ideas: y = x + W and y = x-w the area around the given time divided by the total area of time, that is, when the area is to be processed by the situation.#include #include #include using namespace STD;intT1, T2, S1, S2, W

Title: UVA 10023-square root (hand squared root)Topic linksTo seek the square root of a given number.Problem-solving ideas: With two points but this number is too big, it has timed out. After reading the problem, we find that we need to calculate the square root of a hand.Algorithm:First judge whether this number is an even digit, yes, the first time to take the previous two digits, not the first time only to take the previous one number as dividend.