2017年11月_逸川先生

12月 11月 10月 09月

原创 ACM中java如何快速输入输出

今天又遇到java做ACM超时的问题。然后网上找了好多方法，最后总结出自己的。java的Scanner 比较慢（出了名的了），但是ACM的要求有比较高。java其实有别的解决方案，就是使用StreamTokenizer与PrintWriter。也有大神有人使用别的方法，但我觉的都太麻烦了。首先是定义：StreamTokenizer in = new StreamTo

2017-11-27 19:42:57 7390 4

原创 HDOJ2131 Probability

ProbabilityTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8311 Accepted Submission(s): 4017Problem DescriptionMickey is interest

2017-11-30 12:44:56 238

原创 HDOJ2132 An easy problem

An easy problemTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14373 Accepted Submission(s): 3966Problem DescriptionWe once did a

2017-11-30 12:43:31 207

原创 HDOJCuts the cake

Cuts the cakeTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3890 Accepted Submission(s): 2476Problem DescriptionIce cream took a

2017-11-30 12:38:18 191

原创 HDOJ1097 A hard puzzle

A hard puzzleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 46236 Accepted Submission(s): 16971Problem Descriptionlcy gives a ha

2017-11-29 18:31:48 209

原创 HDOJ1076 An Easy Task

An Easy TaskTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24613 Accepted Submission(s): 15866Problem DescriptionIgnatius was bo

2017-11-29 18:27:11 218

原创 HDOJ1061 Rightmost Digit

Rightmost DigitTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 60576 Accepted Submission(s): 22770Problem DescriptionGiven a posi

2017-11-29 13:01:09 173

原创 HDOJ1058Humble Numbers（丑数）

Humble NumbersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 27739 Accepted Submission(s): 12234Problem DescriptionA number whos

2017-11-29 12:53:57 376

原创 HDOJ1056 HangOver

HangOverTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14617 Accepted Submission(s): 6485Problem DescriptionHow far can you make

2017-11-29 12:35:13 322

原创 HDOJ1049 Climbing Worm

Climbing WormTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20524 Accepted Submission(s): 14052Problem DescriptionAn inch worm i

2017-11-29 12:29:08 237

原创 HDOJ1048 The Hardest Problem Ever

The Hardest Problem EverTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 28637 Accepted Submission(s): 13407Problem DescriptionJul

2017-11-28 18:02:18 288

原创 HDOJ1040 As Easy As A+B

As Easy As A+BTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 66393 Accepted Submission(s): 28436Problem DescriptionThese days, I

2017-11-28 16:48:01 317

原创 HDOJ1042 N!

