数学
文章平均质量分 55
Sun_AC
充电中……
展开
-
URAL 1903 Unidentified Ships(大数组合数打表取模)
1903. Unidentified ShipsTime limit: 1.0 secondMemory limit: 64 MBThe First Galactic Fleet flagship Eltreum was patrolling near the center of the Milky Way. Unidentified ships appeared in原创 2014-07-18 18:29:05 · 1011 阅读 · 0 评论 -
hdu1695 GCD(莫比乌斯反演)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1695题意原创 2014-09-02 16:00:01 · 704 阅读 · 0 评论 -
HDU 1722 Cake(简单分蛋糕)数学题
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1722原创 2014-08-14 10:31:01 · 1979 阅读 · 0 评论 -
HDU 4291 A Short problem(矩阵快速幂取模求循环节)
A Short problemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1554 Accepted Submission(s): 566Problem Description According to原创 2014-08-09 17:53:38 · 840 阅读 · 0 评论 -
HDU 1705 Count the grid(皮克定理的应用)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1705AC代码:#include struct point{ int x,y; }p[3],m[3];int gcd(int a,int b){ int c; while(b){ c=a%b; a=b; b=c; } return a;}int abs(int原创 2014-08-19 10:33:30 · 1692 阅读 · 0 评论 -
POJ 3404 Bridge over a rough river(数学推理题)
Bridge over a rough riverTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4026 Accepted: 1646DescriptionA group of N travelers (1 ≤ N ≤ 50) has approac原创 2014-08-03 17:39:16 · 1020 阅读 · 0 评论 -
组合数求解的基本函数(待完善)
(1)、C(n,m)=n!/(m!*(n-m)!)=n*(n-1)*(n-2)*……*(n-m+1)/(1*2*3*……*m)原创 2014-07-23 10:54:59 · 752 阅读 · 0 评论 -
HDU 3037 Saving Beans(Lucas的套用)
Saving BeansTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2234 Accepted Submission(s): 812Problem DescriptionAlthough winter is原创 2014-07-23 16:00:49 · 698 阅读 · 0 评论 -
HDU 4349 Xiao Ming's Hope(Lucas定理的推导)
Xiao Ming's HopeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1294 Accepted Submission(s): 875Problem DescriptionXiao Ming like原创 2014-07-23 21:32:30 · 1410 阅读 · 0 评论 -
FZU 2020 组合(Lucas定理的应用)
Problem 2020 组合Accept: 530 Submit: 1323Time Limit: 1000 mSec Memory Limit : 32768 KB Problem Description给出组合数C(n,m), 表示从n个元素中选出m个元素的方案数。例如C(5,2) = 10, C(4,2) = 6.可是当n,m比较大的时候,C(n原创 2014-07-23 14:53:52 · 851 阅读 · 0 评论 -
UVA 12712 Pattern Locker(排列的基本应用)
UVA 12712Pattern LockerMr. Anderson is in a relationship with a very suspicious and jealous girlfriend. She is always checkingAnderson’s phone logs and texts to find out he is up to. Feeling原创 2014-07-02 09:52:41 · 1331 阅读 · 0 评论 -
LightOJ 1005 - Rooks (组合数学dp模拟)
题目链接:http://lightoj.com/volume_showproblem.php?problem=1005题意:n*n的棋盘上放m个车,问有多少种放车的方式使得每个车都不会互相攻击到(即每个车都占有他所在的一行一竖两条直线)思路:这道dp模拟的是组合数学的算法( n行中选出m行,C(n,m),再在n列中选出m列随便放A(n,m),答案为C(n,m)*A(n,m) )原创 2014-11-30 13:18:59 · 1374 阅读 · 0 评论