2013年09月_青苹之末

12月 11月 10月 09月 08月 07月

原创 java中BigInteger 里的所有方法介绍

BigDecimal abs() 返回BigDecimal，其值为此BigDecimal的绝对值，其标度为this.scale()。 BigDecimal abs(MathContext mc) 返回其值为此BigDecimal绝对值的BigDecimal（根据上下文设置进行舍入）。 BigDecimal add(BigDecimal

2013-09-29 18:55:39 1138

原创网络赛长春赛区1004 数论，概率

Cut the CakeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Problem DescriptionMMM got a big big big c

2013-09-28 21:12:04 978

原创 Reduced ID Numbers 数论基本模运算

Reduced ID NumbersTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 8395Accepted: 3384DescriptionT. Chur teaches various groups of students at university U.

2013-09-28 10:40:44 1199 1

原创 Semi-prime H-numbers 筛选法

Semi-prime H-numbersTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 6868Accepted: 2927DescriptionThis problem is based on an exercise of David Hilbert, w

2013-09-28 09:04:30 1673

原创 The Embarrassed Cryptographer POJ 2635 数论之高精度求模（同余模定理+千进制）

The Embarrassed CryptographerTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 11344Accepted: 3022DescriptionThe young and very promising cryptographer Odd E

2013-09-25 20:28:01 1129

转载数论-同余模定理和欧几里德算法

扩展的欧几里德算法不仅可以用来求解gcd(a, b)，还可以用来求解一对整数(x, y)，使得 xa + yb = gcd(a, b)。显然，当gcd(a, b) = 1时，有xa + yb = 1，则在模b情况下x是a的乘法逆元，在模a情况下y是b的乘法逆元。推导过程：1、当b = 0时，gcd(a, b) = a, 则 x = 1，y = 0满足条件。2、当a、b xa + y

2013-09-25 19:13:43 1486

原创素数高效打表法

主要原理还是因为一个素数的倍数一定就不是素数了，所以break是最快速的方法了。 /*遇到素数需要打表时，先估算素数的个数：num = n / lnx;num为大概数字，越大误差越小（只是估计，用于估算素数表数组大小）这个打表法效率貌似很高，网上说几乎达到了线性时间（不知道是真是假=。=）*/#include#include#include#include#incl

2013-09-25 18:10:14 4883 2

原创 Paths on a Grid POJ 1942 组合数学

Paths on a GridTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 19898Accepted: 4827DescriptionImagine you are attending your math lesson at school. Once aga

2013-09-25 11:03:05 874

原创 poj 1019 数论

Number SequenceTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 31517Accepted: 8948DescriptionA single positive integer i is given. Write a program to find

2013-09-24 20:56:15 680

原创 Code POJ 1850 组合数学

CodeTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 7193Accepted: 3358DescriptionTransmitting and memorizing information is a task that requires different

2013-09-23 21:19:22 660

原创 poj 3252 组合数学，数论

Round NumbersTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 7584Accepted: 2606DescriptionThe cows, as you know, have no fingers or thumbs and thus are u

2013-09-22 16:59:38 693

原创求一个数二进制中1的个数

第一种是最慢也是最普通的方法是慢慢的求出每一位来。#includeint count(int n){ int sum=0; while(n) { if(n%2==1) sum++; n=n/2; } return sum;}int main(){ int i; for(i=

2013-09-14 18:16:12 656

原创 We Love MOE Girls 网络赛第一场 1003

We Love MOE GirlsTime Limit: 1000/500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Problem DescriptionChikami Nanako is

2013-09-14 17:32:33 1149

原创 A Bit Fun 网络赛第一场1010

A Bit FunTime Limit: 5000/2500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Problem DescriptionThere are n numbers in a a

2013-09-14 17:22:35 845

原创 Milk hdu 1070

MilkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11361 Accepted Submission(s): 2735Problem DescriptionIgnatius drinks milk eve

2013-09-14 10:57:32 1616

原创 As Easy As A+B hdu 1040

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

2013-09-14 10:49:10 1346

原创 Biker's Trip Odometer hdu 1038

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

2013-09-14 10:37:55 835

原创 Delta-wave hdu 1030 找规律的数学题目

Delta-waveTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4602 Accepted Submission(s): 1745Problem DescriptionA triangle field

2013-09-13 17:34:48 924

原创 ceil 函数和 floor 函数

函数名: ceil用法: double ceil(double x);功能: 返回大于或者等于指定表达式的最小整数头文件:math.h 函数名： floor功能：返回小于或者等于指定表达式的最大整数用法： double floor(double x);头文件：math.h #include #include int main(v

2013-09-13 16:33:26 881

原创 Train Problem II hdu 1023 卡特兰数（模板）

Train Problem IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4667 Accepted Submission(s): 2548Problem DescriptionAs we all kno

2013-09-13 16:10:54 1038

转载卡特兰数

什么是Catalan数说到Catalan数，就不得不提及Catalan序列，Catalan序列是一个整数序列，其通项公式是我们从中取出的就叫做第n个Catalan数，前几个Catalan数是：1, 1, 2, 5, 14, 42, 132, 429, 1430, 4862, 16796, 58786, 208012, 742900, 2674440, 9694845, 35357670,

2013-09-13 08:47:07 637

原创 Train Problem I hdu 1022 栈的运用

Train Problem ITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16660 Accepted Submission(s): 6210Problem DescriptionAs the new te

2013-09-12 21:09:24 725

原创 hdu 1588 Gauss Fibonacci 矩阵的高次高速求幂，矩阵的高速求和，斐波那契公式

Gauss FibonacciTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1778 Accepted Submission(s): 772Problem DescriptionWithout expecti

2013-09-11 20:48:14 863

转载斐波那契数列

[定理1] 标准Fibonacci序列（即第0项为0，第1项为1的序列）当N大于1时，一定有f(N)和f(N-1)互质其实，结合“互质”的定义，和一个很经典的算法就可以轻松证明对，就是辗转相除法互质的定义就是最大公约数为1 数学归纳法是很有用的证明方法，我们接下来这个定理用数学归纳法就很好证明：[定理2]若i为奇数， f(i)*f(i)=f(i-1)*f(i+1)+1，否则f(

2013-09-11 18:29:04 1527

原创 Tr A hdu 1575 二分法矩阵相乘的高次幂

Tr ATime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2063 Accepted Submission(s): 1530Problem DescriptionA为一个方阵，则Tr A表示A的迹（就是主对角线上

2013-09-11 16:47:52 1040

原创快速求幂

我们在一般求幂的时候常用的方法很简单，求是挨个去求就是了 int pow(int x, int n){ int m=1; while(n!=0){ m=m*x; n=n-1; } return m;}但是这种方法实在是太慢了，例子快速求正整数次幂，当然不能直接死乘。举个例子：3 ^ 999 = 3 * 3 * 3 * … * 3直接乘要做998次乘法。

2013-09-11 10:07:09 842

转载矩阵快速幂

转载于点击打开链接矩阵的快速幂是用来高效地计算矩阵的高次方的。将朴素的o（n）的时间复杂度，降到log（n）。这里先对原理（主要运用了矩阵乘法的结合律）做下简单形象的介绍：一般一个矩阵的n次方，我们会通过连乘n-1次来得到它的n次幂。但做下简单的改进就能减少连乘的次数，方法如下：把n个矩阵进行两两分组，比如：A*A*A*A*A*A => (A*A)*(A

2013-09-10 20:35:48 660

原创 Counterfeit Dollar hdu 1013

Counterfeit DollarTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 36530Accepted: 11682DescriptionSally Jones has a dozen Voyageur silver dollars. However,

2013-09-10 20:13:57 780

原创 Power of Cryptography poj 2109 精度问题

Power of CryptographyTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 16480 Accepted: 8342DescriptionCurrent work in cryptography involves (among other thi

2013-09-08 15:38:03 611

原创 X问题 hdu 1573 韩信点兵中国剩余定理

X问题Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2586 Accepted Submission(s): 816Problem Description求在小于等于N的正整数中有多少个X满足：X mod a

2013-09-04 21:02:21 1156

原创 Least Common Multiple hdu 1019 求多个数最小公倍数

Least Common MultipleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24031 Accepted Submission(s): 9023Problem DescriptionThe lea

2013-09-04 19:41:03 807

原创找零钱 stut 1223

找零钱Time Limit: 1000ms Memory limit: 65536K 有疑问？点这里^_^题目描述我们知道人民币有1、2、5、10、20、50、100这几种面值。现在给你n(1≤n≤250)元，让你计算换成用上面这些面额表示且总数不超过100张，共有几种。比如4元，能用4张1元、2张1元和1张2元、2张2元，三种表示方法。输入输入有

2013-09-04 17:12:38 1840

原创 Max Sum hdu 1003

Max SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 115321 Accepted Submission(s): 26749Problem DescriptionGiven a sequence a[

2013-09-04 16:21:31 734

原创 Sticks hdu 1455

SticksTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4854 Accepted Submission(s): 1362Problem DescriptionGeorge took sticks of t

2013-09-04 11:19:03 970

原创 Rightmost Digit hdu 1061

Rightmost DigitTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25859 Accepted Submission(s): 9932Problem DescriptionGiven a posit

2013-09-03 20:58:54 1111

原创 Leftmost Digit hdu 1060

Leftmost DigitTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11053 Accepted Submission(s): 4223Problem DescriptionGiven a positi

2013-09-03 20:04:05 696

原创 N! hdu1042

N!Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 44441 Accepted Submission(s): 12581Problem DescriptionGiven an integer N(0 ≤ N

2013-09-01 22:44:34 701

原创 Easier Done Than Said? hdu 1039

Easier Done Than Said?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6135 Accepted Submission(s): 3048Problem DescriptionPasswor

2013-09-01 18:16:41 685

原创 next_permutation 与 prev_permutation的用法（全排列）

个人在做了hdu 1027之后觉得通过代码来直接操作实现一组数的递增递减实在是太牛，我没法很好的运用，所以还是好好用 STL 的

2013-09-01 17:33:13 1548

原创 Ignatius and the Princess II hdu 1027

Ignatius and the Princess IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3732 Accepted Submission(s): 2248Problem DescriptionN

2013-09-01 13:08:09 1630