N!Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 86344 Accepted Submission(s): 25402Problem DescriptionGiven an integer N(0 ≤

2017-11-28 16:43:56 264

原创 HDOJ1038 Biker's Trip Odometer

Biker's Trip OdometerTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6290 Accepted Submission(s): 4272Problem DescriptionMost bic

2017-11-27 23:53:21 213

原创 HDOJ1037 Keep on Truckin'

Keep on Truckin'Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15788 Accepted Submission(s): 10795Problem DescriptionBoudreaux a

2017-11-27 23:46:21 277

原创 HDOJ1032 The 3n + 1 problem

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1032这个题目里的简单题。关键是把题目看懂，题目意思是，给出两个数a,b.求题目给出的计算方式下，[a,b]范围里的最大值。题目给出的m,n并没说明那个大那个小，应该先判断一下，并且题目也讲清楚了，要求输出的是原来的m,n，而不是交换之后的m,n。下面AC代码：imp

2017-11-27 23:43:22 258

原创 HDOJ1029 Ignatius and the Princess IV

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1029这个题目有个坑的地方就是，java难以AC。使用快排或者统计都超时了，但是同样的方法使用C语言就过了。题意是给你n个数（n是奇数），将出现次数大于（n+1）/2的数输出。这样的数显然就只有一个的，可以使用统计的方式。#include #include in

2017-11-27 18:28:11 289

原创 HDOJ1021 Fibonacci Again

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1021这个题最坑的莫过于范围了，开始用long，测试了下，发现很快就超范围了。然后想着使用大数，考虑到时间的限制，再次测试了结果，发现有规律。规律自己看：nonoyesnononoyesnononoyesnononoyes

2017-11-27 12:55:03 156

原创 HDOJ1020 Encoding

EncodingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 49366 Accepted Submission(s): 21998Problem DescriptionGiven a string cont

2017-11-27 12:48:20 209

原创 HDOJ1019 Least Common Multiple（求多个数的最小公倍数）

Least Common MultipleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 56425 Accepted Submission(s): 21492Problem DescriptionThe le

2017-11-27 00:11:19 337

原创 HDOJ1018 Big Number(斯特林公式求阶乘位数)

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1018题目的要求就是求出给定数的阶乘的位数。阶乘的增长是指数型的，使用暴力法显然是不行的。方法1：可以使用logn*m = logn+logm的公式去求解import java.util.Scanner;public class Main{ private static Scann

2017-11-26 23:19:46 353

原创 HDOJ1017 A Mathematical Curiosity

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1017 这个题目其实挺坑的。首先是N，应该挺多人纠结过这个N，N其实是blocks（块），一块有未知个cases。一个块的结束标志是0,0。然后是PE的问题，空格、空行，我也是被坑的好惨。这里应该是每个块之间有一个空行！也就是说，最后一个块是不在换行的。case与case之间

2017-11-26 21:58:18 194

原创 HDOJ1013 Digital Roots

题目链接：Digital Roots给出一个正整数，然后将该整数的每一位加起来，如果是只有个位数，就输出。如果还大于10，就继续将每一位加起来，直到只有个位数。但是值得注意的是，题目没讲整数的范围，所以应该是使用大数BigInteger的。下面AC代码：import java.math.BigInteger;import java.util.Scanner;public

2017-11-26 19:39:45 180

原创 HDOJ1012 u Calculate e

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1012题目要求输出公式：的解。特殊的一点是（1/0!）=1.可以先将阶乘保存起来，然后再将n=0,1,2....的e计算出来。输出的时候可以先将double直接输出，然后再观察题目给出的例子：Sample Outputn e- -----------

2017-11-26 18:42:08 208

原创 HDOJ1019 FatMouse' Trade（贪心）

FatMouse' TradeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 84040 Accepted Submission(s): 29105Problem DescriptionFatMouse pre

2017-11-26 17:27:46 193

原创 HDOJ1008 Elevator

ElevatorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 77235 Accepted Submission(s): 42436Problem DescriptionThe highest buildin

2017-11-26 16:40:39 229

原创 HDOJ2120 Ice_cream's world I

Ice_cream's world ITime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1830 Accepted Submission(s): 1060Problem Descriptionice_cream'

2017-11-25 23:42:13 235

原创 HDOJ2124 Repair the Wall（类似背包问题）

Repair the WallTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5185 Accepted Submission(s): 2491Problem DescriptionLong time ago

2017-11-25 23:32:55 287

原创 HDOJ2123 An easy problem

An easy problemTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8539 Accepted Submission(s): 5870Problem DescriptionIn this proble

2017-11-25 23:26:09 280

原创 HDOJ1004 Let the Balloon Rise

Let the Balloon RiseTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 130311 Accepted Submission(s): 51457Problem DescriptionContes

2017-11-25 23:21:55 234 1

原创 HDOJ1002 A + B Problem II

A + B Problem IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 387443 Accepted Submission(s): 75000Problem DescriptionI have a v

2017-11-25 23:18:39 214

原创 HDOJ2117 Just a Numble

Just a NumbleTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3628 Accepted Submission(s): 1821Problem DescriptionNow give you two

2017-11-24 21:07:40 297

原创 HDOJ2116 Has the sum exceeded

Has the sum exceededTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4869 Accepted Submission(s): 1093Problem DescriptionAs we all

2017-11-24 21:04:16 258

原创 HDOJ2115 I Love This Game

I Love This GameTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8290 Accepted Submission(s): 2864Problem DescriptionDo you like p

2017-11-24 21:00:21 257

原创 HDOJ2114 Calculate S(n)

题目链接：Calculate S(n)题目要求计算S(n)=13+23 +33 +......+n3 。输出后四位，不到四位用0补上。而且n 的范围是：1 这个结果Sn是long 都放不下的（同样，C++里的long long 也是放不下的）。需要知道一个公式：S(n)=13+23 +33 +......+n3 = （n*(n+1)/2）^2我这里提供两

2017-11-23 21:53:25 314

原创 HDOJ2113 Secret Number

题目链接：Secret Number计算出给定数各个位上数字为偶数的和。题目说明了在int范围里了。只要每一位都判断一下是否%2==0import java.util.Scanner;public class Main{ private static Scanner scanner; public static void main(String[] args)

2017-11-23 21:42:49 311

原创 HDOJ2111 Saving HDU（背包问题）

题目链接：Saving HDU这题是个背包问题，首先按照单价排序，然后，装的下就装，装不下就分割。import java.util.Scanner;//背包问题public class Main{ private static Scanner scanner; private static int pi[]; private static int mi[];

2017-11-23 21:39:56 266

原创 HDOJ2109 Fighting for HDU

题目链接：Fighting for HDU题目的意思就是给你两行数据，分别进行排序。然后比较。大的得两分，平手一分，输的不得分。import java.util.Arrays;import java.util.Scanner;public class Main { private static Scanner scanner; public static void main

2017-11-23 19:00:31 442

原创 HDOJ2108 Shape of HDU

题目链接：Shape of HDU/* 1.向量的叉积的模表示这两个向量围成的平行四边形的面积。设矢量P = ( x1, y1 )，Q = ( x2, y2 )，则矢量叉积定义为由(0,0)、p1、p2和p1+p2所组成的平行四边形的带符号的面积，即：P×Q = x1*y2 – x2*y1，其结果是一个伪矢量。显然有性质 P × Q = – ( Q × P ) 和 P

2017-11-23 18:57:29 336

原创 HDOJ2107 Founding of HDU

Founding of HDUTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11292 Accepted Submission(s): 7379Problem Description经过慎重的考虑，XHD,8

2017-11-23 18:54:40 189