ACM 数论
文章平均质量分 80
neoxuhaotian
爱技术,爱编程,努力的奋斗。。。
展开
-
joj 1019解题报告
<br /> 1019: Do the UntwistResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K992556Standard<br />Cryptography deals with methods of secret communication that transform a message (theplaintext) into a disguised form (the ciphertext) so that no one s原创 2011-01-24 19:06:00 · 802 阅读 · 0 评论 -
poj 2689解题报告(区间筛素数,经典)
<br /> Prime DistanceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4814 Accepted: 1282<br />DescriptionThe branch of mathematics called number theory is about properties of numbers. One of the areas that has captured the interest of number theo原创 2011-02-04 12:32:00 · 3601 阅读 · 2 评论 -
【转】素数总结
<br /><br />定义:除了1和其本身,没有其他约数的数。<br />测试:用n分别试除2到sqrt(n)的数,如果中间有一个能整除,即<br />为合数,否则即为素数<br />bool is_prime(int n)//判断n是否为素数,是素数返回1<br />{<br /> int i;<br /> bool flag = 1;<br /> for(i = 2; i <= sqrt(n); i++)<br /> {<br /> if(n % i == 0){转载 2011-02-04 11:07:00 · 1351 阅读 · 1 评论 -
poj 3641解题报告
Pseudoprime numbersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3611 Accepted: 1285DescriptionFermat's theorem states that for any prime number p and for any integer a > 1, ap = a (mod p). That is, if we raise a to the pth power and divide by原创 2011-02-01 14:01:00 · 3048 阅读 · 0 评论 -
zoj 1312解题报告
<br /> Prime CutsTime Limit: 1 Second Memory Limit: 32768 KB<br />A prime number is a counting number (1, 2, 3, ...) that is evenly divisible only by 1 and itself. In this problem you are to write a program that will cut some number of prime numbers原创 2011-02-01 12:33:00 · 1195 阅读 · 0 评论 -
poj3518解题报告
<br /> Prime GapTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 5323 Accepted: 2988<br />Description<br />The sequence of n − 1 consecutive composite numbers (positive integers that are not prime and not equal to 1) lying between two successive p原创 2011-01-30 21:08:00 · 1982 阅读 · 1 评论 -
poj 2739解题报告
<br /> Sum of Consecutive Prime NumbersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10154 Accepted: 5767<br />DescriptionSome positive integers can be represented by a sum of one or more consecutive prime numbers. How many such representations原创 2011-01-30 20:36:00 · 1363 阅读 · 1 评论 -
poj 1365
<br /> Prime LandTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 1246 Accepted: 556<br />DescriptionEverybody in the Prime Land is using a prime base number system. In this system, each positive integer x is represented as follows: Let {pi}i=0,1,原创 2011-01-30 14:37:00 · 1449 阅读 · 0 评论 -
zoj 1133||joj 1027解题报告
<br /> Smith NumbersTime Limit: 1 Second Memory Limit: 32768 KB<br />While skimming his phone directory in 1982, Albert Wilansky, a mathematician of Lehigh University, noticed that the telephone number of his brother-in-law H. Smith had the followin原创 2011-01-27 17:57:00 · 1549 阅读 · 0 评论 -
poj 1811解题报告
<br /> Prime TestTime Limit: 6000MS Memory Limit: 65536KTotal Submissions: 17747 Accepted: 3644Case Time Limit: 4000MS<br />DescriptionGiven a big integer number, you are required to find out whether it's a prime number.<br />InputThe first line contains原创 2011-02-02 17:42:00 · 1491 阅读 · 1 评论