BestCode
__铭
这个作者很懒,什么都没留下…
展开
-
HDU 5613 Baby Ming and Binary image(扫雷地图的还原)
Baby Ming and Binary image Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 77 Accepted Submission(s): 31 Problem Description Bab原创 2016-01-24 19:23:40 · 747 阅读 · 0 评论 -
BestCoder Round #51 (div.2) 1001 Zball in Tina Town
判断素数,如果是n素数的话,输出n-1,(n == 4 输出 2) 否则 输出 0 Tina 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原创 2015-08-15 20:00:40 · 541 阅读 · 0 评论 -
BestCoder Round #52 (div.2) 1001 Victor and Machine
Problem Description Victor has a machine. When the machine starts up, it will pop out a ball immediately. After that, the machine will pop out a ball every www seconds. However, the machine has原创 2015-08-22 19:29:55 · 522 阅读 · 0 评论 -
HDU 5479 Scaena Felix
Scaena Felix Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 258 Accepted Submission(s): 112 Problem Description Given a parentheses原创 2015-09-27 10:45:38 · 509 阅读 · 0 评论 -
GT and numbers(BestCoder Round #60)1002
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原创 2015-10-23 20:06:18 · 1516 阅读 · 0 评论 -
HDU 5646 DZY Loves Partition (数学)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5646 DZY Loves Partition Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 887 Acc原创 2016-03-22 21:25:35 · 664 阅读 · 0 评论 -
HDU 5631 (BestCoder Round #73 (div.1) 1001)Rikka with Graph(并查集)
Rikka with Graph Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 51 Accepted Submission(s): 20 Problem Description As we know, R原创 2016-02-20 21:45:28 · 632 阅读 · 0 评论 -
BestCoder Round #50 (div.2) 1001
Problem Description AFA 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原创 2015-08-08 21:19:54 · 456 阅读 · 0 评论 -
BestCoder Round #50 (div.2) 1003
Problem Description ZJiaQ 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原创 2015-08-08 21:21:19 · 450 阅读 · 0 评论 -
BestCoder Round #49 ($) 1001
Problem Description There is an integer aaa and nnn integers b1,…,bnb_1, \ldots, b_nb1,…,bn. After selecting some numbers from b1,…,bnb_1, \ldots, b_nb1,…,bn in any order, say c原创 2015-08-01 20:34:09 · 573 阅读 · 0 评论 -
HDU 5612 Baby Ming and Matrix games (搜索)
Baby Ming and Matrix games Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 392 Accepted Submission(s): 82 Problem Description原创 2016-01-24 15:02:34 · 569 阅读 · 0 评论 -
Hidden String(递归)
Hidden String Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 595 Accepted Submission(s): 225 Problem Description Today is the 1st原创 2015-07-26 16:55:38 · 546 阅读 · 0 评论