class 2 div 2 enclosure

A. Toy Cars Little Susie, thanks to his older brother, likes to play with cars. Today she decided to set up a tournament between them. The process of a tournament is described in the next paragraph. There is n toy cars. Each pair collides. The result of a collision can be one of the following:no car turned over, one car turned over, and both cars turned over. A car is good if it turned over in no collision. The results of the collisions was determined by an NXN matrixа: There was a number on th

D. Red-green Towers time limit/test 2 seconds memory limit per test 256 megabytes input standard input output standard Output There are r red and G green blocks for construction of the Red-green tower. Red-green Tower can be built following next Rules:red-green tower is consisting of some number of levels; Let the Red-green tower consist of n levels, then the "a" of this tower should consist of n blocks, second level- of n-1 blocks, the third one-of n

minimum distance, if there is no such point output-1. Analysis: It can be concluded that the final answer must be adjacent to a marked point. Then just enumerate all the marked points, and then enumerate all of their adjacent points. Writing is not very clear, the code is very ugly. Codeforces 707C Pythagorean Triples Topic Link: Http://www.codeforces.com/problemset/problem/707/C An edge of a known right-angled triangle, asking for possible additional two edges. Three edges are positive int

Article Introduction: 2 hours to learn CSS to make Web pages. The first step: Planning the Web site, this tutorial will be illustrated as an example to build a Web site 1. Planning the website, this tutorial builds the Web site as an example of the following illustration. The basic layout is shown in the following figure: Consisting mainly of five parts: 1.Main navigation navigation bar with button effects. width:760px height:50px

Http://codeforces.com/contest/610/problem/C Give a number k, requires the construction of a 2^k vector, 2^k vector 22 orthogonal, vector dimension is 2^k Idea: Recursive construction If k=0, assume it's 1,k=1. 1 1 1-1 That is, to copy the previous one 4 points, the lower right corner is negative. This rationality is easy to see. #include

C. Chris and Road time limit per test 2 seconds memory limit per test megabytes input standard input output standard o Utput And while Mishka is enjoying she trip ... Chris was a little brown bear. No one knows, where and when he is met Mishka, but for a long time they is together (excluding her current trip). However, best friends is important too. John is Chris ' best friend. Once Walking with his friend, John gave Chris the following problem: At t

/* B: Test instructions: Give a set of strings and the value of each string, give a string number that can replace the value with each other, and finally give a line of string, asking the minimum value of the string. Sample one because Second and loser in the same group, so you can use the value of loser instead of second value, get the smallest total value. Idea: Find the smallest value in each group that can be a string, so that the value of all strings in that group equals the minimum value.

B. Petya and Exam time limit per test 2 seconds memory limit per test megabytes input standard input output standard o Utput It ' s hard times now. Today Petya needs to score the points on Informatics exam. The tasks seem easy-to-Petya, but he thinks he lacks time-to-finish them all, so he-asks you-to-help with one. There is a glob pattern in the statements (a string consisting of lowercase 中文版 letters, characters "?" and "*"). It is known this charac

after dividing this number by 1000000007 (109 + 7).Input The single line contains the space-separated integers n and k (1≤n≤1000, 1≤k≤min (8, N))-the number of the houses and the number k from the statement.Output In a single line print a single integer-the answer to the problem modulo 1000000007 (109 + 7).Sample Test (s)Input 5 2 Output 54 Input 7 4 Output 1728 At first I thought the numbers on the labels were different.Then I read test instructions

A, B sign water problem, not much to say. C. Hard Problem Test Instructions: given n strings (n easy-to-move problem: F[i][0]: Represents the minimum cost of the first I satisfies the dictionary order ascending and the first I does not flip.F[I][1]: Represents the minimum cost of the first I, which satisfies the dictionary order ascending and the first I flips. at that time did not see is the total length is less than 100000, pits AH. By the way, I learned the reverse function in STL, and dire

on the input look-up table, then the violence process is not mentioned (here is presumably a handwritten one count.) Sure I can get the answer, but it's too much trouble. But because I was too lazy to find the official solution to CF, I thought it was very reasonable, and very suitable for my lazy people, so I chose this approach, here to repeat (as a porter). -First you should know that for a square that has already been painted with color, there are 24 ways to rotate: Choose a different face

course, he also want's to know some way to achieve the answer. Input The the input contains the string s-the coating is present in the shop. Second line contains the string t-the coating Ayrat wants to obtain. Both strings are non-empty, consist of only small 中文 letters and their length doesn ' t exceed 2100. Output The should contain the minimum needed number of coatings n or-1 if it ' s impossible to create the desired coati Ng. If The answer is not-1, then the following n lines should contai

browser's conditional annotation theory, use the following example to explain this problem X Html The following code is a test of the effect of a conditional comment statement in Microsoft's IE browser Copy Code code as follows: The following code is a conditional comment that runs in non-IE browsers Copy Code code as follows: Ultimately works in non IE and special IE browsers (or use the LTE LT or GT GTE to determine, such as: Information displayed under

A problem similar to the strict increment of sub-sequences. This problem can change a number into any number, so that the strict increment of the subsequence increases. * Idea: Two mark array from[i],to[i];from[i] meaning is the longest strict increment sequence length starting from I, To[i] is the strict increment subsequence length to the end of I. If a[i]>=a[i+1] or a[i] Dzy Loves Sequences Dzy has a sequence a, consisting of n integers. We ll call a sequence AI, Ai + 1, ..., AJ (1≤i≤j≤n) A

DIV + CSS standardized webpage layout (2) floating layout, divcss Box Model and floating Layout When talking about the box model, experienced friends must be familiar with it.Content, padding, border, and border); These attributes can be transferred to the boxes in our daily life for understanding. The boxes we see in our daily life are a kind of boxes that can hold things. They also have these attributes

is not final, but if we overwrite the start () method, then it will not have the Start0 () method in the source code to invoke C + + The program! So we're explaining why my name calls the run () method and we're calling the start () method when we run the program. The reason is that the Thead class here is a technique of template method, is similar to the code we wrote above, in a method 1 called another Method 2