qiuxueming_csdn

D - Curling 2.0Time Limit:1000MS    Memory Limit:65536KB    64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 3009DescriptionOn Planet MM-21, after their Olympic games thi

B - Red and BlackCrawling in process...Crawling failedTime Limit:1000MS    Memory Limit:30000KB     64bit IO Format:%I64d & %I64uSubmitStatus DescriptionThere is a rectan

SubmitStatus Practice ZOJ 1002DescriptionSuppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 91284    Accepted Submission(s): 24823Problem DescriptionThe doggie found a bo

Description        猜数字游戏是gameboy最喜欢的游戏之一。游戏的规则是这样的：计算机随机产生一个四位数，然后玩家猜这个四位数是什么。每猜一个数，计算机都会告诉玩家猜对几个数字，其中有几个数字在正确的位置上。       比如计算机随机产生的数字为1122。如果玩家猜1234,因为1,2这两个数字同时存在于这两个数中，而且1在这两个数中的位置是相同的，所以计算机会

A Knight's JourneyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 37746 Accepted: 12835DescriptionBackgroundThe knight is getting bored of seeing the sa

1053. Path of Equal Weight (30)时间限制 10 ms内存限制 65536 kB代码长度限制 16000 B判题程序 Standard 作者 CHEN, YueGiven a non-empty tree with root R, and with weigh

D. Lakes in Berlandtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe map of Berland is a rectangle of th

C. Andryusha and Colored Balloonstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAndryusha goes through a

Problem DescriptionAoshu is very popular among primary school students. It is mathematics, but much harder than ordinary mathematics for primary school students. Teacher Liu is an Aoshu teacher. H

Problem DescriptionA clique is a complete graph, in which there is an edge between every pair of the vertices. Given a graph with N vertices and M edges, your task is to count the number of clique

DescriptionA robot has been programmed to follow the instructions in its path. Instructions for the next direction the robot is to move are laid down in a grid. The possible instructions

A ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacent circles should be a prime.Note: the nu

Crawling in process...Crawling failed   Time Limit:1000MS    Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmitStatus Practice HDU 1258 DescriptionGiven a s

Description在N*N的方格棋盘放置了N个皇后，使得它们不相互攻击（即任意2个皇后不允许处在同一排，同一列，也不允许处在与棋盘边框成45角的斜线上。你的任务是，对于给定的N，求出有多少种合法的放置方法。   Input共有若干行，每行一个正整数N≤10，表示棋盘和皇后的数量；如果N=0，表示结束。   Ou