以下是程序代码：


#include<stdio.h>
#include<math.h>
#define COUNT 6542

unsigned int zs[COUNT];                          //用于存放素数

void qzsf();
void fj();

void qzsf ()                                     //求素数，并存放在zs
{
    static unsigned int zs[COUNT];
    int z = -1;
    int i,j;
    double k;
    for(i = 2;i < 65535;i++)
    {
        k = sqrt (i);
        for(j = 2;j <= k;j++)
            if(i%j == 0)
                break;
        if(j>k)
            zs[++z] = i;
    }
}

void fj (unsigned num)                              //用递归输出结果
{
    int i;
    static unsigned int zs[COUNT];
    for(i = 0;zs[i] <= num;i++)
        if(num%zs[i] == 0)
        {
            printf ("%d*",zs[i]);
            fj (num%zs[i]);
        }
        else
        {
            printf ("%d\n",num);
        }
}

main()                                             //调用fj函数，对输入的数分解
{
    unsigned int num;
    printf ("The number:");
    scanf ("%ld",&num);
    fj (num);
}

你找孔名的帖子看吧..好理解..也比较全

#include<stdio.h>
#include<math.h>
void answer(int num,int m,int a/*?????ò×?*/)
{
    if(a<m)
    {
       num%a==0?printf("%d,",a),num/=a:a++;
       answer(num,m,a);
    }
    else printf("%d",num);
}
int main(void)
{
    int n;
    while(scanf("%d",&n)!=EOF)
       answer(n,n,2);
   return 0;
}

没反应？难道我写错呢？

原题不是要合分解的数尽可能多么，还是另一题

" border="0" />[color=white]

不好意思，我们大队对上网时间有限制，没能在线等，谢谢各位的帮助，我先看看

#include<stdio.h>
void main()
{
     int y,x;
     scanf("%d",&y);
     if(y!=1)printf("1 ");/*实现1的输出*/
     void answer(int x);
     answer(y);
     system("pause");
     }
     void answer(int x)/*定义函数实现该分解目的*/
     {
     int i,j,k;
     int prime(int x);
     if(prime(x)==1) printf("%d",x);
     else
     for(i=2;i<x;i++)
     if(x%i==0 && prime(i)==1)
     {printf("%d ",i);
     k=x/i;
     answer(k);
     break;
     }
     }
       int prime(int x)/*判断是否为素数*/
     {
         int i,j,z;
         if(x==1||x==2) z=1;
         else{
         for(i=2;i<x;i++)
         {z=0;
          if(x%i==0)break;
          z=1;
          }
          }
         return(z);
         }