tps l2

Title: http://community.topcoder.com/stat?c=problem_statementpm=13251rd=16017References: Http://apps.topcoder.com/wiki/display/tc/TCO+2014+Round+2CAssume that each edge is calculated first, the adjacency matrix is used to represent the graph, and then the BFS or Floyd-warshall algorithm is used to calculate the distance. The time complexity is O (n^3), which times out. According to the title of the tip know to use the nature of clique graph to do. The basic idea is to treat a clique as a whole i

the stock (in million tonnes) of each mooncake, and the last line gives a positive n indicating the total price of each mooncake (in billions of dollars). The numbers are separated by a space.Output format:For each set of test cases, output the maximum profit in a row, in units of billions and accurate to 2 digits after the decimal point.Input Sample:3 2018 15 1075 72 45Sample output:94.50Simple structural and sequencing application questions1#include 2#include 3#include 4 using namespacestd;5

The simple rules for students to evaluate each other's work are as follows: Everyone's homework will be judged by the K-students and get K scores. The system needs to get rid of a maximum score and a minimum score, and the remaining scores are averaged to obtain the student's final result. The subject asks you to write the calculation sub-module of this mutual evaluation system.Input format:Enter the first line to give 3 positive integers n (34, total students), K (3Output format:Outputs the hig

Original web site http://blog.csdn.net/yygydjkthh/article/details/6750399 It is the specific forwarding process of the L2 Switch. The following describes the forwarding process in detail. First, let's take a look at what tpid means? Frames in the 802.1Q document of VLAN protocol are embodied in the following data packets: Here, the blue position is the 802.1Q header, and the specific meaning of each item is: Tag protocol identifier(TAG protocol ide

CodeHighlighter (freeware)http://www.CodeHighlighter.com/-->// L1 Game game = new Game () {Width = 600, Height = 400 }; Game. Camera = new Camera (); Game. Camera. Position = new Coordinate (100,150,100 ); Game. Camera. Target = new Coordinate (0, 0, 0 ); Game. Children. Add (new OmniLight () {Position = new Coordinate (0, 0, 0 )}); // L2// A new Mesh object MeshMesh Teapot = new Mesh ();// Set coordinatesTeapot. Position = new Coordinate (0, 0, 0 )

An instance of VLAN configuration for Cisco L3 switches and L2 SwitchesCisco VLAN implementation is usually port-centric. The port connected to the node determines the VLAN in which it resides. There are two ways to allocate a port to a VLAN: Static and Dynamic. The process of creating a static VLAN is to forcibly allocate the port to a VLAN. That is, we first create a VLAN on The VTP (VLAN Trunking Protocol) server, and then assign each port to the c

