![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数学
文章平均质量分 74
my_acm
这个作者很懒,什么都没留下…
展开
-
poj 1850(组合数学)
CodeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 8050 Accepted: 3772DescriptionTransmitting and memorizing information is a task that requires differ转载 2014-08-03 17:33:59 · 484 阅读 · 0 评论 -
ACM三大常用博弈
尼姆博弈(Nimm Game)http://baike.baidu.com/link?url=QITS5sNMwXZsoxh5tAwYBsa-_GgUd66Vb4fjreoKkqlXmXSyPEE5qVXfxnq1IGRe4AgTxC6lFwROoKx7hZNwbK威佐夫博弈(Wythoff Game)http://baike.baidu.com/link?ur原创 2015-02-04 14:25:05 · 1913 阅读 · 0 评论 -
hdu 5100
ChessboardTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 271 Accepted Submission(s): 144Problem DescriptionConsider the prob原创 2014-11-09 20:12:11 · 595 阅读 · 0 评论 -
poj 2891
Strange Way to Express IntegersTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 10123 Accepted: 3075DescriptionElina is reading a book written by Ruji原创 2014-08-14 22:18:35 · 582 阅读 · 0 评论 -
poj 1061(扩展欧几里得)
青蛙的约会Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 90299 Accepted: 16412Description两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上,于是它们约定各自朝西跳,直到碰面原创 2014-08-14 10:34:31 · 592 阅读 · 0 评论 -
poj 3273(原来以为是dp呢,居然是二分)
Monthly ExpenseTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 14719 Accepted: 5895DescriptionFarmer John is an astounding accounting wizard and has rea原创 2014-08-09 20:22:48 · 529 阅读 · 0 评论 -
poj 3122
PieTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10309 Accepted: 3651 Special JudgeDescriptionMy birthday is coming up and traditionally I'm servi原创 2014-08-09 15:49:58 · 713 阅读 · 0 评论 -
poj 3258(二分)
River HopscotchTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 7000 Accepted: 3029DescriptionEvery year the cows hold an event featuring a peculiar vers原创 2014-08-09 21:54:45 · 506 阅读 · 0 评论 -
poj 1905(二分)
Expanding RodsTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 11537 Accepted: 2986DescriptionWhen a thin rod of length L is heated n degrees, it expands原创 2014-08-09 19:36:13 · 549 阅读 · 0 评论 -
poj 2115 (数论之扩展欧几里得算法)
C LooooopsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17736 Accepted: 4598DescriptionA Compiler Mystery: We are given a C-language style for loop of原创 2014-08-08 19:40:14 · 702 阅读 · 0 评论 -
poj 1845(等比数列前n项和及快速幂)
SumdivTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 13959 Accepted: 3433DescriptionConsider two natural numbers A and B. Let S be the sum of all natur原创 2014-08-09 10:13:05 · 858 阅读 · 0 评论 -
poj 2635
The Embarrassed CryptographerTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 12076 Accepted: 3224DescriptionThe young and very promising cryptographer O原创 2014-08-06 22:20:57 · 698 阅读 · 0 评论 -
求乘法逆元
乘法逆元的求法 2013-05-15 13:35:06| 分类:数论|举报|字号 订阅 乘法逆元的求法对于不定整数方程pa+qb=c,若 c mod Gcd(a, b)=0,则该方程存在整数解,否则不存在整数解。在找到p * a+q * b = Gcd(a, b)的一组解p0,q0后,p * a+q * b = Gcd(a, b)的其他整转载 2014-08-07 18:59:27 · 2955 阅读 · 0 评论 -
poj 2973(01规划)
Dropping testsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6106 Accepted: 2117DescriptionIn a certain course, you take n tests. If you get ai out of原创 2014-08-19 19:45:12 · 639 阅读 · 0 评论 -
poj 3252(详解)
Round NumbersTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8772 Accepted: 3094DescriptionThe cows, as you know, have no fingers or thumbs and thus are原创 2014-08-05 20:38:58 · 674 阅读 · 0 评论 -
poj 1942(详解)
Paths on a GridTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 21439 Accepted: 5259DescriptionImagine you are attending your math lesson at school. Once原创 2014-08-04 14:08:13 · 1462 阅读 · 1 评论 -
poj 1019
Number SequenceTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 33838 Accepted: 9679DescriptionA single positive integer i is given. Write a program to f原创 2014-08-04 19:32:10 · 527 阅读 · 0 评论 -
poj 1265(pick定理和三角形面积)
AreaTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4805 Accepted: 2175DescriptionBeing well known for its highly innovative products, Merck would defin转载 2014-08-03 22:46:17 · 539 阅读 · 0 评论 -
买不到的数目
问题描述小明开了一家糖果店。他别出心裁:把水果糖包成4颗一包和7颗一包的两种。糖果不能拆包卖。小朋友来买糖的时候,他就用这两种包装来组合。当然有些糖果数目是无法组合出来的,比如要买 10 颗糖。你可以用计算机测试一下,在这种包装情况下,最大不能买到的数量是17。大于17的任何数字都可以用4和7组合出来。本题的要求就是在已知两个包装的数量时,求最大不能组合出的数字原创 2015-03-07 16:04:30 · 698 阅读 · 0 评论