sir in this question i am unable to understand how we will find the sum of prime factors
Check boston number
hi @abhinavai21_5c95a2a2e1fb9fe8,
here u need to find the number whose sum of digits are equal to sum of digits of its factor except 1
check here for implementation ive commented the code : https://ide.codingblocks.com/s/656874
sir why limit of is till sqrt(n) in the solution
@abhinavai21_5c95a2a2e1fb9fe8 that’s the optimised way to check you can go further but that will give TLE