poj1142(质因数分解)

http://poj.org/problem?id=1142

Smith Numbers

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 10279		Accepted: 3610

Description

While skimming his phone directory in 1982, Albert Wilansky, a mathematician of Lehigh University,noticed that the telephone number of his brother-in-law H. Smith had the following peculiar property: The sum of the digits of that number was equal to the sum of the digits of the prime factors of that number. Got it? Smith's telephone number was 493-7775. This number can be written as the product of its prime factors in the following way:
4937775= 3*5*5*65837
The sum of all digits of the telephone number is 4+9+3+7+7+7+5= 42,and the sum of the digits of its prime factors is equally 3+5+5+6+5+8+3+7=42. Wilansky was so amazed by his discovery that he named this kind of numbers after his brother-in-law: Smith numbers.
As this observation is also true for every prime number, Wilansky decided later that a (simple and unsophisticated) prime number is not worth being a Smith number, so he excluded them from the definition.
Wilansky published an article about Smith numbers in the Two Year College Mathematics Journal and was able to present a whole collection of different Smith numbers: For example, 9985 is a Smith number and so is 6036. However,Wilansky was not able to find a Smith number that was larger than the telephone number of his brother-in-law. It is your task to find Smith numbers that are larger than 4937775!

Input

The input file consists of a sequence of positive integers, one integer per line. Each integer will have at most 8 digits. The input is terminated by a line containing the number 0.

Output

For every number n > 0 in the input, you are to compute the smallest Smith number which is larger than n,and print it on a line by itself. You can assume that such a number exists.

Sample Input

4937774
0

Sample Output

4937775

Source

Mid-Central European Regional Contest 2000

题意：给定一个数n，若n的各位数之和与n的所有质因数各位之和相等，则n为simth数。现在对于输入的一个数n，找出一个大于n的最小的一个simth数，并输出。

思路：一个合数一定能被分解为几个比它的平方根小的素数和一个比它平方根大的一个素数的乘积。利用就能很快的求得它的所有质因子了。

#include
#include
#include
#include
using namespace std;
bool prime (int num)//快速判断素数
{
  if (num == 2 || num == 3 || num == 5)
    return true;
  if (num % 2 == 0 || num % 3 == 0 || num % 5 == 0 || num == 1)
    return false;

  unsigned long c = 7;
  int maxc = int (sqrt((double)num));
  while (c <= maxc)
    {
      if (num % c == 0)
        return false;
      c += 4;
      if (num % c == 0)
        return false;
      c += 2;
      if (num % c == 0)
        return false;
      c += 4;
      if (num % c == 0)
        return false;
      c += 2;
      if (num % c == 0)
        return false;
      c += 4;
      if (num % c == 0)
        return false;
      c += 6;
      if (num % c == 0)
        return false;
      c += 2;
      if (num % c == 0)
        return false;
      c += 6;
    }
  return true;
}

int getsum(int x)
{
    int sum=0;
    while(x/10!=0)
    {
        sum+=x;
        x/=10;
    }
    sum+=x;
    return sum;
}
bool is_Smith(int n)//判断smith数
{
    int k=n;
    int sum1=getsum(k);//sum1先获得原始个个数的和
    int sum2=0;
    for(int i=2;i<=(int)sqrt((double)n);)//注意这里的平方根(n)也要在不停的更新
    {
        if(n%i==0)//找到质因子
        {
            sum2+=getsum(i);
            n/=i;
            i=2;//重新更新i
        }
        else//找不到，则往后找
        {
            i++;
        }
    }
    sum2+=getsum(n);//最后还有一个质因子
    if(sum1==sum2)
    {
        return true;
    }
    return false;
}
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        if(n==0)
        {
            break;
        }
        while(++n)
        {
            if(!prime(n))
            {
                if(is_Smith(n))
                {
                    printf("%d\n",n);
                    break;
                }
            }
        }
    }
    return 0;
}