touchwest-CSDN博客

原创 HDU 1022 Train Problem I

Problem Description As the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because the trains in the Ignatius Train Station is

2015-12-30 10:51:25 279

原创 HDU 1021 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 int

2015-12-29 20:47:36 201

原创 HDU 1020 Encoding

Problem Description Given a string containing only 'A' - 'Z', we could encode it using the following method: 1. Each sub-string containing k same characters should be encoded to "kX" where "X"

2015-12-29 20:24:29 207

原创 HDU 1019 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

2015-12-29 20:10:13 213

原创 HDU 1018 Big Number

Problem Description In many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In this problem you ar

2015-12-29 19:22:05 202

原创 HDU 1017 A Mathematical Curiosity

Problem Description In many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In this problem you ar

2015-12-29 17:50:57 285

原创 HDU 1016 Prime Ring Problem

Problem 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 should be a prime

2015-12-29 16:54:31 248

原创 HDU 1015 Safecracker

Problem Description === Op tech briefing, 2002/11/02 06:42 CST === "The item is locked in a Klein safe behind a painting in the second-floor library. Klein safes are extremely rare; most of them,

2015-12-29 08:52:33 174

原创 HDU 1014 Uniform Generator

Problem Description Computer simulations often require random numbers. One way to generate pseudo-random numbers is via a function of the form seed(x+1) = [seed(x) + STEP] % MOD where '%' is

2015-12-28 21:16:23 173

原创 HDU 1013 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 result

2015-12-28 20:53:09 216

原创 HDU 1012 u Calculate e

Problem Description A simple mathematical formula for e is where n is allowed to go to infinity. This can actually yield very accurate approximations of e using relatively small values of n.

2015-12-28 20:29:36 176

原创 HDU 1010 Tempter of the Bone

Problem 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 ground sinking. He re

2015-12-28 18:39:24 234

touchwest的博客