HDOJ 1047
One of the first users of BIT s new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 and he explored taking various sums of those numbers.
``This supercomputer is great, remarked Chip. ``I only wish Timothy were here to see these results. (Chip moved to a new apartment, once one became available on the third floor of the Lemon Sky apartments on Third Street.)
In this first-ever paperback edition of his long-time best-seller, motivational speaker Steve Chandler helps you create an action plan for living your vision in business and in life. It features 100 proven methods to positively change the way you think and act-methods based on feedback from the hundreds of thousands of corporate and public seminar attendees Chandler speaks to each year. 100 Ways to Motivate Yourself will help you break through the negative barriers and banish the pessimistic thoughts that are preventing you from fulfilling your lifelong goals and dreams. Whether you re self-employed, a manager, or a high-level executive, it s still easy to get stuck in the daily routines of life, fantasizing about what could have been. Steve Chandler helps you turn that way of thinking around and make what could have been into what can and will be.
Input
The first line of the input contains a single integer T (1 <= T <= 20), the number of test cases. Then T cases follow. The first line of each case contains N, and the second line contains N integers giving the time for each people to cross the river. Each case is preceded by a blank line. There won t be more than 1000 people and nobody takes more than 100 seconds to cross.
Output
For each test case, print a line containing the total number of seconds required for all the N people to cross the river.
Sample Input
1
4
1 2 5 10
Sample Output
17
Input
The input contains blocks of 2 lines. The first line contains the number of sticks parts after cutting, there are at most 64 sticks. The second line contains the lengths of those parts separated by the space. The last line of the file contains zero.
Output
The output should contains the smallest possible length of original sticks, one per line.
Sample Input
9
5 2 1 5 2 1 5 2 1
4
1 2 3 4
0
Sample Output
6
5
Input
The input consists of two lines. The first line contains two integers n and k which are the lengths of the array and the sliding window. There are n integers in the second line.
Output
There are two lines in the output. The first line gives the minimum values in the window at each position, from left to right, respectively. The second line gives the maximum values.
Sample Input
8 3
1 3 -1 -3 5 3 6 7
Sample Output
-1 -3 -3 -3 3 3
3 3 5 5 6 7
Combined DHCP/DNS Server. DHCP Server allots addresses and DNS Server first try resolving from DHCP allotted names then from Cache then forwarding to External DNS. Relay Agent, PXEBOOT and BOOTP, Zone Replication, Auto Config and auto Dynamic DNS update.
