INLAB 1

Given a four digit number 'x', write an algorithm to check whether ‘x’ is divisible by the sum of the digits of ‘x’. A number ‘a’ is said to be divisible by ‘b’, if the remainder is zero when ‘a’ divides ‘b’.

For example, the number ‘x’ is 1234 is not divisible by 10, because if we divide ‘1234’ with the sum of its individual digits (1+2+3+4 = 10), the remainder is not zero.  

Code:

n=int(input())

m=n

s=0

while(n):

last=n%10

s=s+last

n=n//10

if(m%s==0):

print('Divisible')

else:

print('Not divisibe')

Input:

The number 'n'

Processing:

while(n):

last=n%10

s=s+last

n=n//10

Output:

Print either 'Divisible' or 'Not divisible'

Pseudo Code:

1) Read the number 'n' to be checked

2) Find the sum of the digits of 'n' and let it be 's'

3) If 'n' is divisible by the sum => n%s==0

4) If 'n' is divisible by 's' then print 'Divisible' else print 'Not divisible'

Flow Chart:

******************************************************************************************