Problem:
 Score : 200 points    Problem Statement An integer X is called a Harshad number if X is divisible by f(X) , where f(X) is the sum of the digits in X when written in base 10 .  Given an integer N , determine whether it is a Harshad number.      Constraints  1?N?10^8  N is an integer.         Input Input is given from Standard Input in the following format:  N       Output Print Yes if N is a Harshad number; print No otherwise.        Sample Input 1 12      Sample Output 1 Yes  f(12)=1+2=3 . Since 12 is divisible by 3 , 12 is a Harshad number.       Sample Input 2 57      Sample Output 2 No  f(57)=5+7=12 . Since 57 is not divisible by 12 , 12 is not a Harshad number.       Sample Input 3 148      Sample Output 3 No

Solution (Python):
N = input()
sum_N = 0
for i in range(len(N)):
    sum_N += int(N[i])

if int(N) % sum_N == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys
sys.setrecursionlimit(4100000)
import math
INF = 10**9

def main():
    n = int(input())

    S = list(str(n))
    h = 0
    for s in S:
        h += int(s)
    if n%h == 0:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
sum = 0

for i in str(n):
    sum += int(i)
    
if(n%sum==0):
    print("Yes")
else:
    print("No")

Solution (Python):
N=input()
print("No" if int(N) % sum(map(int, N)) else "Yes")

Solution (Python):

N = int(input())


if N % sum(list(map(int, str(N)))) == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
X = 0
for i in str(N):
    X+=int(i)
    
if N%X == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
N=input()
if int(N)%sum([int(x) for x in N])==0:
  print('Yes')
else:
  print('No')

Solution (Python):
n=int(input())
a=0
m=n
if n==0:
    print("No")

else:
    
    while n>0:
        
        a=a+n%10
        n=n//10
    if m%a==0:
        print("Yes")
    else:
        print("No")

Solution (Python):
N = input()
X = int(N)
l = [int(i) for i in list(N)]
f = sum(l)
if X % f == 0:
  print("Yes")
else:
  print("No")

Solution (Python):
n = list(input())
N = ""
M = 0

for i in range(len(n)):
    N += n[i]
    M += int(n[i])

N = int(N)

if N % M == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())

if n % sum(map(int, list(str(n)))) == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
N = input()
f = 0

for n in N:
  f+=int(n)
  
if int(N) % f==0:
  print("Yes")
else:
  print("No")

Solution (Python):
def actual(N):
    f = lambda x: sum(map(int, str(N)))

    if N % f(N) == 0:
        return 'Yes'

    return 'No'


N = int(input())
print(actual(N))

Solution (Python):
n = input()
ns = sum(list(map(int, list(n))))
print('Yes' if int(n)%ns==0 else 'No')

Solution (Python):




N = int(input())
N_l = list(str(N))
h_x = 0

for x in N_l:
    h_x = h_x + int(x)

if N % h_x == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
def f(X):
    a = 0
    for i in X:
        a += int(i)
    return  a

N = input()

if int(N)%f(N) == 0:
    print("Yes")
else:
    print("No")

Solution (Python):

n = input()
arr = [int(c) for c in n]

if int(n) % sum(arr) == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
x = int(input())

def div(x):
    r = 0
    while x > 0:
        a = x % 10
        r += a
        x //= 10
    
    return r

