----------------------------1164---------------Similar to the one that was done the previous day, the leap year birthday. _______________________________________

//The key is that the idea of this topic can be used and that one leap year birthday of that one method.//give you a number to make you yo. The product of the prime of Monaco marks him out .... In fact, it's quite simple. I read the main question or method//or should read more books, read more. The speed of the problem is up. Maybe this is what the predecessor said Ax ...//data structure, number theory ... Should all be knowledge in number theory. Winter Vacation Buy some books to see often use from the topic to explore just//It's not always a good idea, but biology is always a problem in high school. The results were blinded by some quality problems that were not too good .//you should read and do the same. You'll have to allocate time later. The two times should be kept flat .#include <stdio.h>intMain () {intI,n;  while(SCANF ("%d", &n)! =EOF) {         for(i=2; i*i<=n;i++)//If a number is not prime and can be two or more than two of the product composition of the number, then its components must be less than equal to the number of open root.        {            if(n%i==0) {n=n/i; printf ("%d*", i); I=1; }} printf ("%d\n", N); }    return 0;}//A number must be divisible by 1. If it is even, it can be divisible by 2. If it is odd and not a prime number, it must be divisible by three.//this should be the key to solving the problem quickly.

----------------------------1164---------------Similar to the one that was done the previous day, the leap year birthday. _______________________________________