- 博客(23)
- 资源 (17)
- 收藏
- 关注
原创 欧拉函数
欧拉函数欧拉函数φ(n):(定义)欧拉函数:对于一个正整数 n ,小于 n 且和 n 互质的正整数(包括 1)的个数,记作 φ(n) 。(通项):φ(x) = x(1 - 1/p1)(1 - 1/p2)(1 - 1/p3)(1 - 1/p4)…..(1 - 1/pn),其中p1, p2……pn为x的所有质因数,x是不为0的整数。φ(1)=1(唯一和1互质的数(小于等于1)就是1本身
2015-07-31 17:04:13 512
原创 HDU 4983 Goffi and GCD(数列、欧拉函数)
Goffi and GCDTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 729 Accepted Submission(s): 248Problem DescriptionGoffi is doing
2015-07-31 11:56:18 987
原创 HDU 4982 Goffi and Squary Partition(枚举)
Goffi and Squary PartitionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 902 Accepted Submission(s): 315Problem DescriptionR
2015-07-31 10:58:25 358
原创 HDU 5318 The Goddess Of The Moon(矩阵快速幂)
The Goddess Of The MoonTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 547 Accepted Submission(s): 221Problem DescriptionChan
2015-07-29 17:27:16 900
原创 HDU 5319 Painter
PainterTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 634 Accepted Submission(s): 291Problem DescriptionMr. Hdu is an painte
2015-07-29 12:16:23 540
原创 HDU 5317 RGCDQ
RGCDQTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 323 Accepted Submission(s): 162Problem DescriptionMr. Hdu is interested
2015-07-28 21:28:00 670
原创 C++ string类
C++之string类 C++中的string是标准库中的一种容器,用来存储字符串。string类提供了非常丰富的函数,这些函数不仅可以完成对字符串的复杂操作,而且可以实现string类与C字符语言类字符串之间的转换。一、C语言的字符串在C语言里,对字符串的处理一项都是一件比较痛苦的事情,因为通常在实现字符串的操作的时候都会用到最不容易驾驭的类型——指针。
2015-07-27 21:52:33 451
原创 STL中的二分查找——lower_bound 、upper_bound 、binary_search
二分查找很简单,原理就不说了。STL中关于二分查找的函数有三个lower_bound 、upper_bound 、binary_search 。这三个函数都运用于有序区间(当然这也是运用二分查找的前提)。 其中如果寻找的value存在,那么lower_bound返回一个迭代器指向其中第一个这个元素。upper_bound返回一个迭代器指向其中最后一个这个元素的下一个位置(明确点说就
2015-07-27 11:33:58 1156
原创 HDU 5310 Hidden String(暴力枚举)
Hidden StringTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 429 Accepted Submission(s): 161Problem DescriptionToday is the
2015-07-26 22:29:28 528
原创 HDU 5312 Sequence
SequenceTime Limit: 2000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 509 Accepted Submission(s): 126Problem DescriptionToday, Soda has l
2015-07-26 18:48:49 363
原创 HDU 5301 Souvenir(简单模拟)
SouvenirTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 398 Accepted Submission(s): 260Problem DescriptionToday is the 1st
2015-07-26 11:16:01 410
原创 HDU 5297 Y sequence(数论 迭代 容斥原理)
Y sequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 394 Accepted Submission(s): 47Problem DescriptionYellowstar likes i
2015-07-26 10:58:10 887
原创 快速幂
快速幂 快速幂顾名思义,就是快速计算某个数的多少次幂(即a的b次方)。一般的,我们通常采用连乘的方式求解此类问题,时间复杂度为O(N)。但是,当a,b都比较大时,如何快速的求出它的值呢?采用快速幂的方式可以将时间复杂度变成 O(log₂N)。快速幂原理:(位操作)将指数b化为二进制后计算例如:求a^15 15化为二进制为1111,即15=2^3+2^2+2^1+2^
2015-07-26 10:55:05 397
原创 HDU 5301 Friends(DFS + 枚举)
FriendsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1192 Accepted Submission(s): 595Problem DescriptionThere are n people
2015-07-25 16:23:26 231
原创 HDU 4602 Partition(快速幂)
C - PartitionTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 4602DescriptionDefine f(n) as the number of ways to perform n
2015-07-24 19:14:17 306
原创 A. 简单的生活(cin)
A. 简单的生活Time Limit: 1000msCase Time Limit: 1000msMemory Limit: 65536KB64-bit integer IO format: %lld Java class name: MainSubmit Status PID: 4318Font Size: + -
2015-07-24 19:07:09 545
原创 HDU 5308 I Wanna Become A 24-Point Master(找规律+模拟)
I Wanna Become A 24-Point MasterTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 497 Accepted Submission(s): 200Problem Description
2015-07-24 16:04:32 637
原创 HDU 5301 Building (找规律)
BuildingsTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 739 Accepted Submission(s): 203Problem DescriptionYour current tas
2015-07-24 09:51:56 605
原创 HDU 5289 Assignment (RMQ——ST算法)
AssignmentTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 899 Accepted Submission(s): 440Problem DescriptionTom owns a compan
2015-07-22 14:07:42 367
原创 RMQ(Range Minimum/Maximum Query)问题——ST算法
RMQ问题——ST算法 RMQ (Range Minimum/Maximum Query)问题:对于长度为n的数列A,回答若干询问RMQ(A,i,j)(i,j 利用ST算法可以解决RMQ问题,其预处理的时间复杂度为O(nlogn),查询的时间复杂度为O(1)。比如利用ST算法求一个区间的最大值的实现过程: 1.预处理过程,用一个DP解决
2015-07-22 10:27:22 374
原创 HDU5288 OO’s Sequence(暴力枚举)
OO’s SequenceTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 644 Accepted Submission(s): 241Problem DescriptionOO has got a
2015-07-21 22:18:38 369
原创 HDU 5284 wyh2000 and a string problem(查找字符)
wyh2000 and a string problem Accepts: 428 Submissions: 1313 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Problem Descripti
2015-07-20 17:02:44 420
原创 HDU 1715 大菲波数(高精度——加法)
F - 大菲波数Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1715DescriptionFibonacci数列,定义如下: f(1)=f(2)=1 f(n)=f(n-1)+f(n-2)
2015-07-17 11:40:27 563
罗塞塔石碑安卓版
2018-06-09
高斯消去法求解线性方程组C/C++程序(输入输出支持分数和浮点数)
2018-06-09
遗传算法与最小二乘法拟合函数比较的C/C++代码实现
2018-06-09
USB转串口驱动(串口芯片的型号PL2303)(支持win8/8.1系统)
2016-07-12
USB转串口驱动(串口芯片的型号PL2303)
2016-07-12
51单片机C语言60个复杂程序
2016-07-04
51单片机50个相对复杂一些的程序
2016-07-04
中国象棋的LABVIEW编程
2016-07-04
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人