2017年03月_海岛Blog

原创 POJ NOI MATH-7647 余数相同问题

问题链接：POJ NOI MATH-7647 余数相同问题。总时间限制: 1000ms内存限制: 65536kB描述已知三个正整数 a，b，c。现有一个大于1的整数x，将其作为除数分别除a，b，c，得到的余数相同。请问满足上述条件的x的最小值是多少？数据保证x有解。输入一行，三个不大于1000000的正整数a，b，c，两个整数之间用一个空格隔开。输出

2017-03-31 22:54:39 7423

原创 CCF NOI1000 加密算法

问题链接：CCF NOI1000 加密算法。时间限制: 1000 ms 空间限制: 262144 KB题目描述神龙数码公司设计了一个加密算法：用a代替z,用b代替y，用c代替x,......，用z代替a。现要求输入一个小写字母，对其进行加密输出。输入输入一个小写字母。输出输出加密后的字符。样例输入a样例输出z数据

2017-03-31 21:50:22 3711

原创 Project Euler Problem 27 Quadratic primes

Quadratic primesProblem 27Euler discovered the remarkable quadratic formula:n2+n+41It turns out that the formula will produce 40 primes for the consecutive integer values0≤n≤39.

2017-03-30 19:46:48 962

原创 Project Euler Problem 118 Pandigital prime sets

