poj 1142 Smith Numbers 筛法
Smith Numbers
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 13503 | Accepted: 4603 |
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!
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
题意:给你一个n,找最小的且比n大的Smith数;
思路:从n+1开始枚举每个比n大的数,如果它是Smith数,那么它一定是最小的;#include<iostream> #include<cstdio> #include<cmath> #include<cstring> #include<queue> #define M 32000 using namespace std;//筛法找<=31623的素数 int got(int a) { int sum=0; while(a) { sum+=(a%10); a/=10; } return sum; } int p[M]; bool visit[M]; int np=0; void iii() { memset(visit,true,sizeof(visit)); visit[1]=0; for(long long i=2; i<M; ++i) { if(visit[i]==true) { p[np++]=i; for(long long j=i*i; j<M; j+=i) { visit[j]=false; } } } } int main() { iii(); int n,m,s1,s2,i,j,t; while(~scanf("%d",&n)) { if(n<=0) break; for(i=n+1;; i++) { int d=sqrt(i+0.5),jug=0; for(j=0; p[j]<=d; j++)//由于n比较大,所以只能枚举每个小于sqrt(n)的素数看n能否被它整除来判断是否是素数 if(i%p[j]==0) { jug=1; break; } if(jug==0) continue; m=i; s1=0; while(m) { s1+=m%10; m/=10; } t=i; s2=0; for(j=0; p[j]<=d; j++) { while(t%p[j]==0) { t/=p[j]; s2+=got(p[j]); } } if(t!=1) s2+=got(t); if(s2==s1) break; } printf("%d\n",i); } return 0; }