题解 | #尼科彻斯定理#
尼科彻斯定理
https://www.nowcoder.com/practice/dbace3a5b3c4480e86ee3277f3fe1e85
#include <math.h>
#include <stdio.h>
#include <string.h>
int main() {
int n, num;
scanf("%d", &n);
if (n>=1 && n<= 100){
num = pow(n, 3);
int arr[n];
int x = 0;
for (int i = 0; i < n; i++) {
x += 2 * i;
}
for (int i = 0; i < n; i++) {
arr[i] = 2 * i + (num - x) / n;
}
char str[1000] = {0};
int j = 0;
sprintf(str, "%d", arr[0]);//将arr[0]以十进制写入str
for (int i = 1; i < n; i++) {
strcat(str, "+");//strcat函数又被称为是字符串追加/连接函数,它的功能就是在一个字符串后面追加上另外一个字符串
sprintf(str + strlen(str), "%d", arr[i]);//依次将arr[i]以十进制写入str
}
printf("%s", str);
}
return 0;
}
查看13道真题和解析
