题解 | 尼科彻斯定理

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <math.h>
int main()
{
    int n = 0;
    scanf("%d", &n);
    int n_mui = pow(n, n);
    int b1 = n * n - n + 1;
    int c1 = b1;
    int arr[10000] = { 0 };
    for (int i = 0;i < n;i++)
    {
        if (i == 0)
        {
            arr[i] = c1;
        }
        if(i!=0)
        {
           c1 = c1 + 2;
            arr[i] = c1;
        }
        
    }
    for (int i = 0;i < n;i++)
    {
        if (i < n - 1)
        {
            printf("%d+", arr[i]);
        }
        else
        {
            printf("%d", arr[i]);

        }

    }
    return 0;
}