zoj 1133 Smith Numbers

#include<stdio.h>#include<math.h>int sumdigit(int n){    int sum = 0;    while(n != 0)    {        sum += n%10;        n /= 10;    }    return sum;}int Prime(int n)    {    int i, tn=n, sum =0;    for( i = 2; i*i <= n; i++ )    { while(n%i == 0) {     sum += sumdigit(i);     n /= i; }    }    if(tn == n)        return -1;    if(n != 1)        sum += sumdigit(n);    return sum;}int main(){    int n, i;    while(scanf("%d", &n) != EOF)    {       if (n == 0) break;       for(i=n+1; ; i++)       {          if (sumdigit(i) == Prime(i))          {  printf("%dn",i);  break;          }       }    }    return 0;  }