We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
My solution using C++. Hope you have a good day
#include <bits/stdc++.h>
using namespace std;
long long ndigits(unsigned long long n){
long long dem=0;
while(n!=0){
dem+=n%10;
n/=10;
}
return dem;
}
long long primeFactorsDigitsSum(unsigned long long n)
{
long long dem=0;
for(int i = 2; i <= n; i++){
while(n % i == 0){
dem+=ndigits(i);
n /= i;
}
}
return dem;
}
int main(){
long long n;
cin>>n;
if (primeFactorsDigitsSum(n)==ndigits(n)){
cout<<1;
return 0;
}
cout<<0;
return 0;
}
Cookie support is required to access HackerRank
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 →
My solution using C++. Hope you have a good day
#include <bits/stdc++.h> using namespace std; long long ndigits(unsigned long long n){ long long dem=0; while(n!=0){ dem+=n%10; n/=10; } return dem; } long long primeFactorsDigitsSum(unsigned long long n) { long long dem=0; for(int i = 2; i <= n; i++){ while(n % i == 0){ dem+=ndigits(i); n /= i; } } return dem; } int main(){ long long n; cin>>n; if (primeFactorsDigitsSum(n)==ndigits(n)){ cout<<1; return 0; } cout<<0; return 0; }