t = div(x)
if x % t == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
ni = n
x = []
for i in range(10):
  x.append(ni // (10**(10 - i)))
  ni = n % (10 ** (10 - i))
x.append(ni % 10)
print('Yes' if n % sum(x) == 0 else 'No')

Solution (Python):
n=list(input())
suzi=int("".join(n))
for i in range(len(n)):
    n[i]=int(n[i])
if suzi%sum(n)==0:
    print("Yes")
else:
    print("No")

Solution (Python):
n = input()
fx = 0
for i in range(len(n)):
    fx += int(n[i])
if int(n)%fx == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
n = input()

n = list(n)

fn = 0
for i in range(len(n)):
  fn += int(n[i])
  
n = ''.join(n)

if int(n)%fn == 0:
  print("Yes")
else:
  print("No")

Solution (Python):
N = int(input())
sum = 0
n = N
while n > 0:
     sum += n % 10
     n //= 10
if N % sum == 0:
     print("Yes")
else:
     print("No")

Solution (Python):
N = int(input())
ans = 0
t = N
while 1:
    ans += t % 10
    t = t // 10
    if t == 0:
        break
print("Yes" if N % ans == 0 else "No")

Solution (Python):










import sys

def input(): return sys.stdin.readline().rstrip()
def iIn(): return int(input())
def iInM(): return map(int, input().split())
def iInM1(): return map(int1, input().split())
def iInLH(): return list(map(int, input().split()))
def iInLH1(): return list(map(int1, input().split()))
def iInLV(n): return [iIn() for _ in range(n)]
def iInLV1(n): return [iIn()-1 for _ in range(n)]
def iInLD(n): return [iInLH() for _ in range(n)]
def iInLD1(n): return [iInLH1() for _ in range(n)]
def sInLH(): return list(input().split())
def sInLV(n): return [input().rstrip('\n') for _ in range(n)]
def sInLD(n): return [sInLH() for _ in range(n)]

def OutH(lst, deli=' '): print(deli.join(map(str, lst)))
def OutV(lst): print('\n'.join(map(str, lst)))

sys.setrecursionlimit(10 ** 6)

int1 = lambda x: int(x) - 1

INF = int(1e9)
MOD = 1000000007
dx = (-1, 0, 1, 0)
dy = (0, -1, 0, 1)


N = iIn()

fN = sum(list(map(int, list(str(N)))))

ans = 'Yes' if N % fN == 0 else 'No'

print(ans)

Solution (Python):
n = int(input())
m = n
sm = 0
while m > 0:
    sm += m % 10
    m //= 10
print('Yes' if n % sm == 0 else 'No')

Solution (Python):
n = input()
num = int(n)
s = sum(map(int, list(n)))
if num % s == 0:
  print("Yes")
else:
  print("No")

Solution (Python):
n=int(input())

def findsum0fdigit(n):
    sum=0
    while n>0:
        sum+=n%10
        n//=10
    return sum
        
if n%findsum0fdigit(n)==0:
    print("Yes")
else:
    print("No")

Solution (Python):
N=int(input())
temp=N
f=0
for i in range(8):
    f+=N%10
    N-=N%10
    N=N//10

if temp%f==0:
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
dv = 0
for s in str(n):
  dv += int(s)
print('Yes' if n % dv == 0 else 'No')

Solution (Python):
N = list(input())
n = ''.join(N)
N = list(map(int, N))
s = sum(N)
n = int(n)
if n % s == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
N = int(input())

ans = N
digit = 0
while ans>0:
    tmp = ans%10
    digit += tmp
    ans = ans//10

if N%digit==0:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
n = int(s)
x = 0
for c in s:
  x += int(c)

if n % x ==0:
  print('Yes')
else:
  print('No')

Solution (Python):
import math
def main():
  n = int(input())
  x=n
  fx=0
  while x>0:
    fx+=x%10
    x=int(x/10)
  if n%fx==0:
    print('Yes')
  else:
    print('No')
main()

Solution (Python):
x = int(input())
f = 0
for s in str(x):
  f += int(s)
if x%f==0:
  print("Yes")
else:
  print("No")

Solution (Python):
N = int(input())
A = (list(str(N)))

s = 0
for i in range(len(A)):
    s += int(A[i])

if N % s == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
n = input()
list_n = list(n)

fx = 0
for i in list_n:
  fx += int(i)

if int(n)%fx == 0:
  print("Yes")
else :
  print("No")

Solution (Python):
import sys
N = int(input())
array_N = list(map(int,str(N)))

if not (1 <= N <= 10 ** 8):
    sys.exit()

sum_array_N = 0
for I in range(len(array_N)):
    sum_array_N += array_N[I]

if N % sum_array_N == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
n=int(input())
m=n
sum_digit=0
while n>0:
  sum_digit+=n%10
  n=n//10
if m%sum_digit==0:
  print("Yes")
else:
  print("No")

Solution (Python):
def f(x):
  s = 0
  while x > 0:
    s += x % 10
    x = int(x / 10)
  return s

n = int(input())

if n % f(n) == 0:
  print("Yes")
else:
  print("No")

Solution (Python):
n = input()
s = 0
for i in n:
    s += int(i)
if (int(n)%s==0):
    print("Yes")
else:
    print("No")

Solution (Python):
N = input()
fN = 0
for n in N:
    fN += int(n)
if int(N) % fN == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

N = list(s())
ans = 0
for i in range(len(N)):
    ans += int(N[i])
if int(''.join(N))%ans == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
N=input()
ans=0
for i in N:
  ans+=int(i)
if int(N)%ans==0:
  print('Yes')
else:
  print('No')

Solution (Python):
N = input()
print("No" if int(N) % sum(map(int, N)) else "Yes")

Solution (Python):
N = input()
sum_Ndig =sum(map(int,N))
print( 'Yes' if int(N) % sum_Ndig ==0 else 'No')

Solution (Python):
n = int(input())
nn = list(str(n))
num = [int(i) for i in nn]
total = 0
for i in range(len(nn)):
    total += num[i]

if n % total == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
n = int(input())
nn = list(str(n))
num = [int(i) for i in nn]
total = 0
for i in range(len(nn)):
    total += int(num[i])

if n % total == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
N = input()

X = 0

for i in range(len(N)):
  X = X + int(N[i])

if int(N)%X==0:
  print('Yes')
else:
  print('No')

Solution (Python):
N = int(input())
X = sum(map(int,str(N)))

if N%X==0:
  print("Yes")
else:
  print("No")

Solution (Python):
n = int(input())
s = sum(list(map(int,str(n))))
print('Yes' if n%s==0 else 'No')

Solution (Python):
n = int(input())
s = sum(list(map(int,str(n))))
print('Yes' if n%s==0 else 'No')

Solution (Python):
N = int(input())
origin_N = N
my_sum = 0
while True:
    my_sum += N % 10
    if (N < 10):
        print('Yes' if origin_N % my_sum  == 0 else 'No')
        break
    else:
        N = N // 10

Solution (Python):
x = int(input())
n = x
m = 0

while n > 0:
    m = m + n % 10
    n = n // 10

if x % m == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
N = int(input())
A = list(str(N))
A = [int(i) for i in A]
a = sum(A)
if N % a == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
print('Yes' if n % sum(list(map(int, str(n)))) == 0 else 'No')

Solution (Python):
n = int(input())
ni = n
x = []
for i in range(10):
  x.append(ni // (10**(10 - i)))
  ni = n % (10 ** (10 - i))
x.append(ni % 10)

print('Yes' if n % sum(x) == 0 else 'No')

Solution (Python):
n = input()
num = 0
for i in n:
    num += int(i)

n = int(n)
if n % num == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
N = int(input())
n = N
s = 0
for i in range(10):
    a = n % 10
    s += a
    if n // 10 == 0:
        break
    else:
        n = n // 10
if N % s == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
def f(x):
    sum = 0
    while x > 0:
        sum += x % 10
        x //= 10
    return sum

N = int(input())

if N % f(N) == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
if n%sum(int(i) for i in str(n))==0:
  print("Yes")
else:
  print("No")

Solution (Python):
n = int(input())
n_ = n
s = 0 
while n_ > 0:
    r = n_%10
    s += r
    n_ = (n_-r)//10

print('Yes' if n%s==0 else 'No')

Solution (Python):
x = input()
print('No' if int(x) % sum(map(int,x)) else 'Yes')

Solution (Python):
def f(x):
    return sum(map(int, x))

x = input()

if int(x) % f(x):
    print('No')
else:
    print('Yes')

Solution (Python):
N = int(input())
print('Yes' if N%sum(list(map(int, str(N)))) == 0 else 'No')

Solution (Python):
N = int(input())
sum = 0
n = N

while n > 0:
  sum += n%10
  n //= 10

if N%sum == 0:
  print('Yes')
else:
  print('No')

Solution (Python):
n = input()
m = sum(map(int, n))
if int(n) % m == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
s=input()
ss=int(s)
keep=0
for i in range(len(s)):
  keep+=int(s[i])
if ss%keep==0:
  print("Yes")
else:
  print("No")

Solution (Python):
N = int(input())
N_sum = 0
n = N
while n > 0:
  N_sum += n % 10
  n //= 10
if N % N_sum == 0 :
  print("Yes")
else:
  print("No")

Solution (Python):
n_str = input()
print("Yes" if int(n_str) % sum([int(c) for c in n_str]) == 0 else "No")

Solution (Python):
N=input()
S=list(map(int,N))
X=sum(S)
print('Yes' if int(N)%X==0 else 'No')

Solution (Python):
N=input()
S=list(map(int,N))
X=sum(S)
f=int(N)%X
print('Yes' if int(N)%X==0 else 'No')

Solution (Python):
N=input()
S=list(map(int,N))
X=sum(S)
f=int(N)/X

def is_integer_num(n):
    if isinstance(n, int):
        return True
    if isinstance(n, float):
        return n.is_integer()
    return False

print('Yes' if is_integer_num(f) else 'No')

Solution (Python):
N = int(input())
sum_h = sum(int(x) for x in str(N))
print("Yes" if N % sum_h == 0 else "No")

Solution (Python):
n = input()
if int(n) % sum(list(map(int,(n))))==0:
    print("Yes")
else:
    print("No")

Solution (Python):
N=int(input())
X=sum(list(map(int,str(N))))
if N % X ==0:
  print("Yes")
else:
  print("No")

Solution (Python):
n = input()
m = int(n)
c = 0
for i in n:
  c += int(i)
if m % c == 0:
  print("Yes")
else:
  print("No")

Solution (Python):
N = input()

summ_keta = 0

for i in range(len(N)):
    summ_keta += int(N[i])

if (int(N) % summ_keta == 0):
    print('Yes')
else:
    print('No')

Solution (Python):
n = int(input())
m = n
cnt=0
while m:
	cnt += m % 10
	m //= 10
if n % cnt == 0:
	print("Yes")
else:
	print("No")

Solution (Python):
if __name__ == '__main__':
    n = int(input())
    s = str(n)
    sum=0
    for i in s:
        sum+= int(i)

    if n%sum ==0:
        print("Yes")
    else:
        print("No")

Solution (Python):
n = int(input())
f= sum(map(int,str(n)))
if n%f ==0:
    print("Yes")
else :
    print("No")

Solution (Python):
N = input()
f = sum(map(int, N))
if int(N) % f == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
N = int(input())
X = N
f = 0

for i in range(len(str(N))):
    f += N % 10
    N = N // 10

if X % f == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
N=int(input())
M=sum(map(int,str(N)))
print("Yes" if N%M==0 else "No")

Solution (Python):
N=input()
n=int(N)
N=list(N)
check=0
for i in range(0,len(N)):
  check+=int(N[i])
print("Yes" if n%check==0 else "No")

Solution (Python):
N = input()
print("Yes" if int(N)%sum(map(int, N))==0 else "No")

Solution (Python):
N=input();print(['No','Yes'][int(N)%sum([int(i) for i in N])==0])

Solution (Python):
n=input()
nx=int(n)
n=list(n)
n=[int(s) for s in n]
x=sum(n)

if nx%x==0:
    print('Yes')
else:
    print('No')

Solution (Python):
N = int(input())
R = N
t = 0
while True:
  if R > 9:
    t += R%10
    R = R//10
    continue
  else:
    t += R
    break
print("Yes" if N%t == 0 else "No")

Solution (Python):
S = input()
fn = sum(map(int, S))
print('Yes' if int(S)%fn == 0 else 'No')

Solution (Python):
N = input()
fN = sum([int(n) for n in N])
print('Yes' if int(N)%fN==0 else 'No')

Solution (Python):
N = int(input())
Temp = str(N)
L = len(Temp)
Sl = list(Temp)
S = 0
for i in range(L):
    S += int(Sl[i])
if (N%S == 0):
    print("Yes")
else:
    print("No")

Solution (Python):

n = int(input())
def hrsh(x):
  s = 0
  while x > 10:
    s += x % 10
    x = x//10
  s += x
  return s
f = hrsh(n)

if n % f == 0:
  print('Yes')
else:
  print('No')

Solution (Python):
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return map(int, sys.stdin.readline().split())
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): return [[ini]*i for _ in range(j)]





N = ii()

dev = sum(list(map(int, list(str(N)))))

if N % dev:
    print('No')
else:
    print('Yes')

Solution (Python):
x = input()
if int(x) % sum(map(int, x)) == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
def calc(n):
    sum = 0

    while n > 0:
        sum += n % 10
        n //= 10

    return sum


N = int(input())

if N % calc(N) == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
N = input()

n = list(N)

for i in range(len(n)):
  n[i] = int(n[i])

m = int(N)
if m % sum(n) == 0:
  print("Yes")
else:
  print("No")

Solution (Python):
n = int(input())
print("Yes" if n % sum([int(q) for q in str(n)]) == 0 else "No")

Solution (Python):
n=int(input())
m=str(n)
x=0
for i in m:
  x+=int(i)
if n%x==0:
  print('Yes')
else:
  print('No')

Solution (Python):
N = input()
f_X = 0
for c in N:
    f_X += int(c)
if int(N) % f_X == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
S = input()
N = int(S)
fN = sum([int(si) for si in S])
if N%fN == 0:
  print('Yes')
else:
  print('No')

Solution (Python):
n=input()
temp=0
for i in n:
  temp+=int(i)

print('Yes' if int(n)%temp==0 else 'No')

Solution (Python):
n=int(input())
List=list(str(n))
List=[int(List[i]) for i in range(len(List))]
f_x=sum(List)
if n%f_x==0:
    print("Yes")
else:
    print("No")

Solution (Python):
n=int(input())
f=0
frag='No'
for i in range(8):
  f+=n%(10**(i+1))//10**i
if n%f==0:
  frag='Yes'
print(frag)

Solution (Python):
n=input()

tmp=0
for i in range(len(n)):
    tmp+=int(n[i])
if int(n)%tmp==0:
    print('Yes')
else:
    print('No')

Solution (Python):
n = input()
f = 0
for i in range(len(n)):
  f += int(n[i])
if int(n) % f == 0:
  print('Yes')
else:
  print('No')

Solution (Python):
N = input()
x = sum(map(int, list(N)))
print('Yes' if int(N)%x==0 else 'No')

Solution (Python):
n = int(input())
s = str(n)
l = len(s)
sl = list(s)
res=0
for i in range(l):
    res += int(sl[i])

if n % res ==0:
    print("Yes")
else:
    print("No")

Solution (Python):
def main():
    N = int(input())
    sum_N = 0
    judge_N = N

    while True:
        sum_N += (N%10)
        N = N//10
        if N == 0:
            break

    if (judge_N % sum_N) == 0:
        print('Yes')
    else:
        print('No')

main()

Solution (Python):
n = int(input())
c = str(n)
a = 0
for i in c:
    a += int(i)
if n % a == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
x=input()
f=0
for i in range(len(x)):
  f+=int(x[i])
  
if int(x)%f==0:
  print('Yes')
else:
  print('No')

Solution (Python):
n = input()
f = sum(list(map(int, list(n))))
x = int(n)
print('Yes' if x % f == 0 else 'No')

Solution (Python):
def main():
    N = int(input())
    FN = 0
    res = N
    while res >0:
        FN = FN + res%10
        res = res//10
    if N%FN == 0:
        print('Yes')
    else:
        print('No')
    return
main()

Solution (Python):
n = input()
l = len(n)
counter = 0
for i in range(l):
    counter += int(n[i])
n = int(n)
if n % counter == 0: print('Yes')
else: print('No')

Solution (Python):
N = input()
print('Yes' if int(N) % sum(map(int,N)) == 0 else 'No')

Solution (Python):
n = int(input())
f = 0
n_ = n
for i in range(len(str(n))-1,-1, -1):
    f += n_//(10**i) 
    n_ %= (10**i)

if n%f == 0:
    print("Yes") 
else:
    print("No")

Solution (Python):
def digsum(x):
  ldigit = list(x)
  idigit = [int(n) for n in ldigit]
  return sum(idigit)

N = input()

if(int(N) % digsum(N) == 0):
  print("Yes")
else:
  print("No")

Solution (Python):
X = int(input())
str_X = str(X)
Fx = 0
for i in str_X:
    Fx += int(i)
if X % Fx == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
n = input()
print("Yes" if int(n) % sum([int(x) for x in n]) == 0 else "No")

Solution (Python):
n = input()
s = 0
for i in range(len(n)):
    s += int(n[i])
if int(n)%s == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
N = input()
print("Yes" if int(N)%(sum(map(int, N))) == 0 else "No")

Solution (Python):
a = input()
print("Yes" if int(a) % sum(map(int,a)) == 0 else "No")

Solution (Python):
n=input()
num=0
for i in range(len(n)):
    num+=int(n[i])
n=int(n)
if n%num==0:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
n = int(s)
cnt = 0
for a in s:
    cnt += int(a)
if n % cnt == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
M = int(input())
N=str(M)
fx=0
for a in N:
  fx+=int(a)
print('Yes' if M%fx==0 else 'No')

Solution (Python):
M = int(input())
N=str(M)
fx=0
for a in N:
  fx+=int(a)
print('Yes' if M%fx==0 else 'No')

Solution (Python):
def main():
    n = int(input())
    n_f = n
    f = 0
    for i in range(8):
        if n >= 10: 
            f += n % 10
            n  = n // 10
        else:
            f += n % 10
            break
    if n_f % f == 0:
        print('Yes')
    else:
        print('No')
if __name__ == '__main__':
    main()

Solution (Python):
def ABC_80_B():
    N=input()
    N1=list(N)
    x=0
    for i in range(len(N1)):
        x+=int(N1[i])

    if int(N)%x==0:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':

    ABC_80_B()

Solution (Python):


import sys






























def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    s = input()
    n = int(s)
    print('Yes') if n % sum(list(map(lambda x: int(x), list(s)))) == 0 else print('No')


if __name__ == "__main__":
    main()

Solution (Python):
N = int(input())
n = str(N)
l = len(n)
f = 0

for a in range(l):
    f += int(n[a])

if N%f == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
n = input()
fx = 0
for i in range(len(n)):
    fx += int(n[i])
if int(n)%fx==0:
    print('Yes')
else :
    print('No')

Solution (Python):
n = input()


def digit(digits):
    result = 0
    for digit in digits:
        result += int(digit)

    return result

if int(n) % digit(n):
    print('No')
else:
    print('Yes')

Solution (Python):
n = input()
l = list(n)
_sum = 0
for a in l:
    _sum += int(a)
if int(n) % _sum == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
N = str(input())
div = 0

for i in range(0, len(N)):
  div = div + int(N[i])

if int(N) % div == 0:
  print("Yes")
else:
  print("No")

Solution (Python):
N = input()
sum = 0
for i in N:
  sum += int(i)
if int(N) % sum == 0:
  print('Yes')
else:
  print('No')

Solution (Python):
n = int(input())
ans = 0
ch = n
while n!=0:
    ans += n%10
    n = n // 10
if ch % ans == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
N = input()
f = sum(map(int, list(N)))
if int(N) % f == 0:
  print('Yes')
else:
  print('No')

Solution (Python):
s = input()
a = 0
b = int(s)
for i in range(len(s)):
    a += int(s[i])
if b%a == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
n = input()

a = 0
for i in range(len(n)):
    a += int(n[i])

if int(n) % a == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
n = input()
A = list(map(int, n))
print('Yes' if int(n) % sum(A) == 0 else 'No')

Solution (Python):
n = input()

print("Yes" if int(n) % sum(map(int,n)) == 0 else "No")

Solution (Python):
n = int(input())
num = n
total_num = 0

while num != 0:
    total_num += num % 10
    num = num // 10

if n % total_num == 0:
    print('Yes')
else:
    print('No')

Solution (Python):

n=int(input())
fx=0
x=n
while x>0:
    fx+=x%10
    x=x//10

if n%fx==0:
    print("Yes")
    
else:
    print("No")

Solution (Python):
N = int(input())
M = N
sum = 0
while N > 0:
    sum += N % 10
    N = N // 10
print("Yes" if M % sum == 0 else "No")

Solution (Python):

n=int(input())
fx=0
x=n
while x:
    fx+=x%10
    x=x//10

if n%fx==0:
    print("Yes")
    
else:
    print("No")

Solution (Python):
N = input()
f = sum(map(int, N))
print("Yes" if int(N) % f == 0 else "No")

Solution (Python):
n = input()
N = list(n)
sum = 0
for i in N:
  sum += int(i)
  
if int(n)%sum == 0:
  print('Yes')
else:
  print('No')

Solution (Python):
N = int(input())
x = N
f_X = 0

while x > 0:
    f_X += x % 10
    x //= 10

if N % f_X == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
n = input()
fn = sum(int(i) for i in n)
print('Yes' if int(n) % fn == 0 else 'No')

Solution (Python):
N=input()
n=sum(map(int,N))
print("Yes" if int(N)%n==0 else "No")

Solution (Python):
n = int(input())

def digits_sum(x):
    
    s = 0
    
    while x>0:
        s += x % 10
        x //= 10
    
    return s
    
if n % digits_sum(n) == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

n = int(readline())
res = sum(list(map(int,str(n))))
if n % res == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
N = input()

print('Yes' if int(N) % sum(map(int, N)) == 0 else 'No')

Solution (Python):
N = input()
n = int(N)
sum = 0
a = list(N)
for i in range(len(a)):
    sum += int(a[i])

if n%sum==0:
    print('Yes')
else:
    print('No')

Solution (Python):
n = int(input())

fx=sum(map(int, str(n)))
print('Yes' if n%fx==0 else 'No')

Solution (Python):
def main():
    S = input()
    X = int(S)
    fx = sum(map(int, S))
    print('Yes' if X % fx == 0 else 'No')


if __name__ == '__main__':
    main()

Solution (Python):
n=int(input())
temp=list(str(n))
a=0
for i in range(0,len(temp)):
  a=a+int(temp[i])
if n%a==0:
  print("Yes")
else:
  print("No")

Solution (Python):
n=input()
a=int(n)
n=[int(i) for i in n]
if a%sum(n)==0:
    print("Yes")
else:
    print("No")

Solution (Python):
N = input()

S = sum(map(int,list(N)))

if int(N)%S == 0:
  print("Yes")
else:
  print("No")

Solution (Python):
n=input()

f=sum([int(_) for _ in n])



if int(n)%f==0:
  print("Yes")
else:
  print("No")

Solution (Python):
s = input()
w = 0
n = int(s)

for i in range(len(s)):
  w += int(s[i])
print("Yes" if n%w == 0 else "No")

Solution (Python):
n = int(input())
ln = list(str(n))
ln = [int(n) for n in ln]

total = sum(ln)
if n % total == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
N = input()
sm = sum(map(int, N))
N = int(N)

if N % sm == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
n = input()
total = sum(list(map(int, list(n))))
num = int(n)
if num % total == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
n = int(input())
summ = sum(list(map(int,str(n))))
if n % summ == 0:
    print("Yes")
else :
    print("No")

Solution (Python):
N = input()
print('Yes' if not int(N) % sum([int(x) for x in N]) else 'No')

Solution (Python):
N=input()
S=sum(map(int, list(N)))
N=int(N)

if N%S==0:
    print("Yes")
else:
    print("No")

Solution (Python):
N = str(input())
ans = 0
for n in list(N):
    ans += int(n)

if int(N)%ans==0:
    print('Yes')
else:
    print('No')

Solution (Python):
n = input()

s = 0
for i in n:
  s += int(i)

if int(n) % s == 0:
  print("Yes")
else:
  print("No")

Solution (Python):
def main():
    n = input()
    w = 0
    for i in n:
        w += int(i)
    if int(n)%w == 0:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
f = sum(list(map(int, str(N))))

if N%f == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
N_list = list(str(N))
n = 0
for i in N_list:
    n += int(i)

if N % n == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
def resolve():
  n = input()
  x = int(n)
  fx = 0
  for c in n:
    fx += int(c)
  if x % fx == 0:
    print('Yes')
  else:
    print('No')

  return

if __name__ == "__main__":
  resolve()

Solution (Python):
n = list(input())
print("Yes" if int("".join(n)) % sum(map(int, n))== 0 else "No")

Solution (Python):
s=input()
t_sum=0
for ss in s:
  t_sum+=int(ss)
if int(s)%t_sum==0:
  print("Yes")
else:
  print("No")

Solution (Python):
N = int(input())

M = str(N)
d = 0
for i in range(len(M)):
  d += int(M[i])

if N%d == 0:
  print("Yes")
else:
  print("No")

Solution (Python):
s=input()
a=0
for i in range(len(s)):
  a+=int(s[i])
print('Yes' if int(s)%a==0 else 'No')

Solution (Python):

N = int(input())

total = 0
for c in str(N):
    total += int(c)

if N % total == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
def check():
    N = input()
    if int(N)%sum(map(int,list(N)))==0:
        return 'Yes'
    return 'No'
print(check())

Solution (Python):
s = input()
n = int(s)
colsum = 0
for i in s:
    colsum += int(i)

print('Yes' if n%colsum == 0 else 'No')

Solution (Python):
from sys import stdin
from sys import setrecursionlimit
setrecursionlimit(10 ** 7)

s = stdin.readline().rstrip()
point = 0

for i in s:
    point += int(i)

if int(s)%point == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
def main():
    n = int(input())
    digit_sum = 0
    now = n
    while now > 0:
        digit_sum += now % 10
        now //= 10
    print("Yes" if n % digit_sum == 0 else "No")


if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
if n % sum(list(map(int, list(str(n))))) == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
def split_sum(n):
    ans = 0
    while n:
        ans += n % 10
        n //= 10
    return ans


N = int(input())
print('Yes' if N % split_sum(N) == 0 else 'No')

Solution (Python):
n=input()
sum=0
for i in n:
    sum+=int(i)
if int(n)%sum==0:
    print("Yes")
else:
    print("No")

Solution (Python):
n = input()
print('Yes' if int(n) % sum(map(int,n)) == 0 else 'No')

Solution (Python):
import sys

input = sys.stdin.readline


def main():
    N = int(input())

    f = sum(int(d) for d in str(N))
    if N % f == 0:
        ans = "Yes"
    else:
        ans = "No"

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
n = int(input())
total = sum(list(map(int, str(n))))
print ("Yes") if n%total == 0 else print ("No")

Solution (Python):
n_original =  int(input())
n = n_original
sum = 0
while n//10 != 0:
  sum += n%10
  n = n//10
sum += n
if n_original%sum==0:
  print('Yes')
else:
  print('No')

Solution (Python):
n = input()
print("Yes" if int(n) % sum(map(int, n)) == 0 else "No")

Solution (Python):
n=int(input())
a=sum(map(int, str(n)))
print("Yes" if n%a==0 else "No")

Solution (Python):
n = int(input())
m = n
r = 0
flg = True
while flg:
  a = n%10
  n //= 10
  r += a
  if n == 0:
    flg = False
if  m % r == 0:
  print('Yes')
else:
  print('No')

Solution (Python):
n = input()
ans = 0
for i in n:
    ans += int(i)
if int(n)%ans == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
s = str(n)
f = 0
for c in s:
  f += int(c)
if n % f == 0:
  print('Yes')
else:
  print('No')

Solution (Python):
n = input()
fx = sum(list(map(int,list(n))))
if int(n)%fx == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
print("Yes" if N % sum(map(int, str(N))) == 0 else "No")

Solution (Python):
n = input()

print('Yes') if int(n) % sum(list(map(int, list(n)))) == 0 else print('No')

Solution (Python):
N = int(input())

a = N
c = 0
while a > 0:
    c += a % 10
    a = int(a / 10)
if N % c == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
def main():
    n = int(input())

    sum = 0

    for digit in str(n):
        sum += int(digit)
    
    if n % sum == 0:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

Solution (Python):
n = input()
print(['No', 'Yes'][int(int(n) % sum([int(x) for x in n]) == 0)])

Solution (Python):
s=input()
a=0
for i in range(len(s)):
  a+=int(s[i])
  
n=int(s)

if n%a==0:
  print("Yes")
else:
  print("No")

Solution (Python):
n = input()
print("Yes" if int(n) % sum(map(int,n))  == 0 else "No")