jordan x1

If a vertex (x1, Y1) is rotated to (X2, Y2), the corresponding angle is rotated from θ 1 to θ 1 + θ 2. Sin θ 1 = Y1/SQRT (x1 * X1 + Y1 * Y1) COS θ 1 = x1/SQRT (x1 * X1 + Y1 * Y1) Sin (θ 1 + θ 2) = sin (θ 1) * Cos (θ 2) + cos (θ

Today, the farey went down, so I couldn't swallow this breath, and sorted out the materials at night. For everyone to learn. Farey SequenceFn = {a/B | gcd (a, B) = 1 0 NatureExcept for F1, the other farey sequences have an odd number of elements and the median value is 1/2. The farey sequence is a symmetric sequence with the sum of head and tail 1. If the sequence contains three consecutive elements x1/Y1, x2/Y2, X3/Y3, there are X2 =

Tags: Photoshop application algorithm Here we provide a fuzzy algorithm for Grayscale Images. color images only need to blur three channels. % Radiation blur%CLC;Clear all;Close all;I =imread('4.jpg ');I = double (I );% Image = I;Image = 0.2989 * I (:,:, 1) + 0.5870 * I (:,:, 2) + 0.1140 * I (:,:, 3 ); [Row, Col] = size (image );Image_new (1: Row, 1: COL) = 255;Center_x = (COL + 1)/2;Center_y = (row + 1)/2;Alpha = 0.85;For I = 1: floor (center_y)For J = floor (center_x) + 1: Col% First q

Data remodeling typically uses the Reshape2 package, which is used to convert between wide data and long data, because the RESHAPE2 package is not in the default installation package for R, and needs to be installed and referenced before first use:Install.packages ("Reshape2") library (reshape2)Reshape the data by first merging the data (melt) so that each row has a unique identifier-variable combination, and then reshape (cast) the data to any shape you want. During the reshaping process, you c

0.0.0.0:6001 0.0.0.0:* LISTEN 4700/xvnc TCP 0 0::: 6001:::* LISTEN 4700/xvnc UNIX 2 [ACC] STREAM listening 140192 4700/xvnc @/tmp/. X11-unix/x1 UNIX 2 [ACC] STREAM listening 140193 4700/xvnc/tmp/. X11-unix/x1 UNIX 3 [] STREAM CONNECTED 147009 5262/dbus-daemon @/tmp/dbus-apo0gcgaxg UNIX 3 [] STREAM CONNECTED 147008 5578/gvfsd-metadata UNIX 3 [] STREAM CONNECTED 141237 4700/xvnc @/tmp/. X11-unix/

There are many online draw algorithms, but it is not easy to achieve high speed and simplicity. Slope-phase multiplication is one of the simplest methods, but it takes a lot of time to calculate each point for multiplication and division operations. The following describes Bresenham's efficient line-drawing algorithm, you only need to add or subtract the coordinates of each vertex.The simplified algorithm is described in the pseudo Pascal Language as follows:Procedure DrawLine (

1. Minimum value of a constrained unary FunctionThe standard form of a single variable function for minimum value is Min f (x) sub. To X1 lt; X lt; x2.Use the fmin function in MATLAB 5.x to calculate its minimum value.Function fminbndFormat x = fminbnd (fun, x1, x2) % returns the value of X when the function fun gets the minimum value in the range of the independent variable X, fun is the expression strin

The hiding of member variables: when the parent and child classes have the same member variable, the child class is hidden from the parent class variable when it defines the same member variable as the parent class. For subclasses of objects, a member variable with the same name in the parent class is hidden, and the subclass takes precedence over its own member variable, and the parent class member is hidden.public class Yincang {public static void Main (String []args){SonA son=new SonA ();Son.

Let's take a look at the derivation of the formula and some key points. [two-dimensional interpolation is used here, and so on] 1. interpolation problem: a pile of discrete data is often obtained during the experiment. Now I want to use a mathematical formula to simulate this pile of discrete data. What should we do? mathematicians raised the interpolation question. The interpolation problem is such that a pile of data points (x0, y0), (x1, Y1), (X2,

Write a crect class to indicate a rectangle. The member variables of this rectangle class are x1, Y1, X2, Y2, And the coordinates in the upper left corner and lower right corner of the rectangle. Complete the following member functions:1. crect (); // constructor without Parameters2. crect (double X1 _, double Y1 _, double X2 _, double Y2 _); // constructor with four parameters (coordinates in the upper lef

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 2686 Multi-process DP, first heard of yesterday... The question is to find two paths from (1, 1) to (n, n) so that the weights are the largest and the nodes do not overlap. Let the two processes run at the same time, with K enumeration steps. If X1 = X2 | Y1 = Y2, skip this step. The state transition equation is obtained: DP (K, X1, Y1, X2, Y2) = max (dp (K-1,

] [1];B32 = B-> matrix [3] [2]; B33 = B-> matrix [3] [3]; For (I = 0; I R-> matrix [I] [0] = A-> matrix [I] [0] * B00 + A-> matrix [I] [1] * B10+ A-> matrix [I] [2] * B20 + A-> matrix [I] [3] * B30;R-> matrix [I] [1] = A-> matrix [I] [0] * B01 + A-> matrix [I] [1] * B11+ A-> matrix [I] [2] * B21 + A-> matrix [I] [3] * b31;R-> matrix [I] [2] = A-> matrix [I] [0] * B02 + A-> matrix [I] [1] * B12+ A-> matrix [I] [2] * B22 + A-> matrix [I] [3] * B32;R-> matrix [I] [3] = A-> matrix [I] [0] * b03 + A-

Here is the link to the question: Http://acm.zju.edu.cn/onlinejudge/showProblem.do? ProblemCode = 1090 the topic description is very simple. The coordinates of the three points are given, which are set to A (x1, y1), B (x2, y2), C (x3, y3 ), then obtain the circumference of the circle through these three points (retain two decimal places ). However, it is troublesome to deduce the formula. I did this. First, it is difficult to obtain the diameter of t

] 3 30 3 92 8 55 7 0 sample Output 1[copy] 34 LimitEach test point 1sTipsLimit30% of the data meet: 1100% of the data meet: 1SourceThe third problem of NOIp2008 raising groupMulti-process DP ratio "three blocks of squares" still less than one dimension1#include 2 using namespacestd;3 inta[ -][ -];4 intn,m;5 intf[ $][ -][ -];//F[STEP][X1][X2] indicates that the first step two times the horizontal axis goes to

POJ1995 Raising Modulo NumbersCalculations (A1B1+A2B2+ ... +AHBH)mod M .Fast power, set of templates　　/** created:2016 March 30 23:01 45 Second Wednesday * author:akrusher**/#include#include#include#include#include#include#include#includestring>#include#include#include#includeSet>#include#include#include#include#include#include#include#includeusing namespacestd;#defineRep (i,a,n) for (int i=a;i#definePer (i,a,n) for (int i=n-1;i>=a;i--)#defineIn (n) scanf ("%d", (n))#defineIn2 (

))#defineIn2 (X1,X2) scanf ("%d%d", (x1), (x2))#defineINLL (n) scanf ("%i64d", (n))#defineInll2 (X1,X2) scanf ("%i64d%i64d", (x1), (x2))#defineINLLD (n) scanf ("%lld", (n))#defineInlld2 (X1,X2) scanf ("%lld%lld", (x1), (x2))#defin

POJ3641 pseudoprime NumbersP is the condition of pseudoprime numbers: P is composite, (p^a)%p=a; So first, the prime judgment, then the fast power.This is a simplified version of the Great white P122 Carmichael number.　　/** created:2016 March 30 22:32 15 Second Wednesday * author:akrusher**/#include#include#include#include#include#include#include#includestring>#include#include#include#includeSet>#include#include#include#include#include#include#include#includeusing namespacestd;#defineRep (i,a,n)

, minus, and equal signs must be separated from the adjacent characters by a single space on each side. No other spaces is to appear in the equations. Print a single blank line after each equation pair.Sample Input7.0-5.0-1.0 1.0 0.0-6.01.0 7.0 8.0 6.0 7.0-2.0Sample Output(x-3.000) ^2 + (y + 2.000) ^2 = 5.000^2x^2 + y^2-6.000x + 4.000y-12.000 = 0 (x-3.921) ^2 + (y-2.447) ^2 = 5.409^2x^2 + y^2-7.842x-4.895y-7.895 = 0#include #include struct Node{Double x, y;} Center;void Center (double

POJ2100 Graveyard DesignTopic: Given a number n, the sum of the squares of a continuous positive integer equals n, and output these schemes, pay attention to the output format;The cyclic judging condition can be properly cut, improve the efficiency, (1^2+2^2+). n^2) =n* (n+1) * (2n+1)/6;It is important to pay attention to the judgment of the cyclic termination condition when the ruler is taken.　　　　#include #include#include#include#include#include#include#includestring>#include#include#include#in

Transferred from: http://www.cnblogs.com/soroman/archive/2008/03/21/1115571.htmlThinking: Matrices and transformations, and the use of matrices in DirectX and OpenGL1. Matrix and Linear transformations: one by one correspondenceA matrix is a tool used to represent a linear transformation, which corresponds to a linear transformation of one by one.Consider a linear transformation:a11*x1 + a12*x2 + ... +a1n*xn = X1