Pandigital prime setsProblem 118Using all of the digits 1 through 9 and concatenating them freely to form decimal integers, different sets can be formed. Interestingly with the set {2,5,47,8

2017-03-30 18:52:29 1187

原创 Project Euler Problem 36 Double-base palindromes

Double-base palindromesProblem 36The decimal number, 585 = 10010010012 (binary), is palindromic in both bases.Find the sum of all numbers, less than one million, which are palindromic in b

2017-03-30 01:00:00 1144

原创 Project Euler Problem 38 Pandigital multiples

Pandigital multiplesProblem 38Take the number 192 and multiply it by each of 1, 2, and 3:192 × 1 = 192192 × 2 = 384192 × 3 = 576By concatenating each product we get the 1 to 9 pa

2017-03-29 22:00:47 876

原创 Project Euler Problem 104 Pandigital Fibonacci ends

Pandigital Fibonacci endsProblem 104The Fibonacci sequence is defined by the recurrence relation:Fn = Fn−1 + Fn−2, where F1 = 1 and F2 = 1.It turns out that F541, which contains 113

2017-03-29 11:38:13 901 2

原创 Project Euler Problem 32 Pandigital products

Pandigital productsProblem 32We shall say that an n-digit number is pandigital if it makes use of all the digits 1 ton exactly once; for example, the 5-digit number, 15234, is 1 through 5

2017-03-29 06:38:22 1068

原创 Project Euler Problem 41 Pandigital prime

Pandigital primeProblem 41We shall say that an n-digit number is pandigital if it makes use of all the digits 1 ton exactly once. For example, 2143 is a 4-digit pandigital and is also prim

2017-03-28 18:32:56 712 1

原创 Project Euler Problem 34 Digit factorials

Digit factorialsProblem 34145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145.Find the sum of all numbers which are equal to the sum of the factorial of their digits.Note: as 1

2017-03-28 17:48:12 713

原创 UVA10079 Pizza Cutting【水题】

When someone calls Ivan lazy, he claims that it is his intelligence that helps him to be so. If hisintelligence allows him to do something at less physical effort, why should he exert more? He alsoc

2017-03-28 16:53:18 961

原创 UVA100 POJ1207 HDU1032 The 3n + 1 problem【水题】

The 3n + 1 problemTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 59408 Accepted: 18891DescriptionProblems in Computer Science are often classified as b

2017-03-28 16:31:12 1472

原创 Project Euler Problem 23 Non-abundant sums

Non-abundant sumsProblem 23A perfect number is a number for which the sum of its proper divisors is exactly equal to the number. For example, the sum of the proper divisors of 28 would be 1

2017-03-28 09:58:12 830

原创 Project Euler Problem 24 Lexicographic permutations

Lexicographic permutationsProblem 24A permutation is an ordered arrangement of objects. For example, 3124 is one possible permutation of the digits 1, 2, 3 and 4. If all of the permutations

2017-03-28 08:21:42 861

原创 Project Euler Problem 19 Counting Sundays

Counting SundaysProblem 19You are given the following information, but you may prefer to do some research for yourself.1 Jan 1900 was a Monday.Thirty days has September,April, Ju

2017-03-27 04:01:18 955

原创 CCF201703-2 学生排队（100分）

试题编号： 201703-2 试题名称：学生排队时间限制： 1.0s 内存限制： 256.0MB 问题描述：问题描述　　体育老师小明要将自己班上的学生按顺序排队。他首先让学生按学号从小到大的顺序排成一排，学号小的排在前面，然后进行多次调整。一次调整小明可能让一位同学出队，向前或者向后移动一段距离后再插入队列。　　例...

2017-03-26 18:40:03 17805 22

原创 Project Euler Problem 17 Number letter counts

Number letter countsProblem 17If the numbers 1 to 5 are written out in words: one, two, three, four, five, then there are 3 + 3 + 5 + 4 + 4 = 19 letters used in total.If all the numbers fr

2017-03-26 15:56:58 901

试题编号：201703-1试题名称：分蛋糕时间限制：1.0s内存限制：256.0MB问题描述：问题描述　　小明今天生日，他有n块蛋糕要分给朋友们吃，这n块蛋糕（编号为1到n）的重量分别为a1, a2, …, an。小明想分给每个朋友至少重量为k的蛋糕。小明的朋友们已经排好队准备领蛋糕，对于每个朋友，小明总是先将自己手中编号最小的蛋糕分给他，当这个朋友所分得蛋糕的重量不到k时，再继续将剩下的蛋糕中编...

2017-03-25 15:48:11 16738 18

原创 Project Euler Problem 92 Square digit chains

Square digit chainsProblem 92A number chain is created by continuously adding the square of the digits in a number to form a new number until it has been seen before.For example,44 → 32

2017-03-25 08:37:03 1012 4

原创 Project Euler Problem 543 Prime-Sum Numbers

Prime-Sum NumbersProblem 543Define function P(n,k) = 1 ifn can be written as the sum of k prime numbers (with repetitions allowed), and P(n,k) = 0 otherwise.For example, P(10,2) = 1 beca

2017-03-24 08:03:34 1201 2

原创 Project Euler Problem 99 Largest exponential

Largest exponentialProblem 99Comparing two numbers written in index form like 211 and 37 is not difficult, as any calculator would confirm that 211 = 2048 7 = 2187.However, confirming that

2017-03-23 21:11:36 750

原创 HDU4506 小明系列故事——师兄帮帮忙【水题】

小明系列故事——师兄帮帮忙Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 6064 Accepted Submission(s): 1702Problem Description　　小明自从告别了ACM/ICP

2017-03-23 16:17:27 1837

原创 Project Euler Problem 21 Amicable numbers

Amicable numbersProblem 21Let d(n) be defined as the sum of proper divisors ofn (numbers less than n which divide evenly into n).If d(a) = b and d(b) = a, where a ≠ b, then a and b are

2017-03-23 09:11:11 775

原创 Project Euler Problem 25 1000-digit Fibonacci number

1000-digit Fibonacci numberProblem 25The Fibonacci sequence is defined by the recurrence relation:Fn = Fn−1 + Fn−2, where F1 = 1 and F2 = 1.Hence the first 12 terms will be:F1 =

2017-03-23 06:35:05 596

原创 Project Euler Problem 20 Factorial digit sum

Factorial digit sumProblem 20n! means n × (n − 1) × ... × 3 × 2 × 1For example, 10! = 10 × 9 × ... × 3 × 2 × 1 = 3628800,and the sum of the digits in the number 10! is 3 + 6 + 2 + 8 + 8

2017-03-23 00:10:55 766

原创 Project Euler Problem 67 Maximum path sum II

Maximum path sum IIProblem 67By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23.37 42 4 68 5 9 3

2017-03-22 23:06:04 614

原创 Project Euler Problem 18 Maximum path sum I

Maximum path sum IProblem 18By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23.37 42 4 68 5 9 3

2017-03-22 22:54:39 761

原创 Project Euler Problem 16 Power digit sum

Power digit sumProblem 16215 = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26.What is the sum of the digits of the number 21000?C++:#include #include using namespace

2017-03-22 19:27:54 521

原创 Project Euler Problem 47 Distinct primes factors

Distinct primes factorsProblem 47The first two consecutive numbers to have two distinct prime factors are:14 = 2 × 715 = 3 × 5The first three consecutive numbers to have three distinct

2017-03-22 18:19:33 691

原创 Project Euler Problem 15 Lattice paths

Lattice pathsProblem 15Starting in the top left corner of a 2×2 grid, and only being able to move to the right and down, there are exactly 6 routes to the bottom right corner.How man

2017-03-22 05:54:11 669 2

原创 Project Euler Problem 14 Longest Collatz sequence

Longest Collatz sequenceProblem 14The following iterative sequence is defined for the set of positive integers:n → n/2 (n is even)n → 3n + 1 (n is odd)Using the rule above and starting

2017-03-21 10:06:01 523

原创 Project Euler Problem 13 Large sum

Large sumProblem 13Work out the first ten digits of the sum of the following one-hundred 50-digit numbers.3710728753390210279879799822083759024651013574025046376937677490009712648124896970

2017-03-20 23:50:09 564

原创 Project Euler Problem 12: Highly divisible triangular number

Highly divisible triangular numberProblem 12The sequence of triangle numbers is generated by adding the natural numbers. So the 7th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. T

2017-03-20 22:16:44 691

原创 Project Euler Problem 11: Largest product in a grid

Largest product in a gridProblem 11In the 20×20 grid below, four numbers along a diagonal line have been marked in red.08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 0849 49 99

2017-03-20 20:39:44 557

原创 Project Euler Problem 10: Summation of primes

Summation of primesProblem 10The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.Find the sum of all the primes below two million.C++:#include #include #include using namespac

2017-03-20 01:16:20 508

原创 Project Euler Problem 9: Special Pythagorean triplet

Special Pythagorean tripletProblem 9A Pythagorean triplet is a set of three natural numbers,a b c, for which,a2 + b2 =c2For example, 32 + 42 = 9 + 16 = 25 = 52.There exists exa

2017-03-20 00:09:06 415

原创 Project Euler Problem 8: Largest product in a series

Largest product in a seriesProblem 8The four adjacent digits in the 1000-digit number that have the greatest product are 9 × 9 × 8 × 9 = 5832.7316717653133062491922511967442657474235534919

2017-03-19 16:53:35 479

原创 Project Euler Problem 7: 10001st prime

10001st primeProblem 7By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.What is the 10 001st prime number?C++:#include #include

2017-03-19 15:02:36 561

原创 Project Euler Problem 48: Self powers

Self powersProblem 48The series, 11 + 22 + 33 + ... + 1010 = 10405071317.Find the last ten digits of the series, 11 + 22 + 33 + ... + 10001000.C++:#include using namespace std;

2017-03-19 08:59:32 1008 3

原创 Project Euler Problem 6: Sum square difference

Sum square differenceProblem 6The sum of the squares of the first ten natural numbers is,12 + 22 + ... + 102 = 385The square of the sum of the first ten natural numbers is,(1 + 2

2017-03-19 08:03:28 430

空空如也

空空如也