POJ-----1142---Smith Numbers

Smith Numbers

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 13659		Accepted: 4649

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

给一个数，求比他大的史密斯数

史密斯数是这个数各个位的数字之和等于它的素因子各个位之和

刚开始想复杂了，是个暴力，依次枚举比它大的数就可以了

素数不能拆分成素因子的乘积形式，加上这个剪枝

#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
#include<string>
#include<algorithm>
#include<map>
#include<set> 
#include<queue>
#include<vector>
#include<functional>
#define PI acos(-1.0)
#define INF 0x3f3f3f3f
#define CL(a, b) memset(a, b, sizeof(a))
using namespace std;
typedef long long LL;
const int maxn = 1e5+10;
const int MOD = 1e9+7; 
bool is_prime(int c){
	for(int i = 2; i*i <= c; i++){
		if(c%i == 0) return false;
	}
	return true;
}
int get_num(int c){
	int ans = 0;
	while(c){
		ans += c%10;
		c /= 10;
	}
	return ans;
}
int solve(int c){
	if(is_prime(c)) return get_num(c);
	else{
		for(int i = (int)sqrt(c*1.0); i > 1; i--){
			if(c%i == 0) return solve(i) + solve(c/i);
		}
	}
}
int main(){
	int a, n, t;
	while(scanf("%d", &a) == 1 && a){
		while(++a){
			if(!is_prime(a) && solve(a) == get_num(a)){
				printf("%d\n", a);
				break;
			}
		}
	}
	return 0;
}