Boston number program

#1

Sir please explain the question and also send me its coding

#2

hi @ritikbunty2511_729d0258992e0982,
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

#3

Sir, Vector is later in the course, so would you please suggest me any other way to solve this question?

#4

https://ide.codingblocks.com/s/678368 this is what I have coded, please suggest some optimization to this.

#5

maybe u can check the composite part in sqrt of n approach
and ive updated the code refer this

#6

sir 5 is not a Boston number, but when I give 5 as an input, i am getting 1 as an output. How?

#7

sir please my question.

#8

hi @ritikbunty2511_729d0258992e0982 sorry i missed this doubt…
u can explicitly check for prime no before hand, btw in coding blocks test case we dont have prime no in test case