关闭

Project euler problem 31 - 40

标签: stringbasicclassnumbersincludeeach
3144人阅读 评论(0) 收藏 举报

Problem 31

22 November 2002

 

In England the currency is made up of pound, £, and pence, p, and there are eight coins in general circulation:

1p, 2p, 5p, 10p, 20p, 50p, £1 (100p) and £2 (200p).

It is possible to make £2 in the following way:

1× £1 + 1× 50p + 2× 20p + 1× 5p + 1× 2p + 3× 1p

How many different ways can £2 be made using any number of coins?

 

分析:用递归

 

Problem 32

06 December 2002

 

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

The product 7254 is unusual, as the identity, 39 × 186 = 7254, containing multiplicand, multiplier, and product is 1 through 9 pandigital.

Find the sum of all products whose multiplicand/multiplier/product identity can be written as a 1 through 9 pandigital.

HINT: Some products can be obtained in more than one way so be sure to only include it once in your sum.

分析:可知,形如a*b=c,a只能是1位或2位,b只能是3位或4位,所以循环就很简单了

Problem 33

20 December 2002

The fraction ^( 49 ) /_( 98 ) is a curious fraction, as an inexperienced mathematician in attempting to simplify it may incorrectly believe that ^( 49 ) /_( 98 ) = ^( 4 ) /_( 8 ) , which is correct, is obtained by cancelling the 9s.

We shall consider fractions like, ^( 30 ) /_( 50 ) = ^( 3 ) /_( 5 ) , to be trivial examples.

There are exactly four non-trivial examples of this type of fraction, less than one in value, and containing two digits in the numerator and denominator.

If the product of these four fractions is given in its lowest common terms, find the value of the denominator.

 

分析:经过简单分析,只有形如ax/xb = a/b有解

 

Problem 34

03 January 2003

145 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! = 1 and 2! = 2 are not sums they are not included.

 

分析:实际上有 9!=362880,362880*n<10^n 可算出上限,剩下的暴力

 

 

Problem 35

17 January 2003

The number, 197, is called a circular prime because all rotations of the digits: 197, 971, and 719, are themselves prime.

There are thirteen such primes below 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, and 97.

How many circular primes are there below one million?

 

分析:1位数数字易得,2位数以上,实际上是1,3,7,9的组合,这里程序用到了组合,代码有点长,但是快。

 

 

Problem 36

31 January 2003

The decimal number, 585 = 1001001001_( 2 ) (binary), is palindromic in both bases.

Find the sum of all numbers, less than one million, which are palindromic in base 10 and base 2.

(Please note that the palindromic number, in either base, may not include leading zeros.)

 

分析:求的是1000000以下的数字,在二进制及十进制情况下均是回文数,偶数当然不行(2进制下最后是0,所以T掉)

 

Problem 37

14 February 2003

The number 3797 has an interesting property. Being prime itself, it is possible to continuously remove digits from left to right, and remain prime at each stage: 3797, 797, 97, and 7. Similarly we can work from right to left: 3797, 379, 37, and 3.

Find the sum of the only eleven primes that are both truncatable from left to right and right to left.

NOTE: 2, 3, 5, and 7 are not considered to be truncatable primes.

 

分析:判断这个数是否素数(并置于一个数组中),然后再从左到右或从右到左,判断素数数组是否含有该数

 

Problem 38

28 February 2003

Take the number 192 and multiply it by each of 1, 2, and 3:

192 × 1 = 192
192 × 2 = 384
192 × 3 = 576

By concatenating each product we get the 1 to 9 pandigital, 192384576. We will call 192384576 the concatenated product of 192 and (1,2,3)

The same can be achieved by starting with 9 and multiplying by 1, 2, 3, 4, and 5, giving the pandigital, 918273645, which is the concatenated product of 9 and (1,2,3,4,5).

What is the largest 1 to 9 pandigital 9-digit number that can be formed as the concatenated product of an integer with (1,2, ... , n ) where n > 1?

 

分析:用笔算出每种位数的上下限即可

 

 

Problem 39

14 March 2003

If p is the perimeter of a right angle triangle with integral length sides, {a ,b ,c }, there are exactly three solutions for p = 120.

{20,48,52}, {24,45,51}, {30,40,50}

For which value of p ≤ 1000, is the number of solutions maximised?

 

分析:没太多,勾股定理暴力

 

Problem 40

28 March 2003

An irrational decimal fraction is created by concatenating the positive integers:

0.123456789101 112131415161718192021...

It can be seen that the 12^( th ) digit of the fractional part is 1.

If d _( n ) represents the n ^( th ) digit of the fractional part, find the value of the following expression.

d _( 1 ) × d _( 10 ) × d _( 100 ) × d _( 1000 ) × d _( 10000 ) × d _( 100000 ) × d _( 1000000

分析:此题因为有了StringBuffer这个类,我就没去思考了,所以代码读起来没技术含量。

这个网站后面很多用到的数学知识及算法对我来说有点困难,唉,啃这些书真累。。。
1
0

猜你在找
【直播】机器学习&深度学习系统实战(唐宇迪)
【直播】Kaggle 神器:XGBoost 从基础到实战(冒教授)
【直播回放】深度学习基础与TensorFlow实践(王琛)
【直播】计算机视觉原理及实战(屈教授)
【直播】机器学习之凸优化(马博士)
【直播】机器学习之矩阵(黄博士)
【直播】机器学习之概率与统计推断(冒教授)
【直播】机器学习之数学基础
【直播】TensorFlow实战进阶(智亮)
【直播】深度学习30天系统实训(唐宇迪)
查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:38347次
    • 积分:606
    • 等级:
    • 排名:千里之外
    • 原创:19篇
    • 转载:4篇
    • 译文:0篇
    • 评论:7条
    文章分类
    最新评论