数论
文章平均质量分 83
KinFungYu
前SCAU ACM校队队员
展开
-
hdu 3049 Data Processing(扩展欧几里德求逆元)
Data ProcessingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 980 Accepted Submission(s): 297Problem DescriptionChinachen is转载 2013-08-03 19:47:39 · 1026 阅读 · 0 评论 -
poj 3358 Period of an Infinite Binary Expansion(欧拉函数+欧拉定理)
Period of an Infinite Binary ExpansionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2769 Accepted: 718DescriptionLet {x} = 0.a1a2a3... be the binary r原创 2013-12-05 22:45:23 · 797 阅读 · 0 评论 -
POJ数学题目(转载)
1.burnside定理,polya计数法 这个大家可以看brudildi的《组合数学》,那本书的这一章写的很详细也很容易理解。最好能完全看懂了,理解了再去做题,不要只记个公式。 *简单题:(直接用套公式就可以了) pku2409 Let it Bead http://acm.pku.edu.cn/JudgeOnline/problem?id=2409转载 2013-11-30 17:39:07 · 608 阅读 · 0 评论 -
poj 1284 Primitive Roots(求原根的个数)
Primitive RootsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2590 Accepted: 1459DescriptionWe say that integer x, 0 i mod p) | 1 <= i <= p-1 } is equal原创 2013-12-03 23:28:33 · 1041 阅读 · 0 评论 -
poj 2773 Happy 2006(求第k个与n互质的数)
Happy 2006Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 8779 Accepted: 2913DescriptionTwo positive integers are said to be relatively prime to each othe原创 2013-12-04 09:02:58 · 1160 阅读 · 0 评论 -
poj 1811 Prime Test(素数判断)
Prime TestTime Limit: 6000MS Memory Limit: 65536KTotal Submissions: 27513 Accepted: 6874Case Time Limit: 4000MSDescriptionGiven a big integer number, you are原创 2013-12-03 17:21:06 · 885 阅读 · 0 评论 -
zoj 2562 More Divisors(反素数)
More DivisorsTime Limit: 2 Seconds Memory Limit: 65536 KB Everybody knows that we use decimal notation, i.e. the base of our notation is 10. Historians say that it is so because men hav原创 2013-12-02 20:50:18 · 931 阅读 · 0 评论 -
poj 2891 Strange Way to Express Integers(解一般模线性方程组)
Strange Way to Express IntegersTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 8764 Accepted: 2650DescriptionElina is reading a book written by Rujia原创 2013-12-08 23:02:51 · 888 阅读 · 0 评论 -
sgu 106 The equation(限制解范围的模线性方程)
106. The equationtime limit per test: 0.5 sec. memory limit per test: 4096 KBThere is an equation ax + by + c = 0. Given a,b,c,x1,x2,y1,y2 you must determine, how many integer roots of this原创 2013-11-30 17:06:05 · 1100 阅读 · 0 评论 -
fzu 1753 Another Easy Problem(n!的素因子分解)
Problem 1753 Another Easy ProblemAccept: 382 Submit: 1731Time Limit: 1000 mSec Memory Limit : 32768 KB Problem Description小TT最近学习了高斯消元法解方程组,现在他的问题来了,如果是以下的方程,那么应该如何解呢?C(n1,m1)=原创 2013-11-29 22:28:05 · 943 阅读 · 0 评论 -
poj 1061 青蛙的约会(扩展欧几里德解不定方程)
青蛙的约会Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 83996 Accepted: 14643Description两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上,于是它们约定各自朝西跳,直到碰面为止原创 2013-11-28 12:26:20 · 2339 阅读 · 0 评论 -
fzu 1402 猪的安家
Problem 1402 猪的安家Accept: 839 Submit: 5341Time Limit: 1000 mSec Memory Limit : 32768 KB Problem DescriptionAndy和Mary养了很多猪。他们想要给猪安家。但是Andy没有足够的猪圈,很多猪只能够在一个猪圈安家。举个例子,假如有16头猪,Andy建了3个猪圈,原创 2013-12-08 23:27:46 · 1005 阅读 · 0 评论