ACM-数学题
Sky-J
这个作者很懒,什么都没留下…
展开
-
矩阵快速幂模板
Fibonacci Time Limit : 2000/1000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 16 Accepted Submission(s) : 14Problem DescriptionIn the Fibonacci integer s原创 2014-03-27 11:53:18 · 592 阅读 · 0 评论 -
[hdu4965]矩阵快速幂优化 不规则矩阵相乘 模板
自己写的一份,略显臃肿#define DeBUG#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std ;#原创 2014-08-20 16:24:27 · 767 阅读 · 0 评论 -
【HDU1439Cipher】循环群
CipherTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 319 Accepted Submission(s): 141Problem DescriptionBob and Alice started原创 2014-08-09 16:10:27 · 865 阅读 · 0 评论 -
【poj 3128】置换群 循环节
Leonardo's NotebookTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1858 Accepted: 817Description— I just bought Leonardo's secret notebook! Rare objec转载 2014-08-10 15:28:01 · 1404 阅读 · 0 评论 -
[HDU1812]置换群 Polya定理 等价涂色问题详解
Count the TetrisTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1840 Accepted Submission(s): 497Problem Description话说就是因为这个游戏转载 2014-08-09 20:53:52 · 1174 阅读 · 1 评论 -
[HDU3400]三分求极值
Line beltTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2779 Accepted Submission(s): 1061Problem DescriptionIn a two-dimensi转载 2014-08-11 13:43:53 · 608 阅读 · 0 评论 -
HDU2371 矩阵计算转置
#define DeBUG#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std ;#define zero {转载 2014-09-08 16:20:47 · 755 阅读 · 0 评论 -
整数拆分
转自:http://blog.chinaunix.net/uid-26548237-id-3503956.html 整数划分问题是算法中的一个经典命题之一,有关这个问题的讲述在讲解到递归时基本都涉及到。 所谓整数划分,是指把一个正整数n写成如下形式: n=m1+m2+m3+....+mi;(其中mi为正整数,并且1 如果{m1,m2,m3,....,mi}中的最大转载 2014-08-26 11:49:20 · 603 阅读 · 0 评论 -
【HDU4937】x表示为n进制下特征数字的个数(质因数分解法)
Lucky NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 856 Accepted Submission(s): 261Problem Description“Ladies and G转载 2014-08-13 19:43:23 · 722 阅读 · 0 评论 -
[HDU4990] 等比公式+取模运算公式 或矩阵求递推法~
Reading comprehensionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 384 Accepted Submission(s): 185Problem DescriptionRead t原创 2014-09-10 14:23:03 · 1423 阅读 · 0 评论 -
【HDU4944】预处理(类似素数筛选)
FSF’s gameTime Limit: 9000/4500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 443 Accepted Submission(s): 211Problem DescriptionFSF has program转载 2014-08-13 20:51:54 · 559 阅读 · 0 评论 -
[UVA 10294] polya定理 可循环翻转项链手镯问题
Arif in Dhaka (First Love Part 2)Input: standard inputOutput: standard outputTime Limit: 2 seconds Our hero Arif is now in Dhaka (Look at problem 10244 – First Love if you want to know more转载 2014-08-15 17:11:06 · 1299 阅读 · 0 评论 -
【HDU2888】BurningSide定理+因子分解+求逆元+矩阵快速幂
Magic BraceletTime Limit: 2000MS Memory Limit: 131072KTotal Submissions: 4466 Accepted: 1458DescriptionGinny’s birthday is coming soon. Harry Potter is preparing转载 2014-08-16 11:53:01 · 678 阅读 · 0 评论 -
[poj1721]置换群循环节
#define DeBUG#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std ;#define zero {原创 2014-08-16 20:21:59 · 653 阅读 · 0 评论 -
【HDU2865】构造矩阵+Burnside定理+欧拉函数类似poj2888
Birthday ToyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 466 Accepted Submission(s): 238Problem DescriptionAekdyCoin loves转载 2014-08-16 16:29:42 · 801 阅读 · 0 评论 -
【HDU3923】类似uva10294项链种类polya计数+逆元
InvokerTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 122768/62768 K (Java/Others)Total Submission(s): 1106 Accepted Submission(s): 465Problem DescriptionOn of Vance's favo原创 2014-08-15 20:11:49 · 661 阅读 · 0 评论 -
【HDU4910】高效判大素数
Problem about GCDTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 476 Accepted Submission(s): 81Problem DescriptionGiven integ原创 2014-08-08 23:26:09 · 762 阅读 · 0 评论 -
[HDU1370]中国剩余定理版
BiorhythmsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1734 Accepted Submission(s): 736Problem DescriptionSome people beli原创 2014-08-01 22:12:48 · 490 阅读 · 0 评论 -
【HDU4919】递推java大数 递归优化
Exclusive orTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 391 Accepted Submission(s): 167Problem DescriptionGiven n, find原创 2014-08-06 16:30:04 · 725 阅读 · 0 评论 -
n!分解质因数、因数
Problem J Time Limit : 4000/2000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 90 Accepted Submission(s) : 17Font: Times New Roman | Verdana | Georgia Font S原创 2014-03-30 10:38:41 · 889 阅读 · 0 评论 -
校赛1 0-1分数规划 二分+贪心
超级项链 Time Limit : 20000/10000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 80 Accepted Submission(s) : 22Font: Times New Roman | Verdana | Georgia Font Size原创 2014-05-14 14:46:08 · 645 阅读 · 0 评论 -
HDU3853概率DP
LOOPSTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 1850 Accepted Submission(s): 726Problem DescriptionAkemi Homura is a Mahou原创 2014-06-23 15:36:45 · 488 阅读 · 0 评论 -
Hdu 3929 Big Coefficients (容斥原理 二项式性质)
转:http://blog.csdn.net/whyorwhnt/article/details/22320389二项式定理有两个性质,这题只用到第一个。性质1:若k表示把n转为二进制后所有位中1的个数,则(1 + x) ^ n中系数为奇数的个数为2 ^ k。性质2:(1 + x) ^ n中的系数中 所有奇系数之和等于偶系数之和等于 2^(n-1)以下内容参考了转载 2014-06-25 13:06:07 · 507 阅读 · 0 评论 -
HDU2841容斥原理+两种求质数对算法
Visible TreesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1356 Accepted Submission(s): 560Problem DescriptionThere are many tr原创 2014-06-25 20:54:15 · 982 阅读 · 0 评论 -
关于取模
很多地方用到模运算,这里说明模运算的一些规律,并加以证明。 后续会对这些理论实际的应用加以记录和说明。1. 模运算是取余运算(记做 % 或者 mod),具有周期性的特点。 m%n的意思是n除m后的余数,当m递增时m%n呈现周期性特点,并且n越大,周期越长,周期等于n。 例如 0 % 20 = 0,1 % 20 = 1, 2 % 20 = 2, 3 % 20 =原创 2014-06-25 12:36:41 · 1374 阅读 · 0 评论 -
TJU 4087组合数打表快速幂容斥原理
4087. boxTime Limit: 1.0 Seconds Memory Limit:65536KTotal Runs: 119 Accepted Runs:32Tuhao and his two small partners participated in the tournament.But in the end, they l原创 2014-06-25 16:40:17 · 582 阅读 · 0 评论 -
HDU4135容斥原理递归与非递归版
Co-primeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1207 Accepted Submission(s): 440Problem DescriptionGiven a number N, you原创 2014-06-25 14:29:59 · 714 阅读 · 0 评论 -
HDU1695素数打表欧拉函数容斥原理(再看)
转自:http://blog.csdn.net/shiren_bod/article/details/5787722题意:已知给定k,x,y求 1 大体思路: 枚举[1..y]中每个数i 判断[1..min(x,i)]中有多少数与i互质,统计个数。(注意,枚举的是比较大的区间[1..y])。 显然如果i是质数,则[1..min(x,i)]转载 2014-07-05 21:58:41 · 697 阅读 · 0 评论 -
矩阵快速幂求递推式
Problem I Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/65536K (Java/Other)Total Submission(s) : 35 Accepted Submission(s) : 13Font: Times New Roman | Verdana | Georgia Font S原创 2014-07-04 21:45:29 · 560 阅读 · 0 评论 -
cf 258 E - Devu and Flowers 容斥+组合数取模(lucas定理)
zg题目链接:http://codeforces.com/contest/451/problem/E 题目大意:给n个花坛,每个有f[i]朵花,相同花坛花的颜色相同,不同花坛颜色不同,问取恰好s朵花的取法共多少种(n,f[i],s分别为20,1e12,1e14)题解:一开始看这个题确实没什么思路,用一般背包的思路去想的话思考的角度是“如何在每转载 2014-07-26 17:01:59 · 677 阅读 · 0 评论 -
HDU2519组合数快速算法
#define DeBUG#include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std ;#define zero {0}#define原创 2014-02-02 16:04:54 · 743 阅读 · 0 评论 -
【HDU 3037】大数组合取模之Lucas定理+扩展欧几里得求逆元与不定方程一类问题
Saving BeansTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2284 Accepted Submission(s): 828Problem DescriptionAlthough winte转载 2014-07-26 22:28:02 · 941 阅读 · 0 评论 -
HDU3723 组合数+卡特兰数+java大数
Delta WaveTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 706 Accepted Submission(s): 228Problem DescriptionA delta wave is a hig原创 2014-07-12 19:41:34 · 708 阅读 · 0 评论 -
[HDU3826]Squarefree number平方因子分解
Squarefree numberTime Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2119 Accepted Submission(s): 549Problem DescriptionIn mathe原创 2014-07-30 14:55:50 · 751 阅读 · 0 评论 -
simpson求积分,二分加速提高精度
#include#includeconst double eps = 1e-8;inline double jue(double a){ return a > 0 ? a : -a;}int dbcmp(double a){ if (a > eps)return 1; if (a < (-eps)) return -1; return 0;}tem原创 2014-10-06 11:50:53 · 854 阅读 · 0 评论