error 1062

#include #include#include#include#include#include#includeSet>#include#include#include#include#includetypedefLong Longll;using namespacestd;//freopen ("d.in", "R", stdin);//freopen ("D.out", "w", stdout);#defineSspeed ios_base::sync_with_stdio (0); Cin.tie (0)#defineMAXN 101Const intinf=0x7fffffff;//infinitely LargeintM,n;intPRICE[MAXN][MAXN];intLV[MAXN];intX[MAXN];intDIST[MAXN];intVISIT[MAXN];voidinit () {memset (Price,0,sizeof(price)); memset (LV,0,sizeof(LV)); memset (Dist,inf,sizeof(Dist)); m

String inversion: Each word is reversed and then output.PE Practice: All words are reversed and written to another array, with code1#include 2#include 3#include 4 using namespacestd;5 Const intn=1005;6 intMain () {7 CharOl[n],no[n];8 intN;9 //freopen ("C:\\code\\in.txt", "R", stdin);Ten //freopen ("C:\\code\\out.txt", "w", stdout); Onescanf"%d",n); A GetChar (); - while(n--) { - the gets (OL); - - for(intI=0, j=0; I) { - if(ol[i+1]==' '|| i+1==strlen (OL

input first line is two integers m,n (1 Outputoutput The minimum number of coins required. Sample Input1 410000 3 22 80003 50001000 2 14 2003000 2 14 20050 2 0Sample Output5250Idea: Use Dijkstra to find the shortest path to the graph.Each item is regarded as a node, and the chief's promise is also regarded as an object (the specified number is 1), if an item plus gold coin can exchange another item, then the two nodes have an edge, the weight value is the number of coins, the first node to all

valid levels $Mi =min (MI, Dijk (i)); $printf ("%d\n", MI); - } - return 0; the } - Wuyi voidInit () the { - intI, J; Wu for(i=0; i) - for(j=0; j) AboutMAP[I][J] =INF; $ } - - intDijk (intx) - { A intDIST[MAXN], VIS[MAXN], I, J; + intHigh = Goods[x].l + M;//Rank Maximum value the intlow = GOODS[X].L;//Rank Minimum value -memset (Vis,0,sizeof(Vis)); $ for(i=0; i//initialized to a valid value within a valid level, otherwise INF the if(Low High )

Original title AddressThe common ancestor of a and a is a, even if a does not appear in the previous genealogy! By this hole, WA for a long time ...For example: Small head father is the big brother son his father, asked: Next door Uncle Wang and next door Uncle Wang's recent ancestors who? , answer: Uncle Wang next door.Code:1#include 2#include 3#include Set>4#include string>5 6 using namespacestd;7 8 intMain () {9 intN, M;Tenmapstring,string>F; One ACIN >>N; - for(inti =1; I ) { - str

Question connection http://poj.org/problem? Id = 1062 ACCode # Include

must give M (Sample Input:14 60 8010000001 64 9010000002 90 6010000011 85 8010000003 85 8010000004 80 8510000005 82 7710000006 83 7610000007 90 7810000008 75 7910000009 59 9010000010 88 4510000012 80 10010000013 90 9910000014 66 60Sample Output:1210000013 90 9910000012 80 10010000003 85 8010000011 85 8010000004 80 8510000007 90 7810000006 83 7610000005 82 7710000002 90 6010000014 66 6010000008 75 7910000001 64 90Thinking of solving problemsSort by rankAC Code#include #include #include using nam

It's okay. Water is a water. Topic Link: http://acm.hdu.edu.cn/showproblem.php?pid=1062

daughter.InputThe input first line is two integers m,n (1 OutputOutput the minimum number of coins required.Sample Input1 410000 3 22 80003 50001000 2 14 2003000 2 14 20050 2 0Sample Output5250This problem really makes my egg ache. I began to use the record path, found no solution, engage in a day, and then Baidu a puzzle. Find yourself akzent stupid, stupid home, as long as the choice of status interval size m of the interval, and then Dijkstra to find a single source of the shortest path does

The first Chinese Question of poj. At the beginning, the algorithm was wrong. Algorithm with the initial error: 1. Create a Graph Based on the question 2. Floyd evaluate the passing closure. 3. Calculate the dijsktra algorithm once starting from 1 and record its path 4. enumerate the points that can be reached by 1, find the minimum straight, and determine whether the points on the path meet the level limit. After the

phpmyadmin. The above operations are performed in phpmyadmin. First, add the id. If you select unique, you cannot add the id. You can leave it empty.Changing int to bigint is also invalid. If you select to be empty, the field can be added, but the data cannot be added under the field. For example, if you add 2, it is repeated. If you select the primary when adding a field, you cannot add it anyway. In fact, there are only two fields in my table. One username is a character, and the other pas

Thought: This is the transformation of the Dijkstra algorithm. To solve this problem, I personally think it is necessary to deeply understand the concept of this algorithm. Why? That is to make you understand algorithm templates more deeply based on your thinking (for personal opinions, Do not spray 2333333 if you are wrong) So for this question, you can write each number in the draft, and you will find that you can create a graph and write its replacement position from the first position, we ca

I just learned that PHP and MySQL were having trouble adding fields when using phpMyAdmin. The above is the operation in the phpMyAdmin The first is to add the ID, select unique can not add, at this time there is no check to empty.The online said to change int to bigint also invalid. If you choose to be empty, the field can be added, but you cannot add data under the field, such as adding a 2 to repeat. If you select Primary when you add a field, you cannot add it anyway. In fact, I only have

PhenomenonWhen we encode the implementation to request a page, the requested code resembles the following code:HttpWebRequest req = (HttpWebRequest) webrequest.create (strURL);Req. useragent = "MSIE6.0";Req. Method = "GET";HttpWebResponse res = (HttpWebResponse) req. GetResponse ();StreamReader sr = new StreamReader (res. GetResponseStream (), Strencode);strHTML = Sr. ReadToEnd ();Sr. Close ();However, if the page we are requesting is exactly a page with an exception, or a page that does not exi

To publish the Web site to IIS, Access has the following error:HTTP Error 500.21-internal Server error handler "Pagehandlerfactory-integr" has an error module in its module list "Managedpipelinehandler"Cause: After you install the framework v4.0, IIS is enabled, causing the framework to not be fully installedFIX: Start with all programs, accessories, right-click

The exchange value between an item and another item can be seen as the Benquan of the two items, the need to pay attention to is the level of restrictions, the beginning did not see the point of view, that is as long as two people's level limit of

At first glance, this question seems very simple. Then I think u, v, and w cannot win if they are all smaller than others. Otherwise, they will win, however, this approach is half the same. The conclusion that win is not true, but win's conclusion

I can't say anything about this question. I have been crazy about it for a long time. Now I am finally AC. I have spent too much time on this question ,,,,When I first read this question, I thought of using DFS. Later I remembered that I had read

DijkstraAlgorithm: Directed graph G = (V, E) 1. Put the Source Vertex V0 into the set S, and the counter C = 0. Each node has a structure data D (A, B). A indicates the shortest path length to v0, and B indicates the frontend node of. Initialize V0

  I won't talk about the meaning of the Chinese Question. Note that the class gap between all people cannot exceed one value, not between two people. (the wrong question is wa for half a day ), After creating a graph, you can obtain the minimum