题解 | #尼科彻斯定理#
尼科彻斯定理
https://www.nowcoder.com/practice/dbace3a5b3c4480e86ee3277f3fe1e85
#include <stdio.h>
int main()
{
int m = 0;
scanf("%d", &m);
int num = m * (m-1) + 1;
int i = 0;
for (i = 0; i < m; i++)
{
printf("%d", num);
num += 2;
if(i < m-1)
printf("+");
}
return 0;
}
