基础
文章平均质量分 70
木土的H
这个作者很懒,什么都没留下…
展开
-
ACM--steps--2.1.3--CAKE
CakeTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2662 Accepted Submission(s): 1286 Problem Description一次生日Party可能有原创 2015-01-28 00:13:05 · 347 阅读 · 0 评论 -
ACM--steps--2.1.5--又见GCD
又见GCDTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2683 Accepted Submission(s): 1325 Problem Description有三个正整数a,b,c原创 2015-01-28 23:55:38 · 313 阅读 · 0 评论 -
ACM-steps-2.1.2--判别素数
How many prime numbersTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8510 Accepted Submission(s): 2716 Problem Descrip原创 2015-01-27 23:27:13 · 325 阅读 · 0 评论 -
ACM--steps--2.1.6--打表求因子和
七夕节Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4246 Accepted Submission(s): 1498 Problem Description七夕节那天,月老来到数字王原创 2015-01-29 21:56:09 · 398 阅读 · 0 评论 -
ACM--steps--2.1.7--欧拉函数
找新朋友Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2786 Accepted Submission(s): 1306 Problem Description新年快到了,“猪头帮协会原创 2015-01-30 01:13:24 · 494 阅读 · 0 评论 -
欧拉函数
欧拉函数第一次写欧拉函数的题,琢磨的半天,最后还是只能按照最开始的想法写......欧拉函数PHI(n)表示的是比n小,并且与n互质的正整数的个数(包括1)。比如:PHI(1) = 1; PHI(2) = 1; PHI(3) = 2; PHI(4) = 2; ... PHI(9) = 6; ...要计算一个正整数n的欧拉函数的方法如下:1. 将n表示成素数的乘积:转载 2015-01-30 00:12:55 · 409 阅读 · 0 评论 -
ACM--steps--2.2.2--Joseph
JosephTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2074 Accepted Submission(s): 1202Problem DescriptionThe Joseph\\\\\\\'s problem is n原创 2015-02-01 12:24:20 · 312 阅读 · 0 评论 -
ACM--steps--2.2.1--求fibonacci数列的前四位
FibonacciTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3035 Accepted Submission(s): 1396Problem Description2007年到来了。经过2006年一年的修炼,数学神童zou原创 2015-01-31 22:15:26 · 424 阅读 · 0 评论 -
ACM--steps-2.1.8--求最高位
Leftmost DigitTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2694 Accepted Submission(s): 1165Problem DescriptionGiven a positive integer原创 2015-01-30 21:25:38 · 351 阅读 · 0 评论 -
ACM--steps--2.2.4--求最大公约数
Wolf and RabbitTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2020 Accepted Submission(s): 1145 Problem DescriptionT原创 2015-02-02 11:47:41 · 311 阅读 · 0 评论 -
ACM--steps--2.2.3--汉诺塔VII
汉诺塔VIITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1256 Accepted Submission(s): 912Problem Descriptionn个盘子的汉诺塔问题的最少移动次数是2^n-1,即在移动过程中会产原创 2015-02-02 10:43:48 · 592 阅读 · 0 评论 -
ACM--steps--2.2.5--模拟
The 3n + 1 problemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1102 Accepted Submission(s): 512 Problem Description原创 2015-02-02 21:29:55 · 274 阅读 · 0 评论 -
ACM--steps--2.2.6--找规律
Number SequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1384 Accepted Submission(s): 542 Problem DescriptionA原创 2015-02-02 23:45:49 · 297 阅读 · 0 评论 -
stirling数
转载自http://blog.csdn.net/acdreamers/article/details/8521134第一类Stirling数 s(p,k) s(p,k)的一个的组合学解释是:将p个物体排成k个非空循环排列的方法数。 s(p,k)的递推公式: s(p,k)=(p-1)*s(p-1,k)+s(p-1,k-1) ,1边界条件:s(p,转载 2015-02-03 20:37:44 · 418 阅读 · 0 评论 -
ACM--steps--2.2.7--数字的根
Digital RootsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1148 Accepted Submission(s): 473Problem DescriptionThe digital root of a posi原创 2015-02-03 18:44:31 · 292 阅读 · 0 评论 -
ACM--steps--2.2.8--第一类stirling数
Examining the RoomsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 652 Accepted Submission(s): 370 Problem Description原创 2015-02-03 22:21:46 · 393 阅读 · 0 评论 -
ACM--steps-2.3.1--大数相加
A + B Problem IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2373 Accepted Submission(s): 918Problem DescriptionI have a very simple pr原创 2015-02-04 10:47:05 · 251 阅读 · 0 评论 -
c++string知识大全
string 是C++中的字符串。 字符串对象是一种特殊类型的容器,专门设计来操作的字符序列。C++ Primer书中首先谈到的是构造函数即初始化问题。书中提到了几种常见的构造函数string s1;string s2(s1);string s3("abce");string s4(n,'c');接下来是对string对象的读写:1.读入未知转载 2015-02-03 15:09:59 · 268 阅读 · 0 评论 -
ACM--steps--2.3.3--stirling公式求n!
Big NumberTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 955 Accepted Submission(s): 643Problem DescriptionIn many applications very la原创 2015-02-05 22:06:15 · 430 阅读 · 0 评论 -
ACM--steps--3.1.2--骨牌铺方格
骨牌铺方格Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 747 Accepted Submission(s): 479 Problem Description在2×n的一个长方形方格中原创 2015-02-06 11:10:25 · 271 阅读 · 0 评论 -
ACM--steps--3.1.1
一只小蜜蜂...Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1044 Accepted Submission(s): 498Problem Description有一只经过训练的蜜蜂只能爬向右侧相邻的蜂房,不能反向爬行。请编原创 2015-02-06 10:20:36 · 280 阅读 · 0 评论 -
ACM--steps--3.1.5--
悼念512汶川大地震遇难同胞——重建希望小学 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 339 Accepted Submission(s): 227 Problem Descript原创 2015-02-08 11:32:17 · 482 阅读 · 0 评论 -
ACM--steps--3.1.6--Tiling_easy version
Tiling_easy versionTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 518 Accepted Submission(s): 450 Problem Description原创 2015-02-08 19:54:26 · 355 阅读 · 0 评论 -
ACM--steps--3.1.3--母牛的故事
母牛的故事Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 663 Accepted Submission(s): 484 Problem Description有一头母牛,它每年年初生一原创 2015-02-06 21:11:23 · 291 阅读 · 0 评论 -
hdu,2050,折线分割平面
这种类型的题目,在acm编程中比较经典,这里我们由浅入深来学习下:(1)在一个平面上有一个圆和n条直线,这些直线中每一条在圆内同其他直线相交,假设没有3条直线相交于一点,试问这些直线将圆分成多少区域。很容易看出递推关系,每新增一条直线,都将原来所有的区域分成两半,因此第n条直线会在原来的基础上再添加n个平面,函数递推关系式如下:递推公式1:f(0) = 1转载 2015-02-07 23:13:47 · 526 阅读 · 0 评论 -
ACM--steps--3.1.4--折线分割平面
折线分割平面Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 602 Accepted Submission(s): 466 Problem Description我们看到过很多直线分割平原创 2015-02-07 23:20:46 · 360 阅读 · 0 评论 -
ACM--steps--3.1.7--不容易系列之(3)—— LELE的RPG难题
不容易系列之(3)—— LELE的RPG难题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 919 Accepted Submission(s): 461 Problem Descripti原创 2015-02-08 21:31:22 · 323 阅读 · 0 评论 -
背包九讲
目录第一讲 01背包问题第二讲 完全背包问题第三讲 多重背包问题第四讲 混合三种背包问题第五讲 二维费用的背包问题第六讲 分组的背包问题第七讲 有依赖的背包问题第八讲 泛化物品第九讲 背包问题问法的变化附:USACO中的背包问题前言本篇文章是我(dd_engi)正在进行中的一个雄心勃勃的写作转载 2015-02-16 21:33:23 · 529 阅读 · 0 评论 -
快速幂
快速幂取模算法在网站上一直没有找到有关于快速幂算法的一个详细的描述和解释,这里,我给出快速幂算法的完整解释,用的是C语言,不同语言的读者只好换个位啦,毕竟读C的人较多~所谓的快速幂,实际上是快速幂取模的缩写,简单的说,就是快速的求一个幂式的模(余)。在程序设计过程中,经常要去求一些大数对于某个数的余数,为了得到更快、计算范围更大的算法,产生了快速幂取模算法。[有读者反映在讲快速幂部转载 2015-02-09 22:04:59 · 429 阅读 · 0 评论 -
组合数取模
组合数取模在ACM竞赛中是一个很重要的问题,很多选手因为数据太大而束手无策,今天就来详细讲解它。 组合数取模就是求的值,当然根据,和的取值范围不同,采取的方法也不一样。 接下来,我们来学习一些常见的取值情况 (1)和 这个问题比较简单,组合数的计算可以靠杨辉三角,那么由于和的范围小,直接两层循环即可。 (2)转载 2015-02-09 23:11:10 · 408 阅读 · 0 评论 -
ACM--steps--3.3.5--Robberies(01背包)
RobberiesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 398 Accepted Submission(s): 178Problem DescriptionThe aspiring Roy the Robber has原创 2015-02-23 13:34:28 · 310 阅读 · 0 评论 -
ACM--steps--3.3.2--Piggy-Bank(完全背包)
Piggy-BankTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 437 Accepted Submission(s): 240Problem DescriptionBefore ACM can do anything, a原创 2015-02-16 23:03:03 · 292 阅读 · 0 评论 -
ACM--steps--3.3.1--Bone Collector
Bone CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 486 Accepted Submission(s): 239Problem DescriptionMany years ago , in Teddy’原创 2015-02-16 11:36:51 · 367 阅读 · 0 评论 -
ACM--steps--悼念512汶川大地震遇难同胞——珍惜现在,感恩生活(多重背包)
悼念512汶川大地震遇难同胞——珍惜现在,感恩生活Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 375 Accepted Submission(s): 216Problem Description急!灾区的食物依然短缺!为原创 2015-02-21 00:49:54 · 342 阅读 · 0 评论 -
ACM--steps--dp--3.2.2--Super Jumping! Jumping! Jumping!
Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 902 Accepted Submission(s): 519 Problem原创 2015-02-10 22:51:16 · 319 阅读 · 0 评论 -
ACM--steps--3.3.3--Dividing(多重背包)
DividingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 793 Accepted Submission(s): 266 Problem DescriptionMarsha and原创 2015-02-20 02:54:55 · 262 阅读 · 0 评论 -
排序函
MSDN中的定义:templatevoid sort(RanIt first, RanIt last); //--> 1)templatevoid sort(RanIt first, RanIt last, Pred pr); //--> 2)头文件:#include using namespace std;1.默认的sort函数是按升序排。对应于1)转载 2015-02-11 11:18:55 · 303 阅读 · 0 评论 -
ACM--steps--dp--3.2.3--FatMouse's Speed
FatMouse's SpeedTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1036 Accepted Submission(s): 527 Problem DescriptionF原创 2015-02-11 15:01:21 · 394 阅读 · 0 评论 -
ACM--steps--3.2.4--Humble Numbers
Humble NumbersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 914 Accepted Submission(s): 493 Problem DescriptionA nu原创 2015-02-11 23:48:01 · 255 阅读 · 0 评论 -
ACM--steps--3.3.7--Watch The Movie(二维费用背包)
Watch The MovieTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others) Total Submission(s): 528 Accepted Submission(s): 218Problem DescriptionNew semester is coming, a原创 2015-02-25 21:42:38 · 345 阅读 · 0 评论