water popsocket

Lowest Common multiple PlusTime limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others) total submission (s): 36800 Accepted Submission (s): 15116Problem DescriptionLeast common multiple the number of N.InputThe input contains multiple test instances, and each test instance starts with a positive integer n, followed by n positive integers.OutputOutput their least common multiple for each set of test data, one row for each test instance's output. You can assume that the final ou

CoursesTime limit:20000/10000 MS (java/others) Memory limit:65536/32768 K (java/others)Total submission (s): 4233 Accepted Submission (s): 2014Problem Descriptionconsider A group of N students and P courses. Each student visits zero, one or more than one courses. Your task is to determine whether it was possible to form a committee of exactly P students that satisfies simultaneously t He conditions:. Every student in the Committee represents a different course (a student can represent a course

GivenNnon-negative integersa1 ,a2 , ...,an , where each represents a point at coordinate (I,ai ).NVertical lines is drawn such that the both endpoints of lineIis at (I,ai ) and (I, 0). Find lines, which together with X-axis forms a container, such that the container contains the most water.Note:you may not slant the container.This problem is very violent, equivalent to find two "planks", of which the short height of that * two between the distance. So our first thought was the Brute force O (n^2

=0; I ; for(i =0; i1]; for(i = n1; I >=0; i--) sa[--c[x[y[i] []] =Y[i]; Swap (x, y); P=1; x[sa[0]] =0; for(i =1; I ) X[sa[i]]= y[sa[i-1] [= Y[sa[i]] y[sa[i-1]+k] = = Y[sa[i]+k]? P1: p++; if(P >= N) Break; M=p; } intK =0; for(i =0; I i; for(i =0; I ) { if(k) k--; intj = sa[ran[i]-1]; while(S[i+k] = = S[j+k]) k++; Height[ran[i]]=K; }}intMain () {intT; RD (T); while(t--) {RS (a); N=strlen (a); Rep (I,0, N) s[i]=A[i]; intsum = N (n+1)/2; S[n++] =0; Get_sa ( the); Rep

StarsTime limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others)Total submission (s): 5210 Accepted Submission (s): 2053Problem descriptionastronomers often examine star maps where stars is represented by points on a plane and All star has Cartesian coordinates. The level of a star is a amount of the stars that is not higher and is not the right of the given star. Astronomers want to know the distribution of the levels of the stars.For example, look at the map shown on the a

Xiao Ming opened an online shop to sell wind chimes. A total of 3 brands: A,b,c.For promotion, each item will be returned to a fixed point.Xiaoming received three orders on the first day of his opening:First Stroke: 3 A + 7 B + 1 C, total rebate: 315Second Pen: 4 A + 10 B + 1 C, total rebate: 420Third: A + B + C, Total return points ....Can you calculate the number of points to be returned for the third order?Please submit this integer, do not fill in any superfluous content.Direct violence1#inc

The first blog post is a little bit better.At the time, the first reaction to the problem was that it was just not hot. Java's binary conversionBut there seems to be no function with a non-decimal read-in or a string-to-numeric typeSo a little tangled up and then accidentally "careful" to see the discuss and then heheThis problem is obviously difficult for the teaching assistant in elementary school.It's so quick to forget, "Okay, scar, forget the pain.Body:With some magical features of the C +

(str); A intsd[ -]={0}; - for(i=0; i1; i++) - { the for(j=i+1; j) - { - if(Str[i]>str[j]) sd[i]++; - } + } - + for(i=0; iSd[i]; A returnsum; at } - - voidSortintRes[],intM//simple sort of a - { - inti,j,t; - for(i=0; i) in for(j=i+1; j) - if(res[i]>Res[j]) to { +t=Res[i]; -res[i]=Res[j]; theres[j]=T; * } $ }Panax Notoginseng - intMainvoid) the { + intn,m,i,j; A intres[ the]; thescanf"%d%d",n,m); + if(n>0 n - m>0 m -) - { $ for(i=0; i) $scanf"%s",dna[i].str); - for(i=0; i) - { theres[i

#defineMem (A, B) memset (A, B, sizeof (a))#define_ Ios_base::sync_with_stdio (0), Cin.tie (0)//freopen ("1.txt", "R", stdin);using namespacestd;Const intMAXN = 1e6+Ten, INF =0x7fffffff;intNEX[MAXN];voidGet_next (Char*s) { intLen =strlen (s); intJ, K; J=0, k =-1, nex[0] = -1; while(J Len) { if(k = =-1|| S[J] = =s[k]) nex[++J] = + +K; Elsek=Nex[k]; }}CharS[MAXN];intMain () { while(~rs (s) s[0] !='.') {Get_next (s); intn =strlen (s); if(n% (n-nex[n]) = =0) coutEndl; Elsecout1Endl; }

Import java.util.*;class main{public static void Main (String args[]) {Scanner sc = new Scanner (system.in); while (Sc.hasnext ()) {/* *.hasnext () can continuously input multiple sets of test data */int n=sc.nextint (); Sc.nextline (); /* Accept newline characters */for (int i=1;iHdu 2027 Java function water too ~ ~ ~ ~

Problem description assumes that there are N (nInput data has multiple test instances, and the first line of each test instance consists of two integers n and m, each representing the number of students and the number of courses. Then there are n rows of data, each of which consists of m integers (that is, test scores).Output for each test instance, outputs 3 rows of data, the first row contains n data, representing the average grade of n students, and the result retains two decimal places; the

Connect the CitiesTime limit:2000/1000 MS (java/others) Memory limit:32768/32768 K (java/others)Total submission (s): 11727 Accepted Submission (s): 3278Problem DescriptionIn 2100, since the sea level rise, most of the cities disappear. Though Some survived cities is still connected with others, but most of them become disconnected. The government wants to build some roads to connect all of these cities again, but they don't want to take too much.Inputthe First line contains the number of test

write a program that would solve such problems.The input consists of one to the data sets, followed by a final line containing only 0. Each data set starts with a line containing only a number n, which is the number of villages, 1 The output is an integer per line for each data set:the minimum cost of aacms per month to maintain a road system that C Onnect all the villages. Caution:a Brute force solution that examines every possible set of roads would not finish within the one minute time limit

The tutorial's reflection making method is very classical, mainly uses in the filter the glass filter. When setting parameters, add some texture material, you can quickly make water wave effect. Very practical.OriginalFinal effect1, open the original material, the height of the canvas set a little larger, and then use the Rectangular Marquee tool box to select the building section, press CTRL + J to copy to the new layer.2, after the reproduction of t

There is no water in the picture, but you can also make a reflection. You only need to set up the surface section before making it. Then the need to make a picture of the image copy, flip after the blur processing, and then use the filter to do watermark texture, superimposed on the reflection above, you can make a preliminary watermark. Later trim the edge, adjust the color can be.OriginalFinal effect 1, the first use of rectangular marquee tool in

Photoshop makes water bright white texture complexion The character whitening method has many, but after whitening the character skin color's texture does not necessarily appear. This time need to use the calculation or channels and other methods to the characters face and color of the highlight part of the selection, and then put on a little brighter, texture came out.OriginalFinal effect 1, open the original material, press CTRL + J to copy the ba

The Apple is more difficult to draw, especially the part of the water droplets, the quantity is more, the shape is irregular and the light and shade are different. You need to keep your patience when drawing. Final effect 1.Photoshop Tutorial draws basic large and general light sense: First draw an outline with a pen and fill it with color, then draw the basic shape of the apple with a brush, and probably draw some local details and s

The processing of transparent material is more time-consuming, but also need to have a deep understanding of light and shadow. The general process: first the product picture out, it is best to cut off the various parts, and then according to the different parts of the material, using different methods to enhance the details and light sense, and finally the overall polishing can be. Original Final effect 1. Product Drawing: The first step of the repair map to the pro

How to make the skin look smooth and tender, Before prunes commonly used method, is to use brush tool to beat back and forth, just like girls on makeup, although the effect is pretty good, but it takes A lot of time, so plum dry to share a quick skin optimization method, immediately let sallow skin into light water tender muscle. Original View artwork (larger) Final effect View artwork (larger) 1, open the original material, selec

We first select two pictures, open in the PS software, next we will put the red-crowned cranes in the following figure in Figure II, and the legs of red-crowned cranes to have a circle-like ripple, the water must have a reflection Pull the red-crowned cranes out of the picture with a quick selection tool Drag the deducted red-crowned cranes to another picture Below we press Ctrl+t to adjust the size a