Title Source: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=116&problem=1338&mosmsg=Submission+received+with+ID+8905555 Subject to the effect: see Code Title Analysis: See Code //Uva 10
lt, amp, submission, algorithm, vector, cmp, v1, double x, dis, iostream, double c, const int, cmath, struct node, c bool, iomanip, minv, title sourceMay 31
http://acm.hdu.edu.cn/showproblem.php?pid=2096 Problem Description Xiao-Ming 3 years old, and now he has been able to recognize non-negative integers less than 100, and 100 can be less than the addition of non-negative integer calculations. Integer g
lt, ctype, negative integer, input data, algorithm, test data, positive integer, printf, vector, queue, xiao ming, problem description, negative integers, ctime, scanf, iostream, cstring, cstdlib, cmath, fstreamMay 22
http://acm.hdu.edu.cn/showproblem.php?pid=1406 Problem Description After a few definitions: If a positive integer greater than 1 and equal to all the factors of its own, called the number this number is complete, such as 6,28 is complete: 6 = 1 +2 +3
true return, test cases, test case, ctype, input data, integers, test data, positive integer, composition 1, problem description, int sum, bool, ctime, scanf, iostream, endl, cstring, cstdlib, cmath, fstreamMay 21
http://acm.hdu.edu.cn/showproblem.php?pid=1215 Problem Description Tanabata Day, joking to the digital kingdom, he posted a notice at the gate and the Kingdom of the people and numbers, said: "You want to know your other half is? It in accordance wit
amp, lt 1, ctype, input data, stack, algorithm, test data, positive integer, printf, vector, queue, problem description, ctime, scanf, iostream, cstring, cstdlib, cmath, fstream, tanabataMay 21
http://poj.org/problem?id=1083 The meaning of problems: moving chairs and tables, are given a, b, that a move from b, the time required to complete at least all the transporting task Note: moved to the corridor, this time from the beginning to the en
lt, hash, ctype, time interval, queue, bool, sizeof, ctime, memset, cout, iostream, int main, cstring, cstdlib, cmath, problem id, fstream, sstream, iomanip, moving chairsMay 19
http://poj.org/problem?id=3211 Meaning of the questions the couple is seeking a minimum of time washing clothes press clothes with color categories, for each color of the clothes are equally optimal solution is that V / 2, laundry bag capacity to spe
lt, ctype, algorithm, queue, sum sum, color categories, sizeof, ctime, backpack, optimal solution, iostream, cstring, cstdlib, cmath, problem id, strcmp, washing clothes, fstream, sstream, iomanipMay 13
http://poj.org/problem?id=2488 Meaning of the questions: The classic way to vault the issue [jump course, is the way the] Chinese chess. A p * q of the board, starting from a point, ask if there is such a jump methods, making the place after each hor
true return, lt c, ctype, step 1, algorithm, several ways, vector, queue, ctime, poj, iostream, cstring, cstdlib, cmath, problem id, fstream, sstream, iomanip, chinese chess, jump courseMay 13
Matrix class encapsulates the game to do very depressed, why do people write very long, very wordy code can have problems, but I can not always have it? ... /* * Author: rush * Created Time: 2011 Year in January 05 Day Wednesday 19 Hour 39 minute 08
lt, amp, map, algorithm, game, vector, pow, e2, rush, cout, iostream, cstring, cstdlib, cmath, matrix class, vecJanuary 6
Yesterday saw the wiki on the linear time complexity of algorithms, he came out with the code of the function in the shuffle_func2 Details, see here http://en.wikipedia.org/wiki/Fisher% E2% 80% 93Yates_shuffle Quote the following code into your compi
lt, algorithm, time 2, wikipedia, void init, vector, wiki, clock, e2, ctime, time complexity, cout, iostream, shuffle, using namespace std, cstdlib, cmath, linear time, fisher, complexity of algorithmsOctober 3
Maximum clique template #include <cstdio> #include <cstring> #include <cmath> #include <cstdlib> #include <iostream> #include <algorithm> #include <vector> #include <map> #define out(v) cout << #v <
lt, amp, algorithm, matrix, vector, mp, bool, s line, dfs, memset, scanf, cout, iostream, using namespace, cstring, cstdlib, j list, cmath, namespace std, maximum clique problemSeptember 2
// bjtu1394.cpp #include <cstdio> #include <cstring> #include <cmath> #include <cstdlib> #include <iostream> #include <algorithm> #include <vector> #include <map> #include <set> #define out(v) cout <
lt, amp, map, algorithm, printf, vector, cnt, strlen, scanf, cout, iostream, using namespace std, int main, cstring, cstdlib, cmath, getcharJuly 23
1. Algorithm is very simple to read three numbers a, d, n, from a, a + d, a +2 d, find prime numbers and so on, until you find the first n- Two. Realized using the method of prime numbers 3. Code # Include <cstdio> # Include <cmath> bool is_pr
quot, amp, lt 2, algorithm, prime numbers, printf, int count, int num, bool, sqrt, scanf, cmathJuly 21
1. Algorithm intended to play with the sieve method, prime number table, but this time out, then select the direct method of prime numbers. (Larger in scope, it may not so much with the prime number, hit the table would be more cost prime time, a dir
lt, quot, amp, algorithm, prime number, prime numbers, traversal, printf, input and output, int num, bool, sqrt, c file, scanf, prime time, sieve, c standard library, using namespace std, int main, cmathJuly 19
Perfect Pth Powers Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 9722 Accepted: 2139 Description We say that x is a perfect square IF, for some Integer b, x = b 2. Similarly, x is a perfect cube IF, for some Integer b, x = b 3. More gene
test case, printf, num num, last test, time limit, int num, th power, memory limit, int max, scanf, cout, iostream, endl, using namespace std, int main, cmath, int64, perfect cube, perfect square, power inputMay 31
Three powers Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 3299 Accepted: 1405 Description Consider the set of all non-negative integer powers of 3. S = (1, 3, 9, 27, 81, ...) Consider the sequence of all subsets of S ordered by the valu
lt, single line, elements, len, negative integer, positive integer, input output, time limit, digits, memory limit, th position, submissions, insights, iostream, cmath, subsets, number theory, waterloo, integer powersMay 30
Prime Test Time Limit: 6000MS Memory Limit: 65536K Total Submissions: 15434 Accepted: 2909 Case Time Limit: 4000MS Description Given a big integer number, you are required to find out whether it's a prime number. Input The first line contains the num
lt 2, lt 1, test cases, test case, prime number, pow, test time, time limit, memory limit, integer number, ctime, iostream, number test, cmath, test number, prime factor, case time, number theory, pollard rho, prime testMay 28
/ * 've Never done such a complex computational geometry problems, several times I do want to quit, finally adhere to write down more than a day spent Ins and Outs In fact, it is quite simple ideas, that is, signal coverage can be obtained for all th
lt, several times, shortcuts, bfs, int type, bool, intersection, current point, ins and outs, iostream, cmath, computational geometry problems, antenna connection, column point, signal coverage, digital lens, casen, max qMay 21
This question has done quite feeling ... as if the tree line is always flexible, but I think it should also be the rule-based allocation of gvim to write their own, feeling pretty good this time also learned a little bit tricky is infinite WA violenc
lt, return max, algorithm, child nodes, trilogy, case 2, int c, r1, child node, c int, void reset, iostream, cstring, cstdlib, cmath, gvim, r0, infinite wa, max4, max3May 3
C / C + + header files list ( C, traditional C + + # Include <assert.h> / / set the insertion point # Include <ctype.h> / / character handling # Include <errno.h> / / custom error code # Include <float.h> / / floating-point process
memory allocation, exception class, traditional c, insertion point, stream input, parameter input, cstdlib, cmath, allocation function, stl containers, c header files, c header file, fstream, deque, generic algorithm, output functions, localization function, iomanip, character classification, cctypeApril 26
1, a number n of excess, defined as all of its factors, and -2 * n, is less than 0, set to -1 Requirements: the maximum excess return of a number of range 2, solution: find the number of excess number of each, rmq return maximum value. Difficult: a n
implementation code, return max, int c, return sum, int tmp, int max, isprime, iostream, collegiate programming contest, const int, cmath, sizeof c, return maximum value, mk 1, excess number, power int, excess return, prime factors, max x, c maxMarch 3
1, the meaning of problems: seeking two subsets of depth and. 2, solution: the root node is known as 0, dfs time, the depth of each node can be obtained. 3, implementation code: #include<iostream> #include<vector> #include<cmath> #includ
lt, implementation code, algorithm, vector, games, alice, m2, root node, dfs, cout, iostream, collegiate programming contest, const int, stdin, cmath, subsets, struct nodeMarch 2
1, the meaning of problems: y-axis is about two point sets, find the midpoint of the maximum distance they are. 2, address: Two points must be the most distant point in the convex hull of all, the point to point correlation of the most remote point o
lt, amp, implementation code, axis, correlation, len, p0, double x, dis, midpoint, iostream, collegiate programming contest, cmath, graham scan, scan point, convex hull, distant point, farthest pointMarch 2
1, the convex hull of point set Q (convex hull) is a minimum convex polygon, to meet the Q of the point or edge in the polygon or in its inside. 2, convex hull algorithm most commonly used scanning method and Graham Jarvis is stepping method. 3, Grah
lt, amp, implementation code, len, reference point, y0, top of the stack, left turn, current point, iostream, pretreatment, cmath, convex hull algorithm, graham jarvis, convex polygon, graham scan, scan point, scan method, polar angle, x0February 27
1, the recent common ancestor (LCA): For a rooted tree T, two nodes u, v, a recent common ancestor LCA (T, u, v) that a node x, x is to meet u, v and x the depth of the ancestors as large as possible. 2, LCA problem to the RMQ transformation methods:
lt, array, conversion, algorithm, traversal, occurrence, vector, ancestors, endpoint, tree nodes, vertex, iostream, const int, cmath, rmq, common ancestor, transformation methodsFebruary 27
1, find the tree distance between two nodes 2 Answer: seek u and v of the recent common ancestor (LCA) Do first time dfs, transformed as it first appears between u and v the depth of the biggest point is that their common ancestor. 3, example code: #
lt, node, algorithm, vector, iostream, using namespace std, collegiate programming contest, stdin, cmath, freopen, common ancestorFebruary 26
1, the meaning of problems: Given a sequence of integers from 1 to n. Connected to the m-side command (s, e): that: s s e a month to between the maximum and minimum number of links up. k were asked: (x, y) points x and y are connected. 2, problem-sol
lt, algorithm, integers, iostream, using namespace, collegiate programming contest, graph problems, int rank, cmath, rmqFebruary 9
Ext JS PHPjava get file system location pathandroid openfileoutput examplejquery string comparison ends withjpa resulthtt: 122.13.0.201 vote List.php2:http: 202.119.175.107 infoms dcwj.jspftp: 192.168.26.66222.75.162.92https: 10.0.222.222:8088 school