1059. Prime Factors (25)

#include<cstdio>
#include<algorithm>
using namespace std;

#define maxn 100010
int prime[maxn]={0};
bool p[maxn]={0};

struct factor
{
  int x;
  int cnt;
}fac[10];
void init_p()
{
  int x=0;
  p[0] = p[1] = true;
  for(int i=2; i<maxn; i++)
  {
    if(p[i]==false)
    {
      prime[x++] = i;
      for(int j=2*i; j<maxn; j+=i)
        p[j] = true;
    }
  }
}

int main()
{
  int num=0,n,m;

  scanf("%d",&m);
  init_p();
  n = m;
  int i=0;
  if(n==1)
    printf("1=1");
  else
  {
    while(n != 1)
    {
      if(n % prime[i] == 0)
      {
        fac[num].x = prime[i];
        fac[num].cnt = 0;
        while(n % prime[i] == 0)
        {
          fac[num].cnt++;
          n = n/prime[i];
        }
        num++;
      }
      i++;
    }
    printf("%d=",m);
    for(int i=0; i<num; i++)
    {
      if(i>0)
        printf("*");
      if(fac[i].cnt>1)
        printf("%d^%d",fac[i].x,fac[i].cnt);
      else
        printf("%d",fac[i].x);
    }
  }
  return 0;
}