提交记录 #29

编译情况：编译成功

code.c: In function ‘main’:
code.c:5:24: warning: unused variable ‘f’ [-Wunused-variable]
    5 |     int i=0,num=0,m2=0,f=0,p=0,n1,n2=0;
      |                        ^
code.c:5:19: warning: unused variable ‘m2’ [-Wunused-variable]
    5 |     int i=0,num=0,m2=0,f=0,p=0,n1,n2=0;
      |                   ^~

固定测试点#1:

Accepted

0.000s

496 kB

固定测试点#2:

Accepted

0.000s

228 kB

固定测试点#3:

Accepted

0.000s

556 kB

额外测试点#1:

Runtime Error: - Returning:-8

0.003s

232 kB

M62【期中测验6】质因子分解2

#include<stdio.h>
int main()
{
    int n,m[168]={0,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997};
    int i=0,num=0,m2=0,f=0,p=0,n1,n2=0;
    scanf("%d",&n);
    printf("%d=",n);
    n1=n;
    while(n>1)
    {
        for(i=1;i<=168;i++)
        {
            if(n%m[i]==0)
            {
                p++;
                while(n%m[i]==0)
                {
                    num+=1;
                    //printf("\n%d  %d\n",n,num);
                    n/=m[i];
                    //printf("\n%d  %d\n",n,num);
                }
                if(num>1)
                {
                    if(n2>1)
                    printf("*");
                    printf("%d^%d",m[i],num);
                    if(n==1)
                    {
                        printf("\n");
                        return 0;
                    }
                }
                else if(n!=1&&p!=1)
                {
                    printf("*%d",m[i]);
                    if(n==1)
                    {
                        printf("\n");
                        return 0;
                    }
                }
                else if(p==1)
                {
                    printf("%d",m[i]);
                    if(n==1)
                    {
                        printf("\n");
                        return 0;
                    }
                }
                else if(n==1&&m[i]!=n1)
                {
                    printf("*%d\n",m[i]);
                    return 0;
                }
                else if(m[i]==n1)
                {
                    printf("%d",m[i]);
                    return 0;
                }
                n2=num;
                num=0;
            }
        }
    }    
    return 0;
}