Euler Project
ojshilu
https://github.com/lucky521
展开
-
Euler: Non-abundant sums
ProblemA 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 + 2 + 4 + 7 + 14 = 28, which me原创 2015-03-18 23:05:45 · 826 阅读 · 0 评论 -
Euler: Digit fifth powers
Problem 30: Surprisingly there are only three numbers that can be written as the sum of fourth powers of their digits:1634 = 1^4 + 6^4 + 3^4 + 4^4 8208 = 8^4 + 2^4 + 0^4 + 8^4 9474 = 9^4 + 4^4 + 7^4原创 2015-03-12 19:54:15 · 723 阅读 · 0 评论 -
Euler: Names scores
Problem 22: Using names.txt, a 46K text file containing over five-thousand first names, begin by sorting it into alphabetical order. Then working out the alphabetical value for each name, multiply this原创 2015-03-10 22:51:31 · 712 阅读 · 0 评论 -
Euler: Counting Sundays
Problem 19. You 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, June and November. All the rest hav原创 2015-03-11 21:07:22 · 635 阅读 · 0 评论 -
Euler: Amicable numbers
Amicable numbersThis is the 21st issue of Euler Project Challenge Game.Let d(n) be defined as the sum of proper divisors of n (numbers less than n which divide evenly into n).原创 2015-03-09 19:03:21 · 1435 阅读 · 0 评论 -
大数加法 big number add
问题起源于欧拉项目的问题11。要把1000个50位整数累加起来。字符串搞起。n = 55def add(a, b): while len(a) < n: a = "0" + a while len(b) < n: b = "0" + b sum = [] for _ in range(0, n): sum.append(0) i = n-1 while i >原创 2013-12-27 21:07:44 · 1620 阅读 · 0 评论 -
如何判断一个数是否为素数
对于一个数n,判断它是否为素数(质数)。这是一个喜闻乐见的问题。注意:2是素数,不过下面的算法一般假设所判定数n>2。最直接方法: 由素数的基本概念出发。 依次判断2~n-1的所有整数能否整除n。如果没有一个能整除的,n就是素数;否则不是素数。改进方法: 由非素数的因数(1除外)的特点可知,对于非素数n=A*B,非素数的因数中必定有一个小于等于sq原创 2013-11-22 11:13:48 · 5129 阅读 · 0 评论 -
Euler: Integer right triangles
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}p是三边长度均为整数的直角三角形的周长,当p=120时,存在三种直角三原创 2015-05-13 20:27:41 · 1195 阅读 · 0 评论