数学专题
理想主义文艺青年
理想主义源于对生活的憧憬 文艺是对生活的态度
展开
-
light oj 1284 - Lights inside 3D Grid(求期望)
1284 - Lights inside 3D GridPDF (English)StatisticsForumTime Limit: 4 second(s)Memory Limit: 32 MBYou are given a 3D grid, which has dimensions X, Y and原创 2015-07-23 16:21:38 · 659 阅读 · 0 评论 -
CF 547 C Mike and Foam(容斥原理)
C. Mike and Foamtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMike is a bartender at Rico's bar. At Rico原创 2015-05-28 01:36:46 · 1702 阅读 · 0 评论 -
poj 2992 Divisors(求因子个数)
欢迎参加hihoCoder挑战赛10!Language:DefaultDivisorsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10784 Accepted: 3193DescriptionYour task原创 2015-04-17 13:07:08 · 672 阅读 · 0 评论 -
poj 2478 Farey Sequence(递推求欧拉函数)
Language:DefaultFarey SequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12750 Accepted: 4971DescriptionThe Farey Sequence Fn for any integer原创 2015-04-10 00:28:03 · 668 阅读 · 0 评论 -
poj 2429 GCD & LCM Inverse(拉宾米勒测试+大数分解+dfs)
Language:DefaultGCD & LCM InverseTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 10452 Accepted: 1923DescriptionGiven two positive integers a and原创 2015-04-09 23:06:31 · 679 阅读 · 0 评论 -
poj 1811 Prime Test(拉宾米勒测试+大数分解)
Language:DefaultPrime TestTime Limit: 6000MS Memory Limit: 65536KTotal Submissions: 29969 Accepted: 7647Case Time Limit: 4000MSDescriptionGiven a big原创 2015-04-09 22:57:17 · 970 阅读 · 0 评论 -
zoj 3868 GCD Expectation(数学)
ZOJ Problem Set - 3868GCD ExpectationTime Limit: 4 Seconds Memory Limit: 262144 KBEdward has a set of n integers {a1, a2,...,an}. He randomly picks a nonempty subset {x1, x2,…,xm} (原创 2015-04-15 12:23:36 · 715 阅读 · 0 评论 -
fzu Problem 1759 Super A^B mod C(快速幂取模+欧拉函数)
题目链接:传送门乍看之下有点像普通的快速幂取模 但是给的B的值太大 所以是根本无法解决的。。。但是 有一个公式 a^x mod(c)=a^(x mod phi(c) +phi(c)) mod(c) (x>=phi(c))相关介绍请看AC大神 传送门#include #include #include #include #include #include #includ原创 2015-04-08 10:09:45 · 735 阅读 · 0 评论 -
解特殊不定方程:毕达哥拉斯三元组
毕达哥拉斯三元组:x*x+y*y=z*z定理:正整数x,y,z构成一个本原毕达哥拉斯三元组且y为偶数 当且仅当存在互素的正整数m,n(m>n) 其中m为奇数n为偶数或者m为偶数n为奇数(奇偶性不同)并且满足:x=m*m-n*ny=2*m*nz=m*m+n*npoj 1305 Fermat vs. PythagorasTime Lim原创 2015-04-07 23:56:47 · 2598 阅读 · 0 评论 -
组合数学 之 母函数2
hdu 1709就是给定n种质量的砝码原创 2014-11-16 00:56:34 · 776 阅读 · 0 评论 -
组合数学之 母函数
母函数当中经典的问题 正是整数拆分 所谓整数拆分即把整数分解成若干整数的和(相当于把n个无区别的球放到n个无标志的盒子,盒子允许空,也允许放多于一个球)。整数拆分成若干整数的和,办法不一,不同拆分法的总数叫做拆分数。原创 2014-11-14 21:25:51 · 1078 阅读 · 0 评论 -
light oj 1038 - Race to 1 Again(概率dp求期望 记忆化搜索)
1038 - Race to 1 AgainPDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBRimi learned a new thing about integers, which is - any posi原创 2015-06-04 23:06:32 · 705 阅读 · 0 评论 -
light oj A Dangerous Maze(概率dp求期望)
1030 - Discovering GoldPDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBYou are in a cave, a long cave! The cave can be represented原创 2015-06-04 22:55:34 · 639 阅读 · 0 评论 -
poj 3374 Cake Share(Farey序列第k大)
Language:DefaultCake ShareTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3157 Accepted: 833DescriptionUpdog prepared to enjoy his delicious suppe原创 2015-05-23 19:10:03 · 1035 阅读 · 0 评论 -
light oj 1027 A Dangerous Maze(期望)
1027 - A Dangerous MazePDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBYou are in a maze; seeing n doors in front of you in beginn原创 2015-06-04 22:51:27 · 452 阅读 · 0 评论 -
poj 2065 SETI(高斯消元 解同于方程组)
北京大学ACM/ICPC竞赛训练暑期课面向全球招生,欲报名从速!Language:DefaultSETITime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 1638 Accepted: 1023DescriptionFor原创 2015-05-23 00:23:16 · 858 阅读 · 0 评论 -
poj 2947 Widget Factory(高斯消元解同余方程组)
Language:DefaultWidget FactoryTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 4856 Accepted: 1669DescriptionThe widget factory produces several di原创 2015-05-23 00:06:22 · 799 阅读 · 0 评论 -
整数拆分 hdu 4651 hdu 4658
hdu 4651 题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4651把数n拆成几个数(小于等于n)相加的形式 问有多少种拆法#include #include #include #include #include #include #include #include #include #define MEM(a,x)原创 2015-05-19 00:34:01 · 980 阅读 · 0 评论 -
hdu 1284 钱币兑换问题(完全背包 母函数)
钱币兑换问题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7270 Accepted Submission(s): 4272Problem Description在一个国家仅有1分,2分,3分硬币,将原创 2015-05-29 20:45:16 · 945 阅读 · 0 评论 -
poj 1091 跳蚤(不定方程+容斥)
跳蚤Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 8731 Accepted: 2605DescriptionZ城市居住着很多只跳蚤。在Z城市周六生活频道有一个娱乐节目。一只跳蚤将被请上一个高空钢丝的正中央。钢丝很长,可以看作是无限长。节目主持人会给该跳原创 2015-04-07 22:13:08 · 779 阅读 · 0 评论 -
poj 2142 The Balance(不定方程)
Language:DefaultThe BalanceTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 4569 Accepted: 1991DescriptionMs. Iyo Kiffa-Australis has a balance and原创 2015-04-07 22:03:52 · 925 阅读 · 0 评论 -
hdu 3579 Hello Kiki(线性同余方程)
Hello KikiTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2336 Accepted Submission(s): 860Problem DescriptionOne day I was sh原创 2015-04-07 00:38:30 · 789 阅读 · 0 评论 -
poj 1061 青蛙的约会(扩展欧几里德)
Language:Default青蛙的约会Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 94295 Accepted: 17436Description两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一原创 2015-04-04 16:33:48 · 649 阅读 · 0 评论 -
Poj 3090 Visible Lattice Points(欧拉函数)
Language:DefaultVisible Lattice PointsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5797 Accepted: 3424DescriptionA lattice point (x, y) in th原创 2015-04-10 01:01:06 · 595 阅读 · 0 评论 -
Fib数模n的循环节
对于一个正整数n,我们求Fib数模n的循环节的长度的方法如下: (1)把n素因子分解,即 (2)分别计算Fib数模每个的循环节长度,假设长度分别是 (3)那么Fib模n的循环节长度从上面三个步骤看来,貌似最困难的是第二步,那么我们如何求Fib模的循环节长度呢? 这里有一个优美的定理:Fib数模的最小原创 2015-02-10 23:19:23 · 1109 阅读 · 0 评论 -
hdu 2841 Visible Trees&& hdu 1695 GCD(容斥定理+数论)
hdu 2841原创 2014-11-02 22:08:09 · 1200 阅读 · 0 评论 -
hdu 4135 Co-prime(容斥原理)
Co-primeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1544 Accepted Submission(s): 592Problem DescriptionGiven a number N,原创 2014-11-01 00:43:48 · 1055 阅读 · 0 评论 -
hdu 4451 Dressing
DressingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2659 Accepted Submission(s): 1169Problem DescriptionWangpeng has N cl原创 2014-10-30 23:39:48 · 693 阅读 · 0 评论 -
hdu 1796 How many integers can you find(容斥原理)
How many integers can you findTime Limit: 12000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4303 Accepted Submission(s): 1235Problem Descripti原创 2014-10-30 21:33:28 · 629 阅读 · 0 评论 -
poj 3370 Halloween treats&&poj 2356 Find a multiple
题意就是原创 2014-10-30 00:33:59 · 958 阅读 · 0 评论 -
nefu 84 五指山(扩展欧几里德)
五指山Problem : 84Time Limit : 1000msMemory Limit : 65536Kdescription西游记中孙吾空大闹天宫,如来佛祖前来降伏他,说道:“我与你打个赌赛;你若有本事,一筋斗打出我这右手掌中,算你赢,再不用动刀兵原创 2015-04-04 18:17:24 · 1279 阅读 · 0 评论 -
n!素因子分解中素数p的幂
n!素因子分解中素数p的幂为 [n/p]+[n/(p^2)]+[n/(p^3)]+……nefu 118 传送门n!后面有多少个0Problem : 118Time Limit : 1000msMemory Limit : 65536Kdes原创 2015-04-05 13:59:32 · 2213 阅读 · 0 评论 -
hdu 1573 X问题(线性同余方程)
X问题Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3847 Accepted Submission(s): 1226Problem Description求在小于等于N的正整数中有多少个X满足:X原创 2015-04-07 00:30:04 · 659 阅读 · 0 评论 -
poj 3696 The Luckiest number(欧拉函数+快速幂取模)
Language:DefaultThe Luckiest numberTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4561 Accepted: 1222DescriptionChinese people think of '8' as th原创 2015-04-11 16:47:11 · 750 阅读 · 0 评论 -
poj 1006 Biorhythms(中国剩余定理)
BiorhythmsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 118263 Accepted: 37125DescriptionSome people believe that there are three cycles in a person原创 2015-04-06 00:22:34 · 594 阅读 · 0 评论 -
poj 3358 Period of an Infinite Binary Expansion(欧拉函数+快速幂取模)
Language:DefaultPeriod of an Infinite Binary ExpansionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3124 Accepted: 833DescriptionLet {x} = 0.a1a原创 2015-04-11 16:50:39 · 669 阅读 · 0 评论 -
hdu 2815 Mod Tree(高次同余方程)
Mod TreeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4969 Accepted Submission(s): 1298Problem Description The picture i原创 2015-04-06 00:11:58 · 762 阅读 · 0 评论 -
解高次同余方程的应用
poj 3243Clever YTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 6862 Accepted: 1677DescriptionLittle Y finds there is a very interesting formula原创 2015-04-05 23:53:42 · 785 阅读 · 0 评论 -
poj 2689 Prime Distance
Language:DefaultPrime DistanceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13337 Accepted: 3543DescriptionThe branch of mathematics called numb原创 2015-04-04 23:26:40 · 525 阅读 · 0 评论 -
解线性同余方程的应用
poj 2891 Strange Way to Express IntegersTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 10873 Accepted: 3324DescriptionElina is reading原创 2015-04-05 19:20:36 · 690 阅读 · 0 评论