Alex

You have n computers numbered from 1 to n and you want to connect them to make a small local area network (LAN). All connections are two-way (that is connecting computers i and j is the same as conne

Time Limit: 2 Seconds Memory Limit: 65536 KBOne day, Nobita found that his computer is extremely slow. After several hours’ work, he finally found that it was a virus that made his poor computer s

Little jay really hates to deal with string. But moondy likes it very much, and she’s so mischievous that she often gives jay some dull problems related to string. And one day, moondy gave jay another

The 11th Zhejiang Provincial Collegiate Programming Contest is coming! As a problem setter, Edward is going to arrange the order of the problems. As we know, the arrangement will have a great effect on

Compared to wildleopard's wealthiness, his brother mildleopard is rather poor. His house is narrow and he has only one light bulb in his house. Every night, he is wandering in his incommodious house, t

There are two machines A and B. There are n tasks, namely task 1, task 2, ..., task n. You must assign each task to one machine to process it. There are some facts you must know and comply with:You mus

Recently, researchers on Mars have discovered N powerful atoms. All of them are different. These atoms have some properties. When two of these atoms collide, one of them disappears and a lot of power i

Dr. X is a biologist, who likes rabbits very much and can do everything for them. 2012 is coming, and Dr. X wants to take some rabbits to Noah’s Ark, or there are no rabbits any more.A rabbit’s genes c

Alice and Bob are playing a game. This game is played with several identical pots and one marble. When the game starts, Alice puts the pots in one line and puts the marble in one of the pots. After tha

Count the ColorsTime Limit: 2 Seconds      Memory Limit: 65536 KB Painting some colored segments on a line, some previously painted segments may be covered by some the subsequent ones.Your

Back to the PastTime Limit: 2 Seconds      Memory Limit: 65536 KB      Special Judge Recently poet Mr. po encountered a serious problem, rumor said some of his early poems are written by oth

Special SubsequenceTime Limit: 5 Seconds      Memory Limit: 32768 KB There a sequence S with n integers , and A is a special subsequence thatsatisfies |Ai-Ai-1| <=d ( 0 Now your task is

ZOJ Problem Set - 3659Conquer a New RegionTime Limit: 5 Seconds      Memory Limit: 32768 KB The wheel of the history rolling forward, our king conquered a new region in a distant contine

Problem DescriptionYesterday, my teacher taught me about bit operators: and (&), or (|), xor (^). I generated a number table a[N], and wrote a program to calculate the matrix table b[N][N] using thr

ZOJ Problem Set - 3261Connections in Galaxy WarTime Limit: 3 Seconds      Memory Limit: 32768 KB In order to strengthen the defense ability, many stars in galaxy allied together and built

Schedule ProblemTime Limit: 2 Seconds      Memory Limit: 65536 KB      Special Judge A project can be divided into several parts. Each part should be completed continuously. This means if a

Help Me EscapeTime Limit: 2 Seconds      Memory Limit: 32768 KB Background    If thou doest well, shalt thou not be accepted? and if thou doest not well, sin lieth at the door. And unto th

DominationTime Limit: 8 Seconds      Memory Limit: 131072 KB      Special JudgeEdward is the headmaster of Marjar University. He is enthusiastic about chess and often plays chess with his

BloodsuckerTime Limit: 2 Seconds      Memory Limit: 65536 KB In 0th day, there are n-1 people and 1 bloodsucker.Every day, two and only two of them meet. Nothing will happen if they are of t

One Person GameTime Limit: 1 Second      Memory Limit: 32768 KB      Special Judge There is a very simple and interesting one-person game. You have 3 dice, namelyDie1, Die2 and Die3. Die1

Given a list of integers (A1, A2, …, An), and a positive integer M, please find the number of positive integers that are not greater than M and dividable by any integer from the given list.InputThe inp