数论
文章平均质量分 74
bobten2008
这个作者很懒,什么都没留下…
展开
-
POJ 1091 跳蚤
跳蚤Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3977 Accepted: 1002DescriptionZ城市居住着很多只跳蚤。在Z城市周六生活频道有一个娱乐节目。一只跳蚤将被请上一个高空钢丝的正中央。钢丝很长,可以看作是无限长。节目主持人会给该原创 2009-08-22 22:14:00 · 5136 阅读 · 8 评论 -
【网易有道10年编程赛 网络热身赛】第三题 Sibonacci
菲波那切数列可以用下列的式子表示: f(1)=1 f(2)=1 f(n)=f(n-1)+f(n-2) (n>=3) 现在我们根据这个规则定义另一种数列 命名为"辛波那切数列", 它是这样定义的: s(x)=0 (x s(x)=1 (0 s(x)=s(x-1)+s(x-3.14) (x>=1) 现在需要计算出s(x) MOD 1000000007的值。 输入 第一行有一个正整数T表示有T组测试数据。 接下来T行,每行包含一个数x。原创 2010-05-31 11:02:00 · 805 阅读 · 0 评论 -
POJ 1930 Dead Fraction
Dead FractionTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 1198 Accepted: 354DescriptionMike is frantically scrambling to finish his thesis at the la原创 2009-12-12 15:30:00 · 1901 阅读 · 0 评论 -
POJ 1977 Odd Loving Bakers
Odd Loving BakersTime Limit: 2000MS Memory Limit: 30000KTotal Submissions: 1372 Accepted: 429DescriptionThere is a group of N bakers in the town of Utopia. These ba原创 2009-12-05 11:34:00 · 900 阅读 · 0 评论 -
POJ 1906 Three Powers
Three powersTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 3299 Accepted: 1405DescriptionConsider the set of all non-negative integer powers of 3. S = {原创 2009-11-28 11:20:00 · 974 阅读 · 0 评论 -
POJ 1811 Prime Test
Prime TestTime Limit: 6000MS Memory Limit: 65536KTotal Submissions: 15434 Accepted: 2909Case Time Limit: 4000MSDescriptionGiven a big integer number, you are原创 2009-11-27 21:21:00 · 2291 阅读 · 7 评论 -
POJ 1894 Alternative Scale of Notation
Alternative Scale of NotationTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 1530 Accepted: 538DescriptionOne may define a map of strings over an alphab原创 2009-11-21 23:06:00 · 1133 阅读 · 0 评论 -
POJ 1728 A flea on a chessboard
A flea on a chessboardTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 1509 Accepted: 491DescriptionAn infinite chessboard is obtained by extending a finit原创 2009-11-18 20:29:00 · 1004 阅读 · 0 评论 -
POJ 1715 Hexadecimal Numbers
Hexadecimal NumbersTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 1489 Accepted: 347DescriptionThe base of the hexadecimal system is 16. In order to w原创 2009-11-17 20:09:00 · 1277 阅读 · 0 评论 -
POJ 1730 Perfect Pth Powers
Perfect Pth PowersTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9722 Accepted: 2139DescriptionWe say that x is a perfect square if, for some integer b,原创 2009-11-18 22:26:00 · 1162 阅读 · 0 评论 -
POJ 1702 Eva's Balance
Evas BalanceTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2889 Accepted: 1424DescriptionEva has a balance with 20 poises. The weights of the poises are原创 2009-11-16 20:54:00 · 745 阅读 · 0 评论 -
POJ 1152 An Easy Problem
An Easy Problem!Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6264 Accepted: 1429DescriptionHave you heard the fact "The base of every normal number原创 2009-09-28 12:51:00 · 1093 阅读 · 0 评论 -
POJ 1142 Smith Numbers
Smith NumbersTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7141 Accepted: 2505DescriptionWhile skimming his phone directory in 1982, Albert Wilansky,原创 2009-09-25 22:03:00 · 1186 阅读 · 0 评论 -
POJ 1090 Chain 递推 + 大数加法
ChainTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2025 Accepted: 684DescriptionByteland had not always been a democratic country. There were also bl原创 2009-08-22 14:02:00 · 2268 阅读 · 0 评论 -
【网易有道10年编程赛 网络热身赛】第二题
描述 计算a的b次方对9907取模的值。 输入 第一行有一个正整数T,表示有T组测试数据。 接下来T行,每行是一组测试数据,包含两个整数a和b。 其中T输出 有T行,依次输出每组数据的结果。 样例输入 3 1 2 2 3 3 4 样例输出 1 8 81 /*快速模指幂,哈哈,用了自己以前写的一个模板*/#include #include #include using namespace std;/原创 2010-05-31 11:00:00 · 905 阅读 · 0 评论