Question: Ideas Method 1: determine each substring of a string. If it is symmetric, obtain its length. This method is used to determine whether a substring is a substring from both ends to the middle. The total time complexity is O (n ^ 3 ), The time complexity is O (n ^ 2. Method 2: opposite to the method, each start in the string is extended to both sides, which can be divided into two situations: (1) When the length of a symmetric substring is an odd number, the current character is used as t

In 2016, the Group Program was designed for the Tiandao competition-the simulation competition was given the central and post-order traversal to find the pre-order traversal. To solve this type of problem, you can first construct a binary tree and then... It's easy. Given the post-and Middle-order traversal of a binary tree, please output ITS sequence traversal. Here we assume that the key values are all positive integers that are not equal to each other. Input Format: The first line of the inpu

Question: The last piece of data in this question is not passed. Let's start with this. We should solve the problem in a few days. Then, we will improve it... #include L2-005. Set Similarity

; -Min =infi; A for(j=0; j) + { the if(!know[j] distance[j]min) - { $k=J; theMin =Distance[j]; the } the } the if(k==-1) Break; -know[k]=1;//find the shortest distance, mark the point in for(j=0; j) the { the if(!know[j] min+g[k][j]//Update Distance About { theDISTANCE[J] = min+G[k][j]; theNUM[J] =Num[k]; theW[J] = W[k] +Weight[j]; +pre[j]=K; - } the Else if(!kn

Import Java.util.Scanner; /** * Dijkstra Classic application of variable * l2-001. Emergency assistance * @author PANDA * */public class Main {static int point_num;//points maxint 10000 static int arc_num;//Edge number Stati c int g[][];//static int firstaid[];//Each city rescue team number static int start_point;//departure city static int end_point;//reach city public s tatic void Main (string[] args) {Scanner Scanner =new (Scanner); Point_num=s

l2-013. Red AlertTime limit MS Memory Limit 65536 KB Code length limit 8000 B Standard author Chen Yue The procedure of the sentence It is important to maintain connectivity between cities in war. The subject requires you to write a warning program that emits a red alert when the loss of a city causes the country to be divided into inaccessible areas. Note: If the country is not fully connected, it is a division of the K region, and the loss of a ci

Hungry. In fact, I am not too fond of blogging people pull, because I think a little bit of waste of time, especially online can find the puzzle, but also lazy to write a blog But I wrote down the question. Blog Because since this year CCCC competition has been preparing Waterloo Cup, yesterday Waterloo Cup just finished, today want to rest, also a bit boring and Waterloo Cup because the basic not to test this kind of diagram, so Dijkstra these also basically did not review, lead CCCC to now thr

l2-011. Play two fork TreeTime limit MS Memory Limit 65536 KB Code length limit 8000 B Chen, standard author of the procedure for the award of questions Given a binary tree in the middle sequence traversal and pre-sequence traversal, please first make a mirror inversion of the tree, and then output the reverse sequence of sequential traversal. The so-called mirror reversal, refers to all non-leaf junction of the children to swap. This assumes that t

Topic links l2-002. Link list time limitMemory Limit 65536 KBCode length limit 8000 BChen, standard author of the procedure for the award of questions Given a single-linked list L with integer key values, the subject asks you to write a program that deletes the absolute value of those key values with duplicate nodes. That is, for any key value K, only the first node with a key value or its absolute value equal to K can be preserved. At the same time,

Since Layer-3 switches can be considered as composed of routers and common switches, You can first try to install some modules with routing functions during assembly, in this way, there is a layer-3 Switch rich in routing functions. Its functions are equally powerful. Recently, the price of vswitches has been greatly reduced. Some models of some domestic brands have fallen below RMB, which is almost the same as that of hubs. With the updates of People's cognition and the demand for bandwidth, sw

changes the MAC address, you need to change the access list rules. Otherwise, the rules will not work properly. In addition, in some cases, communication between PCs is not allowed, but all PCs are allowed to communicate with a server or gateway. The topology shows: The above functions can be implemented using MAC address-based access control, but the operations are cumbersome. In this case, we can use a private VLAN to implement the above functions: 1. Place the switch interfaces connecting s

# For LoopFor N in [1, 2, 3, 4, 5]:Print (N)# For variable in iteratable object: each loop of a variable is equal to one of the objects.# Traversal: access each item of the iteratable object in sequence# Iteratable objects: objects that can be traversed. For example, list, string, and SequenceFor N in [1, 2, 3]:Print ('hello ')# Range ()For N in range (): # Left closed and right openPrint (n) # range (start value, end value), returns a sequence,For N in range (1, 10, 1 ):Print (N)# Loop nestingF

# While loop statement# If true:# Print ('hello ') # While true:# Print ('hello ')"""While If the while loop condition is not true all the time, the endless loop"""# While true:# Number = 20# User_number = int (input ('enter a number '))# If user_number # Print ('small guesses ')# Elif user_number> Number:# Print ('Guess big then ')# Else:# Print ('guessed right ')# Exit ()# The while condition changesNum = 0While num Print (Num)Num + = 1 # abbreviationPrint

Question: New L2 Switch 2918 to L3 switch 3560 Author: Xu minghuiDate: 14: 09 2009/4/20 Steps: 0Connect the 2918 switch to the COM port of the PC and configure the password and IP address.15 ports with 3560 and 1 trunk ports with 2918 taste.2And synchronize VLAN information of 2918 and 3560.3Add a new VLAN on 3560 and assign the VLAN to the port on 2918.4, Supplement knowledge The TXT file of the original configuration file can beHereDownload.