码迷,mamicode.com
首页 >  
搜索关键字:project-euler    ( 184个结果
Project Euler:Problem 89 Roman numerals
For a number written in Roman numerals to be considered valid there are basic rules which must be followed. Even though the rules allow some numbers to be expressed in more than one way there is alw...
分类:其他好文   时间:2015-07-24 22:42:34    阅读次数:290
Project Euler:Problem 89 Roman numerals
For a number written in Roman numerals to be considered valid there are basic rules which must be followed. Even though the rules allow some numbers to be expressed in more than one way there is alw...
分类:其他好文   时间:2015-07-24 18:29:36    阅读次数:128
Project Euler:Problem 88 Product-sum numbers
A natural number, N, that can be written as the sum and product of a given set of at least two natural numbers, {a1, a2, ... , ak} is called a product-sum number: N = a1 + a2 + ... + ak = a1 × a2 × ...
分类:其他好文   时间:2015-07-23 23:48:41    阅读次数:140
Project Euler:Problem 87 Prime power triples
The smallest number expressible as the sum of a prime square, prime cube, and prime fourth power is 28. In fact, there are exactly four numbers below fifty that can be expressed in such a way: 28...
分类:其他好文   时间:2015-07-23 21:50:50    阅读次数:210
Project Euler:Problem 84 Monopoly odds
In the game, Monopoly, the standard board is set up in the following way: GO A1 CC1 A2 T1 R1 B1 CH1 B2 B3 JAIL H2   C1 T2   U1 H1   C2 CH3   C3 R4 ...
分类:其他好文   时间:2015-07-22 16:29:45    阅读次数:94
Project Euler:Problem 82 Path sum: three ways
The minimal path sum in the 5 by 5 matrix below, by starting in any cell in the left column and finishing in any cell in the right column, and only moving up, down, and right, is indicated in red an...
分类:其他好文   时间:2015-07-21 17:10:05    阅读次数:145
Project Euler:Problem 79 Passcode derivation
A common security method used for online banking is to ask the user for three random characters from a passcode. For example, if the passcode was 531278, they may ask for the 2nd, 3rd, and 5th chara...
分类:其他好文   时间:2015-07-20 16:47:38    阅读次数:118
Project Euler:Problem 78 Coin partitions
Let p(n) represent the number of different ways in which n coins can be separated into piles. For example, five coins can be separated into piles in exactly seven different ways, so p(5)=7. ...
分类:其他好文   时间:2015-07-19 16:35:22    阅读次数:181
Project Euler:Problem 76 Counting summations
It is possible to write five as a sum in exactly six different ways: 4 + 1 3 + 2 3 + 1 + 1 2 + 2 + 1 2 + 1 + 1 + 1 1 + 1 + 1 + 1 + 1 How many different ways can one hundred be written as a su...
分类:其他好文   时间:2015-07-18 18:41:52    阅读次数:94
Project Euler:Problem 77 Prime summations
It is possible to write ten as the sum of primes in exactly five different ways: 7 + 3 5 + 5 5 + 3 + 2 3 + 3 + 2 + 2 2 + 2 + 2 + 2 + 2 What is the first value which can be written as the sum o...
分类:其他好文   时间:2015-07-18 18:40:05    阅读次数:118
184条   上一页 1 ... 10 11 12 13 14 ... 19 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!