2015年07月_AC1048900581

原创 An Easy Task

http://acm.hdu.edu.cn/showproblem.php?pid=1076An Easy TaskTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17302 Accepted Submission

2015-07-30 15:45:35 472

原创 Milk

http://acm.hdu.edu.cn/showproblem.php?pid=1070MilkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16024 Accepted Submission(s): 402

2015-07-30 15:16:15 546

原创 Rightmost Digit

http://acm.hdu.edu.cn/showproblem.php?pid=1061Rightmost DigitTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 39455 Accepted Submiss

2015-07-29 14:45:48 339

原创 Humble Numbers

http://acm.hdu.edu.cn/showproblem.php?pid=1058Humble NumbersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20460 Accepted Submissi

2015-07-29 09:32:45 463

转载汉诺塔 X（二分法）

http://acm.hdu.edu.cn/showproblem.php?pid=2511汉诺塔 XTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 640 Accepted Submission(s): 383

2015-07-28 15:14:02 361

原创 HangOver

http://acm.hdu.edu.cn/showproblem.php?pid=1056HangOverTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10699 Accepted Submission(s):

2015-07-28 09:57:42 367

原创 The Hardest Problem Ever

http://acm.hdu.edu.cn/showproblem.php?pid=1048The Hardest Problem EverTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19593 Accepte

2015-07-28 09:23:43 348

原创 As Easy As A+B

你可以调用stl,这里我给出快速排序各式各样的写法中的一种写法As Easy As A+BTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 46079 Accepted Submission(s): 19687

2015-07-27 22:05:53 373

原创 Ignatius and the Princess I

Ignatius and the Princess ITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14411 Accepted Submission(s): 4556Special JudgeProblem

2015-07-27 18:14:35 317

原创 Fibonacci Again

Fibonacci AgainTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 44035 Accepted Submission(s): 21020Problem DescriptionThere ar

2015-07-27 08:33:27 405

原创 Least Common Multiple

Least Common MultipleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 38374 Accepted Submission(s): 14468Problem DescriptionTh

2015-07-26 14:47:15 491

原创 A Mathematical Curiosity

A Mathematical CuriosityTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 31587 Accepted Submission(s): 10118Problem Description

2015-07-26 14:00:18 841

原创 Tempter of the Bone

http://acm.hdu.edu.cn/showproblem.php?pid=1010题意：在一个N,M的的迷宫中给定一个t，问能否恰好在t步从s到达d，其中x是不可到达点，且走过的点不能重复；#include #include #include int n,m,t,Sx,Sy,Dx,Dy;char Map[10][10];const int step[4][2]={{-1

2015-07-26 08:40:21 443

原创 Uniform Generator

http://acm.hdu.edu.cn/showproblem.php?pid=1014集合判重简单明了#include #include using namespace std;setint> S;int main(){ int s,m; while(scanf("%d%d",&s,&m)!=EOF){ S.clear();

2015-07-24 15:02:11 775

原创 Digital Roots

输入的超过了int的范围，要用字符串解决http://acm.hdu.edu.cn/showproblem.php?pid=1013#include #include char ch[10000];int main(){ while(scanf("%s",ch)!=EOF&&ch[0]!='0'){ int len=strlen(ch),ans=

2015-07-24 14:33:54 358

原创 u Calculate e

http://acm.hdu.edu.cn/showproblem.php?pid=1012#include int main(){ int sum[11]; double ans=0; sum[0]=1; for(int i=1;i10;i++) sum[i]=sum[i-1]*i; printf("n e\n"); p

2015-07-24 11:25:08 407

原创 Elevator

http://acm.hdu.edu.cn/showproblem.php?pid=1008#include int up[110],down[110];int main(){ up[0]=down[0]=0; for(int i=1;i100;i++) up[i]=up[i-1]+6; for(int i=1;i100;i++)

2015-07-24 11:22:45 1325

原创 hdu1372Knight Moves

入门bfs搜索题，题意为给点起点终点问最少多少步到达，使用双向bfs，比盲搜时间快了将近一倍#include #include using namespace std;const int dir[8][2]={{-1,-2},{-2,-1},{-2,1},{-1,2},{1,2},{2,1},{2,-1},{1,-2}};struct node{ int x,y;};typ

2015-07-22 13:37:19 348

原创 hdu素数环（搜索入门题）

http://acm.hdu.edu.cn/showproblem.php?pid=1016这是一道dfs入门题，题意简单，注意两个地方，一个是n为奇数时有两个奇数想临，此时肯定无素数环，第二个是对于不同的dfs定义有不同的实现方法，个人建议入门应该尝试各种定义的dfs进行实现，看了下其他人写的代码稍加修改了下#include #include using namespace std;

2015-07-22 13:22:13 561

ACcoders