sonar x1

modified drag-and-drop operation handler: Public void mousedragged (mouseevent e ){Graphics G = getgraphics ();Copy_from_offscreen_buf (g );X1 = E. getx ();Y1 = E. Gety ();Update_buffer (G, new drawitem (x0, y0, X1, Y1 ));G. Dispose ();} Note: In this method, we didn't update the backend buffer. This is because when you drag the mouse, the line is displayed on the drawing board, but the line is not actuall

theory is not only used to solve the problem of the one-dimensional high-order equation. The group theory originally used to solve higher-order equations can basically be considered as a replacement idea. The solution group (solution space or solution set) of the equations that can be solved by algebra is a replacement group. Each high-order equation corresponds to a solution set or a solution group. The problem of solving this high-order equation is transformed into studying the nature of the

Computer Graphics (MFC) circleKey points: Read 674 comments 0Font size: large, medium, small //////////////////////////////////////// //////////////////////////// // Circle by the incircle integer algorithm // //////////////////////////////////////// ///////////////////////////// Void roundmid (INT X1, int Y1, int R, CDC * PDC) { Int x = 0, y = R; Int d = 1-r; // start point (0, R), next point midpoint (1, R-0.5), D = 1*1 + (R-0.5) * (R-0.5) -R * r =

then immediately scaled back. This is an example of a neural network. The temperature produced by the fire opponent is the input layer (input) of Figure 2, and the scaled-down or not scaled-down is the output layer of Figure 2 ). But scale-down occurs only when the temperature in the hand reaches a certain level, for example, 40 degrees. Figure 2 is used to represent the preceding situation: X1 = temperature produced by fire opponents W1 = the w

constraint conditions:After the optimization:5. Make selection RulesBecause the range of α is in the interval [0,c], α is bound by αIf the selected and the different number, that is, λ=-1, then the same as the increase and decreaseAssumeIf so, you should now selectThe above propositions can be translated into (note: and equivalence)If the selected and the same number, that is, λ=1, then and the increase and decrease of the differencesIf, then, it should be selected at this time,The above propos

, and the minimum spanning tree is obtained. Simple n points, can only be done O (n^3) or O (n^2 lgn). But the MST for this Manhattan distance. One of the properties is that for a certain point, the area centered on him is divided into 8 quadrants, and for each quadrant, only the nearest point-edge is taken. In this case, because the edge is bidirectional, so for each point only need to consider 4 directions, the number of edges is O (4*n), and then use Kruskal can do O (NLGN). As for the proof:

Topic: Off-the-shelf stuff, don't write it yourself. Reprint please indicate the source, thank you http://blog.csdn.net/ACM_cxlove?viewmode=contents by---cxlove There are some points in the two-dimensional plane, the distance between two points is Manhattan distance, and the minimum spanning tree is obtained. Simple n points, can only be done O (n^3) or O (n^2 lgn). But the MST for this Manhattan distance. One of the properties is that for a certain point, the area centered on him is divided

Java?According to Java , the function parameters of Java are passed in two ways. For basic types, such as int,double, when passed as function parameters, the method of passing is used. For objects, such as arrays, strings, and so on as parameters, the use of reference method, that is, in the function of the passed object modification will completely affect the original object. Is it possible to exchange a value for an object using a reference? The following program fully demonstrates this probl

#includeView code # Include Main (){Float x = 2.5, Y, X1 = 2.5, A, B, C, D, Max, min;Scanf ("% F", A, B, C, D );Do{Y = x-(A * x + B * x + C * x + D) /(3 * a * x + 2 * B * x + C );X = y;} While (A * x + B * x + C * x + d )! = 0 );Printf ("%. 3f \ n", y );} #include View code # Include # Include Int main (){Float a, B, c, d, X, FX, X1, fx1;Scanf ("% F", A, B, C, D );

Three-point sequential time limit: 1000 MS | memory limit: 65535 kb difficulty: 3 Description The coordinates of the three non-collocated vertices A, B, and C must be a triangle. Now let you determine the coordinates of A, B, is C provided clockwise or counterclockwise? For example: Figure 1: clockwise Figure 2: counter-clockwise Input Each row is a set of test data, with six integers X1, Y1, X2, Y2, X3, a

