visual land

The land of Justice the selling price of everything are fixed all over the country. Nobody can buy a thing and sell it in double price. But that's created problems for the businessmen. They left their business and went to the production. So, after some days everybody is in production and nobody in business. And the people didn ' t get their necessary things though the country is self-sufficient in every sector. The government became very much anxious.

The Land Leveling Project is the top priority of the land consolidation work. Although it is often used for budget adjustment during actual operations, it plays a decisive role in the implementation of the project. I. Earthwork CalculationTraditional methods, such as the section method, scatter method, and square method, are easy to understand. There are also some odd names in the north, such as what is

Leader in the Tree land Time limit:2000/1000 MS (java/others) Memory limit:65536/65536 K (java/others)Total submission (s): 169 Accepted Submission (s): 62 Problem Description Tree land had n cities, connected by n−1 roads. You can go to all city from any city. In the other words, this is a tree. The city numbered one are the root of this tree. There is n ministers numbered from 1 to N. You'll send them to

()) {result = cursor.getstring (0);} Cursor.close ();}} else {if (Number.indexof ("+") = = 0) {Number = number.substring (3);} if (Number.indexof ("") = = 0) {Number = number.substring (2);} String S1 = number.substring (0, 7); String sql = "Select location from mob_location where _id =?"; string[] param = new string[] {s1};if (database! = null database.isopen ()) {cursor cursor = Database.rawquery (SQL, param), if (Cursor.movetonext ()) {result = cursor.getstring (0);} Cursor.close ();}}} els

1.null is a wonderful thing that can be understood as object placeholdersUser user = null;System.out.println (User.getcredits ());can be compiled,User user;System.out.println (User.getcredits ()); but not .when similar User user = null; such a variable goes to call only User user = new user (); to invoke the method, NullPointerException is triggered. 2. NullPointerException is also triggered when a null wrapper class is re-evaluated to the base typeInteger test = null;int oop = test;3. is null

Holy Land Layout

Label: style blog HTTP color OS ar Java for SP Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 5050 Question: Given the length and width of a rectangle, this rectangle is divided into several equal squares with no surplus. The maximum length of the side of the square. Solution: This is a variant of the "Pick Theorem" (I don't know it's the pick theorem, But I can leave the conclusion ). The theorem is used to obtain the length and width of a rectangle. However, the input number is binary,

From: Click to open the link For the original question, see hdu5050 Code: #include Hdu5050_2014acm Shanghai _ divided land

