OJ
alw_123
码农一只
展开
-
HDOJ--Digital Roots
Problem Description The digital root of a positive integer is found by summing the digits of the integer.If the resulting value is a single digit then that digit is the digital root.If the resulting v原创 2016-05-31 20:20:19 · 433 阅读 · 0 评论 -
HDOJ_Easier Done Than Said
Problem Description Password security is a tricky thing.Users prefer simple passwords that are easy to remember(like buddy), but such passwords are often insecure.Some sites use random computer - gene原创 2016-07-04 16:07:25 · 335 阅读 · 0 评论 -
HDOJ_Binary Numbers
Problem Description Given a positive integer n, find the positions of all 1’s in its binary representation. The position of the least significant bit is 0.ExampleThe positions of 1’s in the binary rep原创 2016-07-04 16:04:14 · 363 阅读 · 0 评论 -
HDOJ_Tempter of the Bone
OJ_Tempter of the BoneProblem Description The doggie found a bone in an ancient maze, which fascinated him a lot.However, when he picked it up, the maze began to shake, and the doggie could feel the g原创 2016-06-14 19:12:58 · 281 阅读 · 0 评论 -
HDOJ_Prime Ring Problem
OJ_Prime Ring ProblemProblem Description A ring is compose of n circles as shown in diagram.Put natural number 1, 2, …, n into each circle separately, and the sum of numbers in two adjacent circles sh原创 2016-06-14 19:15:22 · 434 阅读 · 0 评论 -
HDOJ_Humble Numbers
HDOJ_Humble NumbersProblem Description A number whose only prime factors are 2, 3, 5 or 7 is called a humble number.The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 25, 27,原创 2016-06-14 19:35:06 · 411 阅读 · 0 评论 -
HDOJ_Number Sequence
HDOJ_Number SequenceProblem Description A number sequence is defined as follows :f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.Given A, B, and n, you are to calculate the value of f(n原创 2016-06-14 19:29:57 · 373 阅读 · 0 评论 -
HDOJ_Who's in the Middle
Problem Description FJ is surveying his herd to find the most average cow.He wants to know how much milk this ‘median’ cow gives : half of the cows give as much or more than the median; half give as m原创 2016-06-14 19:10:09 · 320 阅读 · 0 评论 -
HDOJ--Rightmost Digit
Problem Description Given a positive integer N, you should output the most right digit of N^N.Input The input contains several test cases.The first line of the input is a single integer T which is th原创 2016-05-31 21:10:39 · 404 阅读 · 0 评论 -
HDOJ--Least Common Multiple
Problem Description The least common multiple(LCM) of a set of positive integers is the smallest positive integer which is divisible by all the numbers in the set.For example, the LCM of 5, 7 and 15 i原创 2016-05-31 20:28:50 · 371 阅读 · 0 评论 -
HDOJ--Fibonacci Again
Problem Description There are another kind of Fibonacci numbers : F(0) = 7, F(1) = 11, F(n) = F(n - 1) + F(n - 2) (n >= 2).Input Input consists of a sequence of lines, each containing an integer n. (原创 2016-05-31 20:24:22 · 301 阅读 · 0 评论 -
HDOJ_A hard puzzle
Problem Description lcy gives a hard puzzle to feng5166, lwg, JGShining and Ignatius : gave a and b, how to know the a^b.everybody objects to this BT problem, so lcy makes the problem easier than begi原创 2016-07-04 16:10:11 · 316 阅读 · 0 评论