_

Problem DescriptionKazaQ wears socks everyday.At the beginning, he has n pairs of socks numbered from 1 to n in his closets. Every morning, he puts on a pair of socks which has the smallest number in

DiscussionBananas are the favoured food of monkeys. In the forest, there is a Banana Company that provides bananas from different places. The company has two lists. The first list records

DiscussionInput FormatSample InputSample Output题意：code：

You are to find all the two-word compound words in a dictionary. A two-word compound word is a word in the dictionary that is theconcatenation of exactly two other words in the dictionary.Input

Queues and Priority Queues are data structures which are known to most computer scientists. The Team Queue, however, is not so well known, though it occurs often in everyday life. At lunch time the qu

详细题目：https://vjudge.net/problem/UVA-12100思路：用队列模拟，开一个 的队列，分别表示任务的优先级和位置。再开一个 的优先队列，默认任务的优先级为从大到小的优先顺序。每次取出队列首任务，若其优先级不是最高的（根据优先队列判断），将其入队；否则，ans++，再判断其位置是否为所求任务完成的时刻，若是则输出ans结束。#inclu

The figure shown on the left is left-right symmetric as it is possible to fold the sheet of paper along a vertical line, drawn as a dashed line, and to cut the figure into two identical halves. The fi

详细题目：https://vjudge.net/problem/UVA-230思路：根据题意先对各本书进行排序（按ASCII码先作者后书名），建立一个结构体 book 对每本书的作者和状态（入藏，借出，归还但未上架）进行储存，并通过建立 map 的键值关系。对于每次 SHELVE 操作，找到第三种状态的书，确定其插入的位置（先前排序的作用于此）。代码：#include #incl

题目 Ugly numbers are numbers whose only prime factors are 2, 3 or 5. The sequence1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, ...shows the first 11 ugly numbers. By convention, 1 is included.

The computer company you work for is introducing a brand new computer line and is developing a new Unix-like operating system to be introduced along with the new computer. Your assignment is to write

An elevation of a collection of buildings is an orthogonal projection of the buildings onto a vertical plane. An external elevation of a city would show the skyline and the faces of the ``visible" bui

思路：开个新的数组来保存Ducci 序列，每次abs后，作判断。只有两种LOOP或ZERO结果，只需判断一项。#include #include #include using namespace std;bool zeo_jud(int *a,int len){ for(int i=0;i<len;i++) { if(a[i]!=0)

You are working in a team that writes Incredibly Customizable Programming Codewriter (ICPC) which is basically a text editor with bells and whistles. You are working on a module that takes a piece of

Programs executed concurrently on a uniprocessor system appear to be executed at the same time, butin reality the single CPU alternates between the programs, executing some number of instructions fr

Given is an ordered deck of n cards numbered 1 to n with card 1 at the top and card n at the bottom. The following operation is performed as long as there are at least two cards in the deck:  Throw

思路：每一个想从A学校换到B学校的学生必须找到一个唯一的从B学校换到A学校的学生。可以定义一个arr[ ]数组作为AB的关系，并对每一对关系进行swap(arr[a],arr[b])，如果交换成功，最后的对于每一个 i，必有arr[ i ]= i。#include #include #include using namespace std;const int maxn=5000

In this problem, a dictionary is collection of key-value pairs, where keys are lower-case letters, and values are non-negative integers. Given an old dictionary and a new dictionary, find out what wer

Peter studies the theory of relational databases. Table in the relational database consists of values that are arranged in rows and columns.There are different normal forms that database may adher

Background from Wikipedia: “Set theory is a branch of mathematics created principally by the German mathe-matician Georg Cantor at the end of the 19th century.Initially controversial, set theory has c

Problem DescriptionThe most important part of a GSM network is so called Base Transceiver Station (BTS). These transceivers form the areas called cells (this term gave the name to the cellular phone)

Problem DescriptionA number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 25, 27, ... shows the first

Problem DescriptionAn inch worm is at the bottom of a well n inches deep. It has enough energy to climb u inches every minute, but then has to rest a minute before climbing again. During the rest, it

Problem DescriptionJulius Caesar lived in a time of danger and intrigue. The hardest situation Caesar ever faced was keeping himself alive. In order for him to survive, he decided to create one of th

Problem DescriptionOne 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 numbe

Problem DescriptionGiven an integer N(0 ≤ N ≤ 10000), your task is to calculate N!  InputOne N in one line, process to the end of file.  OutputFor each N, output N! in one line.  Sample In

Problem Description  Password security is a tricky thing. Users prefer simple passwords that are easy to remember (like buddy), but such passwords are often insecure. Some sites use random computer-g

Problem DescriptionA relay is a race for two or more teams of runners. Each member of a team runs one section of the race. Your task is to help to evaluate the results of a relay race. You have to pr

Problem Description1035 Robot Motion" src="http://acm.hdu.edu.cn/data/images/1035-1.gif" alt="hdu 1035 Robot Motion" />A robot has been programmed to follow the instructions in its path. Instruction

Problem DescriptionA number of students sit in a circle facing their teacher in the center. Each student initially has an even number of pieces of candy. When the teacher blows a whistle, each studen

Problem DescriptionSoon after he decided to design a T-shirt for our Algorithm Board on Free-City BBS, XKA found that he was trapped by all kinds of suggestions from everyone on the board. It is ind

Problem DescriptionNow our hero finds the door to the BEelzebub feng5166. He opens the door and finds feng5166 is about to kill our pretty Princess. But now the BEelzebub has to beat our hero first.

Problem Description "The item is locked in a Klein safe behind a painting in the second-floor library. Klein safes are extremely rare; most of them, along with Klein and his factory, were destroye

DescriptionIn millions of newspapers across the United States there is a word game called Jumble. The object of this game is to solve a riddle, but in order to find the letters that appear in the ans

Most crossword puzzle fans are used to anagrams--groups of words with the same letters in different orders--for example OPTS, SPOT, STOP, POTS and POST. Some words however do not have this attribute,

Andy, 8, has a dream - he wants to produce his very own dictionary. This is not an easy task for him, as the number of words that he knows is, well, not quite enough. Instead of thinking up all the wo

Description给你两个整数n,m，求从n到m之间所有数字之和，保证0<=n<=mInput只有一行包含两个整数n,mOutput输出n到m之间所有数字之和Sample Input1 20 100000Sample Output35000050000思路：对于大整数类的运算，只能当其为字符串处理，模拟运算过程。