Project euler problem 21 - 30

Problem 21
原题：

Let d(n) be defined as the sum of proper divisors of n (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 an amicable pair and each of a and b are called amicable numbers.

For example, the proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 110; therefore d(220) = 284. The proper divisors of 284 are 1, 2, 4, 71 and 142; so d(284) = 220.

Evaluate the sum of all the amicable numbers under 10000.

分析：亲和数，事实上在10000下面只有

代码：

1.     // 表示总积
2.     private static int total = 0;
3. 
   
4.     public static void findAmicableNubmers(int num) {
5.         int sum = sumOfDivisors(num);
6.         if (sum >= 10000 || sum <= num) {
7.             return;
8.         }
9.         if (num == sumOfDivisors(sum)) {
10.             total += sum;
11.             total += num;
12.         }
13.     }
14. 
    
15.     // 返回num的真因子和
16.     public static int sumOfDivisors(int num) {
17.         int sum = 1;
18.         int sqrt = (int) Math.sqrt(num);
19.         for (int i = 2; i <= sqrt; i++) {
20.             if (num % i == 0) {
21.                 sum += i;
22.                 sum += num / i;
23.             }
24.         }
25.         if (num == sqrt * sqrt) {
26.             sum -= sqrt;
27.         }
28. 
    
29.         return sum;
30.     }
31. 
    
32.     public static void main(String[] args) {
33.         for (int i = 220; i < 10000; i++)
34.             findAmicableNubmers(i);
35.         System.out.println(total);
36.     }

Problem 22

原题：

Using names.txt (right click and 'Save Link/Target As...'), 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 value by its alphabetical position in the list to obtain a name score.

For example, when the list is sorted into alphabetical order, COLIN, which is worth 3 + 15 + 12 + 9 + 14 = 53, is the 938th name in the list. So, COLIN would obtain a score of 938 53 = 49714.

What is the total of all the name scores in the file?

分析：names.txt里面包含5000个名，首先将这些名字按字母排序，然后再计算它们的分数。每个名字的分数的计算方式如下：先把名字的每个字母所在字母表中的位置相加，所得的和再乘以该名字在所排序好数组中的位置。硬算呗。。

代码：

1.     private static String[] ss;
3.     // 初始化数组，读取文件并排序
4.     private static void read() throws Exception {
5.         BufferedReader br = new BufferedReader(new FileReader(
6.                 "names.txt"));
7.         String line = br.readLine().replace("/"", "");
8.         br.close();
9.         ss = line.split(",");
10.         Arrays.sort(ss);
11.     }
13.     // 计算每个名字的分数并相加
14.     private static int calc() {
15.         int sum = 0;
16.         for (int i = 0; i < ss.length; i++) {
17.             int temp = 0;
18.             char[] cs = ss[i].toCharArray();
19.             for (char c : cs) {
20.                 temp += (c + 1 - 'A');
21.             }
22.             sum += ((i + 1) * temp);
23.         }
24.         return sum;
25.     }
27.     public static void main(String[] args) throws Exception {
28.         read();
29.         int sum = calc();
30.         System.out.println(sum);
31.     }

Problem 23
原题：

A 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 means that 28 is a perfect number.

A number whose proper divisors are less than the number is called deficient and a number whose proper divisors exceed the number is called abundant.

As 12 is the smallest abundant number, 1 + 2 + 3 + 4 + 6 = 16, the smallest number that can be written as the sum of two abundant numbers is 24. By mathematical analysis, it can be shown that all integers greater than 28123 can be written as the sum of two abundant numbers. However, this upper limit cannot be reduced any further by analysis even though it is known that the greatest number that cannot be expressed as the sum of two abundant numbers is less than this limit.

Find the sum of all the positive integers which cannot be written as the sum of two abundant numbers.

分析：盈数，完美数（完全数？），亏数。这里求的是所有不能写成两个盈数的整数的和（题中给出提示，28123以上的数都能写成两个盈数之和）
代码：

1. // 用来存储盈数
2.     private static List<Integer> nums = new ArrayList<Integer>();
4.     private static void findAbundantNumber() {
5.         for (int i = 12; i <= 30000; i++) {
6.             if (sumOfDivisors(i) > i) {
7.                 nums.add(i);
8.             }
9.         }
10.     }
12.     // 返回：num的真因子之和
13.     public static int sumOfDivisors(int num) {
14.         int sum = 1;
15.         int sqrt = (int) Math.sqrt(num);
16.         for (int i = 2; i <= sqrt; i++) {
17.             if (num % i == 0) {
18.                 sum += i;
19.                 sum += num / i;
20.             }
21.         }
22.         if (num == sqrt * sqrt) {
23.             sum -= sqrt;
24.         }
26.         return sum;
27.     }
29.     public static void main(String[] args) {
30.         findAbundantNumber();
31.         int sum = 0;
32.         for (int i = 1; i <= 30000; i++) {
33.             boolean isA = false;
34.             for (int num : nums) {
35.                 // 如果第一个数已经大于待求的一半，则返回
36.                 if (num > i / 2) {
37.                     break;
38.                 }
39.                 // 第二个数
40.                 int num2 = i - num;
41.                 // 如果第二个数也是盈数
42.                 if (Collections.binarySearch(nums, num2) >= 0) {
43.                     isA = true;
44.                     break;
45.                 }
46.             }
47.             if (!isA) {
48.                 sum += i;
49.                 System.out.println(i);
50.             }
51.         }
52.         System.out.println(sum);
53.     }

Problem 24
原题：

A 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 are listed numerically or alphabetically, we call it lexicographic order. The lexicographic permutations of 0, 1 and 2 are:

012   021   102   120   201   210

What is the millionth lexicographic permutation of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9?

分析：0123456789我们知道有10!个不同的排序，如果按字典排序，求第1000000个数字是多少？这题用笔和纸即可完成，只是有点麻烦了，首先确定第一位，0开头的一共有9!个排序，1....9同样，所以，第一个数字可确定为999999/9!，即为2。等同于求013456789的第（999999－2 * 9!）位的排序，按照确定第一位的方法，一样解决了

代码：

1.     public static void p() {
2.         // 阶乘数组
3.         int[] factorial = { 1, 2, 6, 24, 120, 720, 5040, 40320, 362880 };
4.         String s = "0123456789";
5.         int l = 999999;
6.         String s1 = "";
7.         for (int i = factorial.length - 1; i >= 0; i--) {
8.             // 应该取剩下字符串的第几位
9.             int num = l / factorial[i];
10.             s1 += s.charAt(num);
11.             l = l - num * factorial[i];
12.             // 把确定的数从字符串中移取
13.             s = doff(s, num);
14.         }
15.         System.out.println(s1 + s);
16.     }
17. 
    
18.     // 确定一位后，剩下的数
19.     private static String doff(String s, int index) {
20.         return s.substring(0, index) + s.substring(index + 1);
21.     }
22. 
    
23.     public static void main(String[] args) {
24.         p();
25.     }

Problem 25

原题：

The Fibonacci sequence is defined by the recurrence relation:

F _n = F _n1 + F _n2, where F ₁ = 1 and F ₂ = 1.

Hence the first 12 terms will be:

F ₁ = 1
F ₂ = 1
F ₃ = 2
F ₄ = 3
F ₅ = 5
F ₆ = 8
F ₇ = 13
F ₈ = 21
F ₉ = 34
F ₁₀ = 55
F ₁₁ = 89
F ₁₂ = 144

The 12th term, F₁₂, is the first term to contain three digits.

What is the first term in the Fibonacci sequence to contain 1000 digits?

分析：Fibonacc（斐波那契）数列，求的是第一个长度超过1000的数

利用公式 an = {[(1 + √5)/2]^n - [(1 - √5)/2]^n}/√5，本来是想直接利用数学公式进行求，结果发现无从下手，直好用了类似二分查找的方法。随便设了一个上限5000，结果碰上死耗子，搞定。耗死将近2分钟，有兴趣的想别的办法，总觉得能用数学公式一次求出来，直接用计算机就可求出此题的解。

代码：

1.     // an = {[(1 + √5)/2]^n - [(1 - √5)/2]^n}/√5
2.     private static final BigDecimal sqrt5 = BigDecimal
3.             .valueOf(Math.sqrt(5));
4. 
   
5.     private static final BigDecimal one = BigDecimal.ONE;
6. 
   
7.     private static final BigDecimal num1 = one.add(sqrt5).divide(
8.             BigDecimal.valueOf(2));
9.     private static final BigDecimal num2 = one.subtract(sqrt5).divide(
10.             BigDecimal.valueOf(2));
11. 
    
12.     private static int getLength(int n) {
13.         BigDecimal result = num1.pow(n).subtract(num2.pow(n));
14.         result = result.divide(sqrt5);
15.         return result.toBigInteger().toString().length();
16.     }
17. 
    
18.     public static void main(String[] args) {
19.         int min = 1;
20.         int max = 5000;
21.         while (min < max - 1) {
22.             int middle = (min + max) / 2;
23.             System.out.printf("%d,%d,%d/n", min, middle, max);
24.             int len = getLength(middle);
25.             if (len < 1000) {
26.                 min = middle;
27.             } else {
28.                 max = middle;
29.             }
30.         }
31.         System.out.println(max);
32.     }

Problem 26

原题

A unit fraction contains 1 in the numerator. The decimal representation of the unit fractions with denominators 2 to 10 are given:

1/2	=	0.5
1/3	=	0.(3)
1/4	=	0.25
1/5	=	0.2
1/6	=	0.1(6)
1/7	=	0.(142857)
1/8	=	0.125
1/9	=	0.(1)
1/10	=	0.1

Where 0.1(6) means 0.166666..., and has a 1-digit recurring cycle. It can be seen that ¹/₇ has a 6-digit recurring cycle.

Find the value of d 1000 for which ¹/_d contains the longest recurring cycle in its decimal fraction part.

分析：d<1000，求1/d最长的无限循环部分长度。

其实就是记录每次的余数，如果发现该余数在前面已经出现，则说明一个循环部分。

代码：

1.     public static int r(int b) {
2.         List<Integer> l = new ArrayList<Integer>();
3.         int a = 1;
4.         l.add(a);
5.         int count = 1;
6.         do {
7.             a = (a * 10) % b;
8.             if (a == 0) {
9.                 return 0;
10.             }
11.             int index = l.indexOf(a);
12.             if (index > -1) {
13.                 return count - index;
14.             } else {
15.                 l.add(a);
16.                 count++;
17.             }
18.         } while (true);
19.     }
20. 
    
21.     public static void main(String[] args) {
22.         int max = 0;
23.         for (int i = 1; i < 1000; i++) {
24.             int temp = r(i);
25.             if (temp > max) {
26.                 System.out.printf("%d/t%d/n", i, temp);
27.                 max = temp;
28.             }
29.         }
30.     }

Problem 27

原题：

Euler published the remarkable quadratic formula:

n² + n + 41

It turns out that the formula will produce 40 primes for the consecutive values n = 0 to 39. However, when n = 40, 40² + 40 + 41 = 40(40 + 1) + 41 is divisible by 41, and certainly when n = 41, 41² + 41 + 41 is clearly divisible by 41.

Using computers, the incredible formula  n² 79n + 1601 was discovered, which produces 80 primes for the consecutive values n = 0 to 79. The product of the coefficients, 79 and 1601, is 126479.

Considering quadratics of the form:

n² + an + b, where | a| 1000 and | b| 1000

where | n| is the modulus/absolute value of n
e.g. |11| = 11 and | 4| = 4

Find the product of the coefficients, a and b, for the quadratic expression that produces the maximum number of primes for consecutive values of n, starting with n = 0.

分析：n² + an + b, where |a| 1000 and |b| 1000，使得他们能够满足[0,n]均为素数，当n最大时，求a * b的积，穷举吧，当然，加两个小小判断，b必须是素数，1 + a +b必须是素数。

代码：

1.     private static boolean isPrime(int num) {
2.         num = num > 0 ? num : -num;
3.         if (num == 0 || num == 1) {
4.             return false;
5.         }
6.         if (num == 2) {
7.             return true;
8.         }
9.         for (int i = 2; i <= Math.sqrt(num); i++) {
10.             if (num % i == 0) {
11.                 return false;
12.             }
13.         }
14.         return true;
15.     }
16. 
    
17.     private static int getPrimes(int a, int b) {
18.         for (int i = 0; i < 1000; i++) {
19.             if (!isPrime(i * i + a * i + b)) {
20.                 return i + 1;
21.             }
22.         }
23.         return 1000;
24.     }
25. 
    
26.     public static void main(String[] args) {
27.         int max = 0;
28.         int result = 0;
29.         for (int b = -999; b < 1000; b++) {
30.             if (!isPrime(b)) {
31.                 continue;
32.             }
33. 
    
34.             for (int a = -999; a < 1000; a++) {
35.                 if (!isPrime(1 + a + b)) {
36.                     continue;
37.                 }
38.                 int temp = getPrimes(a, b);
39.                 if (temp > max) {
40.                     max = temp;
41.                     result = a * b;
42.                     System.out.printf("%d * %d = %d, %d/n",
43.                             a, b, result, temp);
44.                 }
45.             }
46.         }
47.     }

Problem 28

原题

Starting with the number 1 and moving to the right in a clockwise direction a 5 by 5 spiral is formed as follows:

21 22 23 24 25
20  7  8  9 10
19  6  1  2 11
18  5  4  3 12
17 16 15 14 13

It can be verified that the sum of both diagonals is 101.

What is the sum of both diagonals in a 1001 by 1001 spiral formed in the same way?

分析：在如图螺旋状的矩阵中，当矩阵大小为1001*1001时，将每层的四个角相加，所得和为多少？

首先，将“层”规定一下，当中的1叫第1层，2~9叫第3层，10~25叫第5层（其实就是跟矩阵的大小等同叫法）。这样的话，第n层的四个数分别为n*n, n*n - (n-1), n*n - 2(n-1), n*n - 3(n-1)。

这样，第n层的和为：4 * n * n  - 6n - 6(n>1且为奇数)，第一层就是1，如果继续化简下去，用到奇数的平方和等公式，最后将是只是一个公式，这里就懒一点，算到这为止。

代码：

1.     // 算第n层的和
2.     private static int sum(int n) {
3.         if (n == 1) {
4.             return 1;
5.         }
6. 
   
7.         return 4 * n * n - 6 * n + 6;
8.     }
9. 
   
10.     public static void main(String[] args) {
11.         int sum = 0;
12.         int max = 1001;
13.         for (int i = 1; i <= max; i += 2) {
14.             sum += sum(i);
15.         }
16.         System.out.println(sum);
17.     }

Problem 29

原题

Consider all integer combinations of a^b for 2 a 5 and 2 b 5:

2 ²=4, 2 ³=8, 2 ⁴=16, 2 ⁵=32
3 ²=9, 3 ³=27, 3 ⁴=81, 3 ⁵=243
4 ²=16, 4 ³=64, 4 ⁴=256, 4 ⁵=1024
5 ²=25, 5 ³=125, 5 ⁴=625, 5 ⁵=3125

If they are then placed in numerical order, with any repeats removed, we get the following sequence of 15 distinct terms:

4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125

How many distinct terms are in the sequence generated by a^b for 2 a 100 and 2 b 100?

分析：2 a 100 and 2 b 100?，求a^b共有多少个不重复的值。嘿嘿，邪恶地暴力。

代码：

1.     public static void distinctTerms() {
2.         int max = 100;
3.         Map<BigDecimal, Object> m = new HashMap<BigDecimal, Object>();
4.         for (int a = 2; a <= max; a++) {
5.             for (int b = 2; b <= max; b++) {
6.                 BigDecimal r = BigDecimal.valueOf(a).pow(b);
7.                 m.put(r, null);
8.             }
9.         }
10.         System.out.println(m.size());
11.     }
12.     
13.     public static void main(String[] args) {
14.         distinctTerms();
15.     }

Problem 30

原题：

Surprisingly there are only three numbers that can be written as the sum of fourth powers of their digits:

1634 = 1 ⁴ + 6 ⁴ + 3 ⁴ + 4 ⁴
8208 = 8 ⁴ + 2 ⁴ + 0 ⁴ + 8 ⁴
9474 = 9 ⁴ + 4 ⁴ + 7 ⁴ + 4 ⁴

As 1 = 1⁴ is not a sum it is not included.

The sum of these numbers is 1634 + 8208 + 9474 = 19316.

Find the sum of all the numbers that can be written as the sum of fifth powers of their digits.

分析：有这样的数，它正好等于它每一位数字5次方的和，问所有这样的数和为多少？

简单分析，可知，这样的数，小于10的6次方

所以代码就简单地出来了，暴力吧

1.     public static int find() {
2.         int sum = 0;
3.         for (int i = 2; i < 1000000; i++) {
4.             if (i == pow(i)) {
5.                 sum += i;
6.                 System.out.println(i);
7.             }
8.         }
9.         return sum;
10.     }
12.     private static int[] fifthPow = { 0, 1, 32, 243, 1024, 3125, 7776, 16807,
13.             32768, 59049 };
15.     public static int pow(int i) {
16.         int sum = 0;
17.         char[] cs = String.valueOf(i).toCharArray();
18.         for (char c : cs) {
19.             sum += fifthPow[c - '0'];
20.         }
21.         return sum;
22.     }
24.     public static void main(String[] args) {
25.         System.out.println(find());
26.     }