You are viewing a single comment's thread. Return to all comments →
int solve(int n) { int sum,sumf,i; sum=sumOfdigits(n); sumf=sumOfdigitofFactors(n); if(sum==sumf){ return 1; } return 0; } int sumOfdigits(n) { int sum=0,r; while(n!=0){ r=n%10; sum=sum+r; n=n/10; } return sum; } int sumOfdigitofFactors(int n){ int i,sum,cnt=0; sum = 0 ;
while (n % 2 == 0) { sum=sum+2; n = n / 2; } for(i=3;i<=n;i=i+2){ while(n%i==0){ if(i>=10){ cnt = sumOfdigits(i); sum = sum + cnt; } else{ sum=sum+i; }
n=n/i; }
} return sum; }
Seems like cookies are disabled on this browser, please enable them to open this website
Identify Smith Numbers
You are viewing a single comment's thread. Return to all comments →
int solve(int n) { int sum,sumf,i; sum=sumOfdigits(n); sumf=sumOfdigitofFactors(n); if(sum==sumf){ return 1; } return 0; } int sumOfdigits(n) { int sum=0,r; while(n!=0){ r=n%10; sum=sum+r; n=n/10; } return sum; } int sumOfdigitofFactors(int n){ int i,sum,cnt=0; sum = 0 ;
while (n % 2 == 0) { sum=sum+2; n = n / 2; } for(i=3;i<=n;i=i+2){ while(n%i==0){ if(i>=10){ cnt = sumOfdigits(i); sum = sum + cnt; } else{ sum=sum+i; }
} return sum; }