辗转相除求因子（极简C语言）

解题思路:从最小质数开始除，辗转相除，除出所有同一个质数，才到下一个质数，除到最后一个质数为止

注意事项:不将数n直接循环遍历，用中介 t 代替，因为过程中数n会被重赋值，进入死循环。

参考代码:

#include<stdio.h>

int main()

{

            int x,y,t,n=0;

            scanf("%d%d",&x,&y);

            for(t=x;t<=y;t++)

            {           n=t;

                         printf("%d=",n);

                     for(int i=2;i<=n;i++)//从最小质数开始

                             {

                                      while(n!=i)//判断最后的质数

                                            {

                                                if(n%i==0)//由于while，除尽某同质数，才进下一位

                                                {

                                                    printf("%d*",i);

                                                        n/=i;

                                                 }//辗转相除法

                                                 else

                                                 {

                                                        break;//无法取整则结束本次while循环

                                                   }

                                            }

                                }

                        printf("%d\n",n);//最后的质数

            }

            return 0;

}