数论
文章平均质量分 80
lulining
这个作者很懒,什么都没留下…
展开
-
poj3252
Round NumbersDescriptionThe cows, as you know, have no fingers or thumbs and thus are unable to play Scissors, Paper, Stone' (also known as 'Rock, Paper, Scissors', 'Ro, Sham, Bo', and a host翻译 2012-07-09 22:24:57 · 288 阅读 · 0 评论 -
poj3112
PieDescriptionMy birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I have a number N of them, of various tastes and of various sizes. F of my friends are coming翻译 2012-07-09 20:13:35 · 367 阅读 · 0 评论 -
poj1850
CodeDescriptionTransmitting and memorizing information is a task that requires different coding systems for the best use of the available space. A well known system is that one where a number翻译 2012-07-09 19:22:26 · 512 阅读 · 0 评论 -
poj1286
Necklace of BeadsDescriptionBeads of red, blue or green colors are connected together into a circular necklace of n beads ( n < 24 ). If the repetitions that are produced by rotation around th翻译 2012-07-09 12:37:08 · 500 阅读 · 0 评论 -
poj3518
Prime GapDescriptionThe sequence of n − 1 consecutive composite numbers (positive integers that are not prime and not equal to 1) lying between two successive prime numbers p and p + n is call翻译 2012-07-09 10:48:39 · 397 阅读 · 0 评论 -
poj1595
Prime CutsDescriptionA 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 p翻译 2012-07-08 22:24:49 · 488 阅读 · 0 评论 -
poj3126
Prime PathDescriptionThe ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-digit room numbers on their off翻译 2012-07-09 10:13:40 · 465 阅读 · 0 评论 -
poj2356
Find a multipleDescriptionThe input contains N natural (i.e. positive integer) numbers ( N <= 10000 ). Each of that numbers is not greater than 15000. This numbers are not necessarily differen翻译 2012-07-08 21:03:35 · 573 阅读 · 0 评论 -
poj3273
Monthly ExpenseDescriptionFarmer John is an astounding accounting wizard and has realized he might run out of money to run the farm. He has already calculated and recorded the exact amount of翻译 2012-07-10 00:47:16 · 678 阅读 · 0 评论 -
poj3641
Pseudoprime numbersDescriptionFermat'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 p, the remain翻译 2012-07-10 13:33:56 · 455 阅读 · 0 评论 -
poj1681
Painter's ProblemDescriptionThere is a square wall which is made of n*n small square bricks. Some bricks are white while some bricks are yellow. Bob is a painter and he wants to paint all the翻译 2012-07-12 19:15:53 · 645 阅读 · 0 评论 -
poj1222
EXTENDED LIGHTS OUTDescriptionIn an extended version of the game Lights Out, is a puzzle with 5 rows of 6 buttons each (the actual puzzle has 5 rows of 5 buttons each). Each button has a light翻译 2012-07-12 10:09:44 · 438 阅读 · 0 评论 -
poj3292
Semi-prime H-numbersDescriptionThis problem is based on an exercise of David Hilbert, who pedagogically suggested that one study the theory of 4n+1 numbers. Here, we do only a bit of that.An翻译 2012-07-11 14:49:57 · 494 阅读 · 0 评论 -
poj1845
SumdivDescriptionConsider two natural numbers A and B. Let S be the sum of all natural divisors of A^B. Determine S modulo 9901 (the rest of the division of S by 9901).InputThe only li翻译 2012-07-11 16:31:23 · 536 阅读 · 0 评论 -
poj1942
Paths on a GridDescriptionImagine you are attending your math lesson at school. Once again, you are bored because your teacher tells things that you already mastered years ago (this time he's翻译 2012-07-11 11:17:09 · 921 阅读 · 2 评论 -
poj1721
CARDSDescriptionAlice and Bob have a set of N cards labelled with numbers 1 ... N (so that no two cards have the same label) and a shuffle machine. We assume that N is an odd integer. The sh翻译 2012-07-11 09:59:06 · 459 阅读 · 0 评论 -
poj2689
Prime DistanceDescriptionThe branch of mathematics called number theory is about properties of numbers. One of the areas that has captured the interest of number theoreticians for thousands of翻译 2012-07-10 23:05:32 · 386 阅读 · 0 评论 -
poj3370
Halloween treatsDescriptionEvery year there is the same problem at Halloween: Each neighbour is only willing to give a certain total number of sweets on that day, no matter how many children c翻译 2012-07-08 20:22:43 · 910 阅读 · 0 评论 -
poj2142
The BalanceDescriptionMs. Iyo Kiffa-Australis has a balance and only two kinds of weights to measure a dose of medicine. For example, to measure 200mg of aspirin using 300mg weights and 700mg翻译 2012-07-08 18:41:04 · 538 阅读 · 0 评论 -
poj3070
FibonacciDescriptionIn the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 2 for n ≥ 2. For example, the first ten terms of the Fibonacci sequence are:0, 1, 1, 2, 3, 5翻译 2012-07-05 22:12:29 · 515 阅读 · 0 评论 -
poj2034
Anti-prime SequencesDescriptionGiven a sequence of consecutive integers n,n+1,n+2,...,m, an anti-prime sequence is a rearrangement of these integers so that each adjacent pair of integers su翻译 2012-07-06 20:56:49 · 366 阅读 · 0 评论 -
poj1061
青蛙的约会Description两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上,于是它们约定各自朝西跳,直到碰面为止。可是它们出发之前忘记了一件很重要的事情,既没有问清楚对方的特征,也没有约定见面的具体位置。不过青蛙们都是很乐观的,它们觉得只要一直朝着某个方向跳下去,总能碰到对方的。但是除非这两只青蛙在同一时间跳到同一点上,不然翻译 2012-07-04 16:50:44 · 672 阅读 · 1 评论 -
poj1365
Prime LandDescriptionEverybody 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,2,... denote the increa翻译 2012-07-04 07:38:25 · 427 阅读 · 0 评论 -
poj2909
Goldbach's ConjectureDescriptionFor any even number n greater than or equal to 4, there exists at least one pair of prime numbers p1 and p2 such thatn = p1 + p2This conjecture has not been翻译 2012-07-05 19:32:50 · 668 阅读 · 0 评论 -
poj1142
Smith NumbersDescriptionWhile 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 t翻译 2012-07-05 09:06:49 · 453 阅读 · 0 评论 -
poj1284
Primitive RootsDescriptionWe say that integer x, 0 i mod p) | 1 <= i <= p-1 } is equal to { 1, ..., p-1 }. For example, the consecutive powers of 3 modulo 7 are 3, 2, 6, 4, 5, 1, and thus 3 is翻译 2012-07-04 09:09:33 · 419 阅读 · 0 评论 -
poj2262
Goldbach's ConjectureDescriptionIn 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the following conjecture: Every even number grea翻译 2012-07-05 10:34:50 · 598 阅读 · 0 评论 -
poj2478
Farey SequenceDescriptionThe Farey Sequence Fn for any integer n with n >= 2 is the set of irreducible rational numbers a/b with 0 F2 = {1/2} F3 = {1/3, 1/2, 2/3} F4 = {1/4, 1/3, 1/2, 2/翻译 2012-07-05 11:30:54 · 602 阅读 · 0 评论 -
poj2115
C LooooopsDescriptionA Compiler Mystery: We are given a C-language style for loop of type for (variable = A; variable != B; variable += C) statement;I.e., a loop which starts by s翻译 2012-07-05 09:50:29 · 467 阅读 · 0 评论 -
poj1026
CipherDescriptionBob and Alice started to use a brand-new encoding scheme. Surprisingly it is not a Public Key Cryptosystem, but their encoding and decoding is based on secret keys. They cho翻译 2012-07-03 21:09:45 · 425 阅读 · 0 评论 -
poj2470
Longge's problemDescriptionLongge is good at mathematics and he likes to think about hard mathematical problems which will be solved by some graceful algorithms. Now a problem comes: Given an翻译 2012-07-05 16:08:48 · 452 阅读 · 0 评论 -
poj2379
Sum of Consecutive Prime NumbersDescriptionSome positive integers can be represented by a sum of one or more consecutive prime numbers. How many such representations does a given positive翻译 2012-07-05 17:29:15 · 482 阅读 · 0 评论 -
poj2891
Strange Way to Express IntegersDescriptionElina is reading a book written by Rujia Liu, which introduces a strange way to express non-negative integers. The way is described as following:翻译 2012-07-04 22:52:02 · 557 阅读 · 0 评论 -
poj1006
BiorhythmsDescriptionSome people believe that there are three cycles in a person's life that start the day he or she is born. These three cycles are the physical, emotional, and intellectual c翻译 2012-07-04 11:16:23 · 371 阅读 · 0 评论 -
poj2407
RelativesDescriptionGiven n, a positive integer, how many positive integers less than n are relatively prime to n? Two integers a and b are relatively prime if there are no integers x > 1, y >翻译 2012-07-04 09:28:16 · 378 阅读 · 0 评论 -
poj3270
Cow SortingDescriptionFarmer John's N (1 ≤ N ≤ 10,000) cows are lined up to be milked in the evening. Each cow has a unique "grumpiness" level in the range 1...100,000. Since grumpy cows are翻译 2012-07-03 16:40:21 · 482 阅读 · 0 评论 -
poj2409
Let it BeadDescription"Let it Bead" company is located upstairs at 700 Cannery Row in Monterey, CA. As you can deduce from the company name, their business is beads. Their PR department fo翻译 2012-07-03 10:10:29 · 456 阅读 · 0 评论