UVA10079 Pizza Cutting
摘要：
问题链接：UVA10079 Pizza Cutting。问题描述：参见上述链接。问题分析：参考《具体数学》一书。也可以参考：直线分平面公式_百度百科。程序说明：（略）。AC的C++语言程序如下：/* UVA10079 Pizza Cutting */#include ... 阅读全文
posted @ 2017-03-28 16:53 海岛Blog 阅读(141) 评论(0) 推荐(0)
UVA100 POJ1207 HDU1032 The 3n + 1 problem
摘要：
问题链接：UVA100 POJ1207 HDU1032 The 3n + 1 problem。问题描述：参见上述链接。问题分析：根据给定的算法计算整数循环到1的次数，可以用一个函数来实现，可以使用记忆存储来加快计算速度。程序说明：数组cs[]用于存储已经算过的次数，极... 阅读全文
posted @ 2017-03-28 16:31 海岛Blog 阅读(182) 评论(0) 推荐(0)
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 e... 阅读全文
posted @ 2017-03-28 09:58 海岛Blog 阅读(155) 评论(0) 推荐(0)
Project Euler Problem 24 Lexicographic permutations
摘要：
Lexicographic permutationsProblem 24A permutation is an ordered arrangement of objects. For example, 3124 is one possible permutation ... 阅读全文
posted @ 2017-03-28 08:22 海岛Blog 阅读(216) 评论(0) 推荐(0)
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 ... 阅读全文
posted @ 2017-03-27 04:01 海岛Blog 阅读(176) 评论(0) 推荐(0)
CCF201703-2 学生排队（100分）
摘要：
试题编号：201703-2试题名称：学生排队时间限制：1.0s内存限制：256.0MB问题描述：问题描述 体育老师小明要将自己班上的学生按顺序排队。他首先让学生按学号从小到大的顺序排成一排，学号小的排在前面，然后进行多次调整。一次调整小明可能让一位同学出队，向前或者... 阅读全文
posted @ 2017-03-26 18:40 海岛Blog 阅读(527) 评论(0) 推荐(0)
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 + ... 阅读全文
posted @ 2017-03-26 15:57 海岛Blog 阅读(322) 评论(0) 推荐(0)
CCF201703-1 分蛋糕（100分）
摘要：
试题编号：201703-1试题名称：分蛋糕时间限制：1.0s内存限制：256.0MB问题描述：问题描述 小明今天生日，他有n块蛋糕要分给朋友们吃，这n块蛋糕（编号为1到n）的重量分别为a1, a2, …, an。小明想分给每个朋友至少重量为k的蛋糕。小明的朋友们已经... 阅读全文
posted @ 2017-03-25 15:48 海岛Blog 阅读(360) 评论(0) 推荐(0)
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 numbe... 阅读全文
posted @ 2017-03-25 08:37 海岛Blog 阅读(147) 评论(0) 推荐(0)
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), an... 阅读全文
posted @ 2017-03-24 08:04 海岛Blog 阅读(170) 评论(0) 推荐(0)
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 con... 阅读全文
posted @ 2017-03-23 21:12 海岛Blog 阅读(118) 评论(0) 推荐(0)
HDU4506 小明系列故事——师兄帮帮忙
摘要：
问题链接：HDU4506 小明系列故事——师兄帮帮忙。问题描述：参见上述链接。问题分析：（略）。程序说明：函数powermod()是快速模幂函数。AC的C++语言程序如下：/* HDU4506 小明系列故事——师兄帮帮忙 */#include using namesp... 阅读全文
posted @ 2017-03-23 16:17 海岛Blog 阅读(135) 评论(0) 推荐(0)
Project Euler Problem 21 Amicable numbers
摘要：
Amicable numbersProblem 21Let d(n) be defined as the sum of proper divisors ofn (numbers less thann which divide evenly into n).If d(a... 阅读全文
posted @ 2017-03-23 09:11 海岛Blog 阅读(159) 评论(0) 推荐(0)
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 F... 阅读全文
posted @ 2017-03-23 06:35 海岛Blog 阅读(203) 评论(0) 推荐(0)
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 o... 阅读全文
posted @ 2017-03-23 00:11 海岛Blog 阅读(162) 评论(0) 推荐(0)
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... 阅读全文
posted @ 2017-03-22 23:06 海岛Blog 阅读(139) 评论(0) 推荐(0)
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 ... 阅读全文
posted @ 2017-03-22 22:55 海岛Blog 阅读(141) 评论(0) 推荐(0)
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 2... 阅读全文
posted @ 2017-03-22 19:28 海岛Blog 阅读(119) 评论(0) 推荐(0)
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 2... 阅读全文
posted @ 2017-03-22 19:28 海岛Blog 阅读(148) 评论(0) 推荐(0)
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 firs... 阅读全文
posted @ 2017-03-22 18:20 海岛Blog 阅读(200) 评论(0) 推荐(0)
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 firs... 阅读全文
posted @ 2017-03-22 18:20 海岛Blog 阅读(244) 评论(0) 推荐(0)
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 exa... 阅读全文
posted @ 2017-03-22 05:54 海岛Blog 阅读(118) 评论(0) 推荐(0)
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 exa... 阅读全文
posted @ 2017-03-22 05:54 海岛Blog 阅读(117) 评论(0) 推荐(0)
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 → ... 阅读全文
posted @ 2017-03-21 10:06 海岛Blog 阅读(170) 评论(0) 推荐(0)
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 → ... 阅读全文
posted @ 2017-03-21 10:06 海岛Blog 阅读(184) 评论(0) 推荐(0)
浙公网安备 33010602011771号