ethereum difficulty

http://poj.org/problem?id=3984Typical maze problem, record which point is the fastest to reach a point#include 　　POJ 3984 Maze problem BFS Difficulty: 0

http://acm.hdu.edu.cn/showproblem.php?pid=1495The amount of water in the third Cup can be obtained from the first two cups, while the total number of the first two cups is within 100*100, and the poor lifting can be achieved#include 　　HDU 1495 very Coke BFS Difficulty: 1

https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudgeitemid=8page=show_problem problem=3916This problem requires a filling + digging pit + building barrier method, so that the land on all the pits and grass between all the barriers, digging pit spend d per block, fill the cost f per block, build the barrier cost B every two pieces, attention does not require there must be pits, but the periphery of a lap must be no pits, so need to pre-fill goodMake St represents the flat, Ed stand

App.js Application Portal File1.//View engine Setup settingsApp.set (' Views ', Path.join (__dirname, ' views '));//Tell Express in viewsRecord search for all the templatesApp.set (' View engine ', ' HJS ');//Apply the HJS template engine on these templates2.//app.use () to register the middleware for HTTP requests, configure the routing responseApp.use (App.router);App.use (Express.static (Path.join (__dirname, ' public '));express.static Specifies the find directory for a static page,The Packa

http://www.spoj.com/problems/COMPANYS/en/The title requires just the smallest spanning tree with K-bar 0-Class edgesEach time you add or subtract a value delta to the weight of a 0-class edge, until there is exactly a K-edge of 0 on the smallest spanning tree, the minimum spanning tree weight is given-the changed value *k is the answerBut if you do this, it will time out, because all are integer weights, so you only need to take precedence over the 0-class edge, and the binary integer DeltaIf yo

http://www.spoj.com/problems/VLATTICE/Obviously, when gcd (x, Y, z) =k,k!=1, (x, Y, z) is obscured (x/k,y/k,z/k), so this question requires the number ==1 (+{) x,y,0 (x, y) |gcd ==1 (+3{) of gcd (x, Y, z) 0,0,1 ( 0,1,0), (1,0,0)}Now don't go to the last three points on the axis,Set F (i) =| {(x,y,0) |gcd (x, y) ==i}|*3+| {(x, y, z) |gcd (x, Y, z) ==i}|, which is the number of greatest common divisor that are not on the axis and are not 0 coordinate values,F (i) is the number of coordinates that

https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudgeitemid=8page=show_problem problem=2640http://www.spoj.com/problems/SPOINTS/en/http://poj.org/problem?id=3805http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1298To have a straight line divided into two convex bags, two convex packets do not intersect, not tangent is necessaryIn the absence of templates, my code, over the Poj,uva, and Spoj, but not aoj, and the correct code on the PAT found that the situation is not quite

not difficult to understand, we assume x = KY + R (we consider r > 0, there will be rounding occurring), then there is.└ (x+y-1)/y┘=└ (ky+r+y-1)/y┘= K +└ (r+y-1)/y┘= K + 1You can see that after doing this processing, that is, the X plus y-1 offset, at this time in the rounding, the result will be added 1 on the original basis. This is exactly what "biasing" means, and it will round out the rounding "offset".Here we will complement the division of the program in this way to fix it, see if this i

http://acm.hdu.edu.cn/showproblem.php?pid=4405Obviously, there is no need to consider the dice when the plane, must be better by planeSet E[i] for the number of steps that are required to walk at the point of I, J is one of the possible points to be cast, if deduced from I to i-j, we are not able to determine the transfer direction of I, because there may be two i-j with a plane whose destination is I, so we choose to derive the desired from I to i+jIf you set g[i] to the number of steps you hav

Priority queue, but also the idea of looking at someone else's code#include HDU 4546 Race Difficulty

servers to Lenovo, Daotie $1.5 billion "sale" chip manufacturing business for a $2.3 billion price. Hardware manufacturing has long been not profitable, the server market is also growing weak, so IBM's behavior is understood by everyone.2 IBM has invested $ billions of in research and acquisitions in cloud computing, and IBM has invested $7 billion to acquire 17 cloud computing companies since 2007. Previously released data showed that more than 5.5 million customer transactions per day were do