Code_KK的博客

The Magic TowerTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2398    Accepted Submission(s): 618Problem DescriptionLike most o

01 MatrixTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 605    Accepted Submission(s): 127Problem DescriptionIt's really a simp

4214: Power EggsTime Limit: 1 Sec  Memory Limit:128 MBSubmit: 125  Solved:21DescriptionBenedict bought K identical power eggs from Dropeggs.com, and now he wants to test them by droppi

Rikka with GraphTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 51    Accepted Submission(s): 20Problem DescriptionAs we know, R

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5646DZY Loves PartitionTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 887    Acc

GT and numbers题意：给出两个数NNN和MMM。NNN每次可以乘上一个自己的因数变成新的NNN。求最初的NNN到MMM至少需要几步。如果永远也到不了输出−1-1−1。方法：若是N可以通过乘上自己的因数可以变成M，则M一定可以整除N。N在通过乘上自己的因数可以变成M的过程中，N通过乘以N，M的最大公约数就可以达到M，若此时的N与M的最大公约数为1

Problem DescriptionVictor has a machine. When the machine starts up, it will pop out a ball immediately. After that, the machine will pop out a ball everywww seconds. However, the machine has

判断素数，如果是n素数的话，输出n-1,(n == 4 输出 2)  否则 输出 0Tina Town is a friendly place. People there care about each other.Tina has a ball called zball. Zball is magic. It grows larger every day. On the first

小明系列问题——小明序列Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2499    Accepted Submission(s): 778Problem Description　　大家都知道小明最喜欢研究跟序列有

Hidden StringTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 595    Accepted Submission(s): 225Problem DescriptionToday is the 1st

Description有一台机器，并且给你这台机器的工作表，工作表上有n个任务，机器在ti时间执行第i个任务，1秒即可完成1个任务。有m个询问，每个询问有一个数字q，表示如果在q时间有一个工作表之外的任务请求，请计算何时这个任务才能被执行。 机器总是按照工作表执行，当机器空闲时立即执行工作表之外的任务请求。   Input输入的第一行包含一个整数T，

Bitwise EquationsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 645    Accepted Submission(s): 343Problem DescriptionYou ar

Problem DescriptionA simple problemProblem DescriptionYou have a multiple set,and now there are three kinds of operations:1 x : add number x to set2 : delete the minimum number (if the set is

The collector’s puzzleTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 986    Accepted Submission(s): 217Problem DescriptionT

The Country ListTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2516    Accepted Submission(s): 592Problem DescriptionAs t

Happy ValueTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1350    Accepted Submission(s): 400Problem DescriptionIn an apart

Baby Ming and Binary imageTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 77    Accepted Submission(s): 31Problem DescriptionBab

Baby Ming and Matrix gamesTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 392    Accepted Submission(s): 82Problem Description

Problem DescriptionThere is an integer aaa and nnn integers b1,…,bnb_1, \ldots, b_nb​1​​,…,b​n​​. After selecting some numbers from b1,…,bnb_1, \ldots, b_nb​1​​,…,b​n​​ in any order, say c

Problem DescriptionZJiaQ want to become a strong man, so he decided to play the mook jong。ZJiaQ want to put some mook jongs in his backyard. His backyard consist of n bricks that is 1*1,so it is

Problem DescriptionAFA want to distribution her money to somebody.She divide her money into n same parts.One who want to get the money can get more than one part.But if one man's money is more tha

Problem DescriptionMZL loves xor very much.Now he gets an array A.The length of A is n.He wants to know the xor of all (Ai+Aj)(1≤i,j≤n)The xor of an array B is defined as B1 xor B2...xor BnIn

哈哈，还得靠惊人的记忆力啊Problem Description MZL define F(X) as the first ionization energy of the chemical element X Now he get two chemical elements U,V,given as their atomic number,he w

DescriptionI am going to my home. There are many cities and many bi-directional roads between them. The cities are numbered from0 to n-1 and each road has a cost. There are m roads. You are gi