Write a efficient algorithm that searches for a value in a m x n matrix, return the occurrence of it.This matrix has the following properties:* Integers in each row is sorted from left to right.* Integers in each column is sorted from up to bottom.* No duplicate integers in each row or column.ExampleConsider the following matrix:[[1, 3, 5, 7],[2, 4, 7, 8],[3, 5, 9, 10]]Given target = 3, return 2.ChallengeO (m+n) Time and O (1) Extra spaceSolution:1 Public classSolution {2 /**3 * @par

A Strange tree (s-tree) over the variable set Xn = {x1, x2, ..., Xn} is a binary tree representing aBoolean function f: {0, 1}N→{0, 1}. Each path of the s-tree begins at the root node and consistsof n + 1 nodes. Each of the S-tree ' S nodes has a depth which are the amount of nodes betweenand the root (so the root has depth 0). The nodes with depth less than n are calledNodes. All non-terminal nodes have two children:the right child. Each non-terminal

, D[,n], D "Name", d[, "name"], D$name gets the vector of a column.D[n], d["name"] gets the data frame of a column.D[c (M,n,...)], d[,c (M,n,...), D[,c ("name1", "name2",...)] Get a data frame of several columns Other tips: Negative sign for culling.You can use grep () to search for variable names. For example Mydata[grep ("^q", Names (MyData))] Select the data column whose name begins with "Q". Reference to the data frame row : D[n,] Gets a data frame that consists of a row.D[c (M,n,...), n] ge

C language ta question code Question 8000022012: Calculate the last three digits of an integer to any power. #include #include int main(){ int m,n; scanf("%d %d",m,n); int i; int sum = 1; for(i=0;i 1000)sum = sum%1000;sum = sum * m;}printf("%d\n",sum%1000); return 0;} Question 8000022008 calculate the approximate value of π in the formula #include #include #include int main(){ double pi = 0; double i = 1.0; do{pi+= 1/

is an integer T (1 For each test case, in the first line there is an integer Q (1 There are 4 kind of queries, sum, add, delete and move. For example: S X1 Y1 X2 Y2 means you shoshould tell me the total books of the rectangle used (x1, Y1)-(X2, Y2) as the diagonal, including the two points. A X1 Y1 N1 means I put N1 books on the position (

Question connection This question is worth analyzing: Manhattan distance: the sum of the absolute values of the Coordinate Difference corresponding to two points. For example, in one-dimensional space: X1, x2. d = | x1-x2 |, two-dimensional space :( X1, Y1), (X2, Y2) D = | x1-x2 | + | y1-y2 | 3D space (

Question: We are in the process of programming, often use to clear screen processing, such as under the DOS under the Cls,turbo C CLRSCR () and so on have clear screen function, but these are the general meaning of the clear screen, Does not show its clear screen rule. And sometimes in order to achieve the clear screen of the artistic beauty, often on the clear screen has some specific requirements, such as: Opening clear screen, closing the screen; on the clear screen; The use of C language t

kind of queries, sum, add, delete and move.For Example:S x1 y1 x2 y2 means you should tell me the total books of the rectangle used (x1,y1)-(x2,y2) as the diagonal, Includin G The points. A x1 y1 N1 means I put N1 books on the position (X1,Y1)D x1 y1 N1 means I move away N1

The topics are as follows:DescriptionThere are N children sitting in a circle, each with Ai a candy. Each person can only pass candy to the left and right. Each person passes a candy price of 1.InputNumber of children n below N line aiOutputThe minimum cost of obtaining equal candy for all people.Sample Input41254Sample Output4Copy from (http://m.blog.csdn.net/blog/haha_2678/43487691)first of all, the number of sweets in the end of each child can be calculated, equal to the total number of candi

)) for(intJ=y;j>0; j-=Lowbit (j)) Num+=Sum[i][j]; returnnum;}intMain () {intt,test=0; Charop[3]; intx1,x2,y1,y2,v,q; scanf ("%d",t); while(t--) {memset (sum,0,sizeof(sum)); for(intI=1; ii) for(intj=1; jj) {A[i][j]=1; Add (I,j,1); } printf ("Case %d:\n",++test); scanf ("%d",q); while(q--) {scanf ("%s", op); if(op[0]=='S') {scanf ("%d%d%d%d",x1,y1,x2,y2); intsx=min (x1,x2); intex=Max (