C语言训练-尼科彻斯定理 （Java代码）

解题思路:





注意事项:





参考代码:import java.util.Scanner;

public static void main(String[] args) {

Scanner sc = new Scanner(System.in);

int a = sc.nextInt();

int b = (int) Math.pow(a, 3);

int c = a * a;

if (a % 2 != 0) {

System.out.print(a + "*" + a + "*" + a + "=" + b + "=");

int d[] = new int[(a - 1) / 2];

for (int i = 0; i < (a - 1) / 2; i++) {

d[i] = c - 2;

c = c - 2;

}

for (int i = (a - 1) / 2 - 1; i >= 0; i--) {

System.out.print(d[i] + "+");

}

int t = a * a;

System.out.print(t);

for (int i = 1; i <= (a - 1) / 2; i++) {

t = t + 2;

System.out.print("+" + t);

}

}

if (a % 2 == 0) {

System.out.print(a + "*" + a + "*" + a + "=" + b + "=");

int d[] = new int[a / 2];

for (int i = 0; i < a / 2; i++) {

d[i] = c - 1;

c = c - 2;

}

for (int i = a / 2 - 1; i > 0; i--) {

System.out.print(d[i] + "+");

}

for(int i=0;i<1;i++) {

System.out.print(d[0]);

}

int t = a * a + 1;

for (int i = 1; i <= a / 2; i++) {

System.out.print("+" + t);

t = t + 2;

}

}

}

}