[C] an exploded job language quality factor (cycles prime number decomposition)

Determined interval [a, b] for all integers prime factor decomposition. Each output line of a number of decomposition, the form k = a1 * a2 * a3 ... (a1 <= a2 <= a3 ..., k is from small to large)

#include<stdio.h>
int sushu(int n)
{
int a;
for(a=2;a*a<=n;a++)
{
if(n%a==0) return a;
}
return n;
}
int main()
{
int a,b,i,t=1,m;
scanf("%d %d",&a,&b);
for(i=a;i<=b;i++)
{
printf("%d=",i);
t=sushu(i);
m=t;
if(t==i)
{
printf("%d\n",i);
continue;
}
else
{
printf("%d*",t);
while(1)
{
t = sushu(i/m);
if(t==1)
break;
m*=t;
if(m!=i)
printf("%d*",t);
else
printf("%d\n",t);
}
}

}

return 0;
}