Land and Archives Management Information System [archiving and borrowing Registration] -- Establish a personal brand through knowledge sharing. 2.4 File query and borrowing Registration After you locate the Retrieved Data (or do not locate the data, you can directly check the data for registration. The system can monitor the borrowing time. When the file is borrowed and the borrower fails to return the file on time, a prompt is displayed auto

Land and Archives Management Information System [archives recording] Photo Archives, video recordings, recording, and recording of physical files -- Establish a personal brand through knowledge sharing. 2.1.8 photo and file recording Photo file directory recording interface: Photo group description recording interface: Directory recording interface in the photo volume: 2.1.9 recording of video files Video file recording interface: 2.1.10

]-f [I + 1]> = f [I + 1], obtain f [I + 1] 2. If this operation is executed, the distance between the operation and the destination will be shortened, because the operation passed through F [I + 1, the minimum distance to reach the destination is f [I + 1]. Alice in F [I + 1], after s [I], this operation shortens the distance from the destination, and the distance is already smaller than F [I + 1, therefore, it is possible to reach the destination at this time. In order to make f [I] as small a

I use this formula to calculate: F (n) = (n, 4) + (n, 2) + 1. Detailed explanation is available here. I really need to implement a big integer class. The following code is rather ugly. Code: /*************************************** ********************************** * Copyright (c) 2008 by liukaipeng * * Liukaipeng at gmail dot com * **************************************** *********************************/ /* @ Judge_id 00000 10213 C ++ "how many pieces of

thinking about your partner.But you have to understand that you can be a complete person yourself.Although less warm, but at least more frankly.So finally, make a handshake with yourself.　　Perhaps, you feel the taste of life, you will not be so lonely.I know I am lying to you, because I also have no time to think that everyone is a desert island.You probably hope for miracles, too. Think another person can relieve your loneliness.In fact, I think the two pieces of the island, connected together

The main geological disasters in our province are landslide collapse and ground collapse. Collapse and landslide are mainly distributed in Wuhua County, Meixian County, dapu County, Longchuan County, Zijin County, Heping County, Longmen County, wenyuan County, and Lechang city in North Guangdong, luuding County, guangning County, gaoyao city, huaiji County, Xinyi city, and other places in western Guangdong. Debris flows are mainly distributed in sinyi city, Liannan County, Qingxin County, Weng

Baotou on the map. It touched me very much. Not to mention the summer. The air conditioners here cannot be purchased, and the fans are rarely used. It can be regarded as a summer resort. In the evening of summer, we often walk on campus, or play a ball, and the breeze blows. It's a cool word. Even sleeping at night, we need to cover the quilt, so we can see the cool summer there. The consumption there is not high, so if you go out to eat a meal 20 Yuan or so, especially the barbecue at the sc

>=2 SGN (s[sp]-s[sp-1]) * (p[i]-s[sp-1])) 0) sp--; s[++sp]=P[i]; } POS=sp; for(inti=n-1; i>=1; i--) { while(sp>=pos+1 SGN (s[sp]-s[sp-1]) * (p[i]-s[sp-1])) 0) sp--; s[++sp]=P[i]; } for(intI=1; i1]=S[i]; for(intI=1, p1,p2,p3;i) { for(p1=i+1, p2=i+2, p3=i+3;p 21;p 2++) { while(SGN (s[p2]-s[i) * (s[p1+1]-S[P1]) 0) ++P1; while(SGN (S[I]-S[P2) * (s[p3+1]-S[P3]) 0)if(++p3-i>=sp-1) Break; if(p3-i>=sp-1) Break; Res=max (Res, (Fabs ((s[p2]-s[i)) * (S[p1]-s[i]) +fabs ((S

The main topic: The GCD of two binary numbers is represented by a binary number.Topic Analysis: This problem can be used in Java in the large number of AC.The code is as follows:Import Java.io*;import Java.math.biginteger;import Java.util.scanner;public class Main {public static void main (String Agrs[]) {Scanner sc=new Scanner (system.in); int t=sc.nextint (); for (int i=1;i　　However, you can also use binary to find GCD.GCD (A, B) =gcd (A/2,B/2) * (A, b all are even)GCD (b) =gcd (A,B/2) (A is o

Slope optimization ...#include #include#include#include#defineMAXN 50050#defineINF 0X7F7F7F7F7F7F7F7FLLusing namespacestd;Long Longn,s[maxn],top=0, F[MAXN],G[MAXN],A[MAXN],B[MAXN],L,R,Q[MAXN];structpnt{Long Longx, y;} P[MAXN];BOOLcmp (PNT x,pnt y) {if(x.x!=y.x)returnx.xy.x; returnx.yy.y;}DoubleKLong LongXLong Longy) { if(B[x]==b[y])returninf; return(Double) (G[x]-g[y])/(b[x]-b[y]);}intMain () {scanf ("%lld",N); for(Long LongI=1; i"%lld%lld",p[i].x,p[i].y); Sort (P+1, p+n+1, CMP); for(Long L

; - for(intI=2; i) About if(a[i].ya[q].x)) $q=i; -Swap (a[1],a[q]); -Sort (A +2, a+n+1, CMP); -s[1]=a[1]; As[2]=a[2]; +tot=2; the for(intI=3; i) - { $ for(;tot>1 (a[i]-s[tot-1]) * (s[tot]-s[tot-1]) 0; tot--); thes[++tot]=A[i]; the } thes[tot+1]=s[1]; the for(intx=1; x) - { in inta=x%tot+1, b= (x+2)%tot+1; the for(inty=x+2; y) the { About for(; a%tot+1!=y (S[y]-s[x]) * (S[a]-s[x]) 1]-s[x]); a=a%to

-left;} ll dinic (void) {ll ret=0; while(BFS ()) { for(inti=st; ireturnRET;}intMain (void) {scanf ("%d%d",n,m); st=0; ed=n+1; for(inti=st; i1; Add (St,1Inf0); Add (N,ed,inf,0); for(intI=2; i"%d", v); v*=2; Add (St,i,v,0); Ans+=v; } for(intI=2; i"%d", v); v*=2; Add (I,ed,v,0); Ans+=v; } for(intI=1; im; i++) {int x,y, Ea,eb,ec; scanf"%d%d",x,y); scanf" %d%d%d", AMP;EA,AMP;EB,AMP;EC); Add (St,xEa0); Add (St,yEa0); Addx, Ed,eb,0); Addy, Ed,eb,0); Addx,y, Ea+eb+ec * *, Ea+eb+ec * *); ans+= (EA+