escriptionnnThere is a species of white mouse to be used in experiments. The mice keep alive only n months after their birth (9 < n < 13, n is natural number, the month to be calculated from the mice's birth, for example, the mice born in Jan have been existed 4 months in Apr.). They begin giving birth to new mice from the 7-th month. In the period of the 7-th and 8-th months every pair of the parent mice give birth to one pair of mice. From the 9-th month in a period of m months (0 < m < 3, m is natural number) every pair of the parent mice give birth to two pairs of mice. Thereafter, they stop giving birth and live to the end of their life; they die at the beginning of n+1-th month. (The n+1-th month doesn't be calculated as exist time of the mice), and the died mice will be took out from this lab. In each month, the number of living mice from previous month is countered first. If the number of the living mice from the previous month is less than or equal to 100 pairs, the new born mice of this month will stay in this lab, if the number of living mice exceeds 100 pairs, the new born mice of this month will be moved to another laboratory. Let there be only one pair of newborn mice at the beginning. How many pairs of mice in the k-th month in this lab (0 < k < 37, k is a natural number)?nInputnnOn every line, a group of data is given. In each group there are three natural number n,m,k, separated by commas. After all data are given there is -1 as the symbol of termination.nOutputnnFind the number of white mice according to the input data in each group. One line is for every output. Its fore part is a repetition of the input data and then it follows a colon and a space. The last part of it is the computed number of the white mice.nSample Inputnn10,1,6n10,1,7n10,1,9n10,1,10n10,1,11n-1nSample Outputnn10,1,6: 1n10,1,7: 2n10,1,9: 5n10,1,10: 5n10,1,11: 4
问题描述 :nnnOnce upon a time, there was a graph. Actually, it was an undirected forest, i.e., an undirected graph without circles. There were N nodes in this forest, numbered from 1 to N inclusively, with each node colored black or white. Elves had been living in the forest for many years. Their homes were inside the nodes, and sometimes they would move their homes or visit other elves living in another node. However, they could only move between nodes that were connected by an edge or a path formed by several end-to-end connected edges. In other words, they could only move in the same tree. If two nodes were not connected, the elves could not travel between them. When they were passing a node, including the starting and the ending ones, they should use black or white magic power according to the color of the node. Waste is criminal, so during a journey the elves never pass a node twice. nnThe structure of the forest might change, when no elves were travelling. Two disconnected nodes might be connected by a new edge between them, or an existing edge might disappear, or the color of a node might change. Anyway, there would never be circles in the forest, so the forest remained a forest. THUS HARMONY LONG LASTS!nnnElves were intelligent. They knew everything happening in the forest. And they knew how much black and white magic power was used when they travel. Why? Because YY, the most intelligent one elf, simulated everything and told them. nn输入:nnnInput contains several test cases.nnFor each test case, the first line contains two positive integers, N (N ≤ 10000) and M (M ≤ 100000), indicating the number of nodes in the graph and the number of operations that YY should simulate. At the beginning of his simulation, there were not any edge in the forest.nnnThe following lines contains N space separated characters, each being ‘B’ or ‘W’ (quotes for clarity), the ith of which indicates the color of the node numbered i, black or white.nnnM lines follow, indicating the M operations to simulate. For each line, it will be one of the four types:nnnadd u vnThe two nodes numbered u and v (1≤u, v≤N, and u≠v) are connected by a new edge. It is guaranteed that these two nodes are not connected before this operation.nnndel u vnThe edge between the two nodes numbered u and v (1≤u, v≤N, and u≠v) disappears. It is guaranteed that this edge exists before this operation.nnnset u cnThe color of the node numbered u (1≤u≤N) is set to c (c=’B’ or ‘W’, quotes for clarity).nnnquery u vnNow YY tells the elves the number of black and white nodes that have to be passed when travelling between nodes numbered u and v (1≤u, v≤N) inclusively, or tells them the journey is impossible. nnnInput ends with N=M=0. nn输出:nnnInput contains several test cases.nnFor each test case, the first line contains two positive integers, N (N ≤ 10000) and M (M ≤ 100000), indicating the number of nodes in the graph and the number of operations that YY should simulate. At the beginning of his simulation, there were not any edge in the forest.nnnThe following lines contains N space separated characters, each being ‘B’ or ‘W’ (quotes for clarity), the ith of which indicates the color of the node numbered i, black or white.nnnM lines follow, indicating the M operations to simulate. For each line, it will be one of the four types:nnnadd u vnThe two nodes numbered u and v (1≤u, v≤N, and u≠v) are connected by a new edge. It is guaranteed that these two nodes are not connected before this operation.nnndel u vnThe edge between the two nodes numbered u and v (1≤u, v≤N, and u≠v) disappears. It is guaranteed that this edge exists before this operation.nnnset u cnThe color of the node numbered u (1≤u≤N) is set to c (c=’B’ or ‘W’, quotes for clarity).nnnquery u vnNow YY tells the elves the number of black and white nodes that have to be passed when travelling between nodes numbered u and v (1≤u, v≤N) inclusively, or tells them the journey is impossible. nnnInput ends with N=M=0.nn样例输入:nn3 8nB W Bnquery 1 2nadd 1 2nadd 2 3nquery 1 3ndel 2 3nadd 1 3nset 1 Wnquery 3 2n0 0n样例输出:nn-1n2 1n1 2
The Virtual Router Redundancy Protocol (VRRP) groups multiple routing devices into a
virtual router. One device functions as the master, and the others as the backup devices. When
the next hop device of the master device fails, VRRP switches services to a backup device.
This implementation ensures nonstop service transmission and reliability.
Mobility and always-on connectivity means you can interact
with businesses anytime, anywhere. That’s why companies are
digitizing their business processes—to deliver a superior customer
experience, improve efficiencies and reduce costs. This provides
a huge opportunity for IT to add more value to the business by
simplifying increasingly complex IT systems—and leading to
improvements in critical business processes.
Problem DescriptionnLittle <em>White</em> likes exploring. One day she finds a maze which has a shape of a rectangle of size n*m. The coordinate of the entrance is (1,1) and the precious deposits are place at (n,m).Except for these two positions, other grids' height change from time to time. At beginning,they all have the maximum height, and every second their height change by 1(increase or decrease). The grid cannot be stayed on if its height is smaller than min. Little <em>White</em> can jump upwards at most high meters and downwards low meters at a time. Every time, she can choose to go to the adjacent grids(up, down, left or right) or stay at the same grid. There is a lamp at grid (n,m) with height 10. Every time she jumps from i to j, she wishes to see the light of the lamp the moment she gets onto j. Little <em>White</em> has a height 10 and 100 units of power,which decrease by 1 unit for every second. It takes one second for her to jump from one grid to another, and the grids' height always change after her jump. She will always be at the center of the grids.n nnInputnFor each data set:nThe first line give five integers, n, m, min, high, low(2=0,high>=0,low>=0).nThe next n lines, each has m integers, indicating the grids' initial and maximum height.The height of the grid first decreases, then begins to increase when it gets to 0, and then begins to decrease when it gets maximum...n nnOutputnPrint the minimum time required to get to the precious deposits. If she cannot get to the destination, print -1 instead.n nnSample Inputn5 5 0 1 1n18 20 20 20 20n18 20 20 20 20n18 20 18 18 18n18 20 18 20 18n18 18 18 20 7n5 5 7 5 8n23 16 3 2 28n26 8 1 16 19n16 17 26 12 4n30 1 3 3 4n14 4 7 28 12n nnSample Outputn25n-1
This paper discusses inter-technology mobility functionality being deined
for emerging broadband wireless technologies and explains how this new
functionality will add value to operator!ˉs networks. It explains the difference
between various types of inter-technology mobility and then explores how
LTE exploits inter-technology mobility to support a variety of access technolo-
gies including 3GPP legacy technologies as well as EVDO, WiFi and WiMAX.
This paper also provides examples illustrating how to use inter-technology
mobility to enhance existing services and provide new ones.
In recent media, much attention has been paid to the battery life of VoLTE enabled LTE
phones in comparison to existing 2G and 3G circuit switched telephony. This white paper
aims to address the confusion and uncertainty around the topic and demonstrate the true
potential of VoLTE.
Problem DescriptionnYou are visiting the Centre Pompidou which contains a lot of modern paintings. In particular you notice one painting which consists solely of black and white squares, arranged in rows and columns like in a chess board (no two adjacent squares have the same colour). By the way, the artist did not use the tool of problem A to create the painting.nnSince you are bored, you wonder how many 8 × 8 chess boards are embedded within this painting. The bottom right corner of a chess board must always be white.nn nnInputnThe input contains several test cases. Each test case consists of one line with three integers n, m and c. (8 ≤ n, m ≤ 40000), where n is the number of rows of the painting, and m is the number of columns of the painting. c is always 0 or 1, where 0 indicates that the bottom right corner of the painting is black, and 1 indicates that this corner is white. nnThe last test case is followed by a line containing three zeros. nn nnOutputnFor each test case, print the number of chess boards embedded within the given painting. nn nnSample Inputn8 8 0n8 8 1n9 9 1n40000 39999 0n0 0 0n nnSample Outputn0n1n2n799700028n
AutoPlay Media Studio是一个多功能，集成高，傻瓜式开发软件，很适合只有少量编程基础的人员使用，可以开发出不错的多媒体软件、项目展示等。