28 Number spiral diagonals - Project Euler +
2015-11-06 11:01
387 查看
package xxx.xxx.xxx;
/*
* 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 the numbers on the diagonals is 101.
What is the sum of the numbers on the diagonals in a 1001 by 1001 spiral formed in the same way?
*/
public class NumberSpiralDiagonals {
private void compute(int length){
int middlepoint = length/2+1-1;
int i = 1;
int sum = 1;
System.out.println("("+middlepoint+","+middlepoint+")");
while(i<=length/2){
// sum = sum +((2*i+1)*(2*i+1)-6*i)+((2*i+1)*(2*i+1)-4*i)+((2*i+1)*(2*i+1)-2*i) +(2*i+1)*(2*i+1);
sum = sum +(2*i+1)*(2*i+1)*4-12*i;
i++;
}
System.out.println(sum);
}
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
long startTime = System.currentTimeMillis();
NumberSpiralDiagonals n = new NumberSpiralDiagonals();
n.compute(1001);
long endTime = System.currentTimeMillis();
System.out.println("execution time " + (endTime - startTime + "ms"));
}
}
/*
* 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 the numbers on the diagonals is 101.
What is the sum of the numbers on the diagonals in a 1001 by 1001 spiral formed in the same way?
*/
public class NumberSpiralDiagonals {
private void compute(int length){
int middlepoint = length/2+1-1;
int i = 1;
int sum = 1;
System.out.println("("+middlepoint+","+middlepoint+")");
while(i<=length/2){
// sum = sum +((2*i+1)*(2*i+1)-6*i)+((2*i+1)*(2*i+1)-4*i)+((2*i+1)*(2*i+1)-2*i) +(2*i+1)*(2*i+1);
sum = sum +(2*i+1)*(2*i+1)*4-12*i;
i++;
}
System.out.println(sum);
}
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
long startTime = System.currentTimeMillis();
NumberSpiralDiagonals n = new NumberSpiralDiagonals();
n.compute(1001);
long endTime = System.currentTimeMillis();
System.out.println("execution time " + (endTime - startTime + "ms"));
}
}
相关文章推荐
- 动易2006序列号破解算法公布
- Ruby实现的矩阵连乘算法
- C#插入法排序算法实例分析
- 超大数据量存储常用数据库分表分库算法总结
- C#数据结构与算法揭秘二
- C#冒泡法排序算法实例分析
- 算法练习之从String.indexOf的模拟实现开始
- C#算法之关于大牛生小牛的问题
- C#实现的算24点游戏算法实例分析
- c语言实现的带通配符匹配算法
- 浅析STL中的常用算法
- 算法之排列算法与组合算法详解
- C++实现一维向量旋转算法
- Ruby实现的合并排序算法
- C#折半插入排序算法实现方法
- 基于C++实现的各种内部排序算法汇总
- C++线性时间的排序算法分析
- C++实现汉诺塔算法经典实例
- PHP实现克鲁斯卡尔算法实例解析
- C#获取关键字附近文字算法实例