解法11111111111111

解题思路:

注意事项:
格式不要弄错
参考代码:

#include <stdio.h>

int main()

{

    int n, k = 2, i = 0, q = 0;

    int a[10];

    int b[10];

    b[0] = 1;

    scanf("%d", &n);

    while (n > 1)

    {

        if (n % k == 0)

        {

            n /= k;

            a[i] = k;

            i++;

        }

        else

        {

            k++;

        }

    }

    printf("%d", a[0]);

    for (int j = 1; j < i; j++)

    {

        if (a[j] == a[j - 1])

        {

            b[q]++;

        }

        else

        {

            q++;

            b[q] = 1;

            printf("%s", (b[q - 1] > 1) ? "^" : "");

            if (b[q - 1] > 1) printf("%d", b[q - 1]);

            if(j+1!=i)printf("*%d", a[j]);

        }

    }

    if (q > 0)

        printf("%s%d\n", (b[q] > 1) ? "^" : "*", (b[q] > 1) ? b[q] : a[i - 1]);

    else

        printf("\n");

    return 0;

}