TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
# your code goes here
import copy
N=int(input())
k = copy.copy(N)
 
a=[]
while k != 0:
	a.append(k%10)
	k = k//10
 
if N%sum(a)==0:
	print('Yes')
else:
	print('No'

# your code goes here
import copy
N=int(input())
k = copy.copy(N)

a=[]
while k != 0:
	a.append(k%10)
	k = k//10

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

Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n = input()

tmp = int(n[0])+int(n[1])+int(n[2])

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

n = input()
tmp = 0

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

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

n = input()

tmp = n[0]+n[1]+n[2]

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

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
def digit_sums(N: int) -> bool:
    s = 0
    while N > 0:
        s += N % 10
        N //= 10
    return N % s == 0


if __name__ == "__main__":
    N = int(input())
    ans = digit_sums(N)
    print(ans)


def digit_sums(N: int) -> bool:
    s = 0
    temp = N
    while temp > 0:
        s += temp % 10
        temp //= 10
    return N % s == 0


if __name__ == "__main__":
    N = int(input())
    yes = digit_sums(N)
    print('Yes' if yes else 'No')


Verdicts: Wrong Answer

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n = input()
nl = [int(i) for i in n]
ns = sum(nl)
print(["No", "Yes"][n % ns == 0])

n = input()
nl = [int(i) for i in n]
ns = sum(nl)
print(["No", "Yes"][int(n) % ns == 0])

Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
s=input()
n=int(s)
m=0
for i in s:
    m+=i
if n%m==0:
    print("Yes")
else:
    print("No")

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

Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
N = input()

total = 0
for i in N:
  total += int(i)

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

N = input()

total = 0
for i in N:
  total += int(i)

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

Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
num=input()
num1=num
j=0
while int(num)>0:
  j+=int(num)%10
  num = int(num)/10
print(j)
if int(num1)%j==0:
  print("Yes")
else:
  print("No")

num=input()
num1=num
j=0
while int(num)>0:
  j+=int(num)%10
  num = int(num)/10
print(j)
print(int(num1)%j==0)

num=input()
j=0
for i in range(1,10):
  j+=num//10^i
print(num%j==0)

num=input()
j=0
while int(num)>0:
  j+=int(num)%10
  num = int(num)/10
print(int(num)%j==0)

num=input()
num1=num
j=0
while int(num)>0:
  j+=int(num)%10
  num = int(num)/10
if int(num1)%j==0:
  print("Yes")
else:
  print("No")

Verdicts: Wrong Answer

Wrong Answer

Runtime Error

Wrong Answer

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
s = input()
N = int(s)
S = sum(map(int, list(s)))
if N % S == 0:
    print("yes")
else:
    print("no")


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


Verdicts: Wrong Answer

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n = int(input())
s = sum(list(map(int,str(n))))
print(s)
if n%s == 0:
    print("Yes")
else:
    print("No")

n = int(input())
s = sum(list(map(int,str(n))))

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

Verdicts: Wrong Answer

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n=input()

sm=0

fot i in range(10):
	sm+=n[i]

res='No'

if n%sm==0:
	res='Yes'

print(res)    

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

res='No'
 
if int(n)%sm==0:
	res='Yes'

print(res)

Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n = int( input ())
s = sum(list( map ( int ,list ( str ( n ) ) ) )
if n % s == 0:
  ans = 'Yes'
else :
  ans = 'No'
print(ans)

n = int( input ())
s = sum( list ( str ( n ) ) )
if n % s == 0 :
  ans = 'Yes'
else :
  ans = 'No'
print(ans)

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

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n=input()
N=int(n)
tmp=list(n)

c=0
for i in tmp():
    c+=int(i)

if N%c==0:
    print("yes")
else:
    print("no")

n=input()
N=int(n)
tmp=list(n)

c=0
for i in tmp:
    c+=int(i)

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

Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
N = input()
numN = int(N)
S =0
for i in range(len(N)):
    S += int(N[i])
 
if nunN % S == 0:
    print('Yes')
else:
    print('No')

N = input()
numN = int(N)
S =0
for i in range(len(N)):
    S += int(N[i])

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

N = input()
numN = int(N)
S =0
for i in range(len(N)):
    S += int(N[i])
 
if numN % S == 0:
    print('Yes')
else:
    print('No')

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
x = input()
s = sum(map(int, x))
n = int(x)
print('Yes' if n // s == 0 else 'No')

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

Verdicts: Wrong Answer

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):


N=input()
sn=sum(map(int,list(N))))

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



N=input()
sn=sum(map(int,list(N)))

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

Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n =input()
nn=list(n)
a=0
for i in nn:
    a+=int(i)
print(a)
if int(n) % a == 0:
    print("Yes")
else:
    print("No")

n =input()
nn=list(n)
a=0
for i in nn:
    a+=int(i)

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

Verdicts: Wrong Answer

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
a = int(input())
b = sum(list(map(int,list(str(a)))))
ans = a%b
print(ans)
print("Yes" if ans == 0 else"No")

a = int(input())
b = sum(list(map(int,list(str(a)))))
ans = a/b
print("Yes" if ans == o else"No")

a = int(input())
b = sum(list(map(int,list(str(a)))))
ans = a%b
print("Yes" if ans == 0 else"No")

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n = input()
if int(n) % sum(map(int, n)) == 0:
  print('Yes')
else;
  print('No')


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


Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n = input()
x = list(n)

sum1 = sum(list(map(int,x)))

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

def sum(x):
  y = x;
  sum = 0
  while y > 0:
    sum = sum + (y % 10)
    y = y // 10

  return sum

i = int ( input () )
print( "Yes" if (x % sum(x) == 0) else "No")


a = int(input())

soma = 0
b = str(a) 
for i in range(len(b)):
    soma += int(b[i])

if(a%soma == 0):
    print("YES")
else:
    print("NO")


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


Verdicts: Wrong Answer

Runtime Error

Wrong Answer

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n = int(input())
i = n
m = 0
while i > 0
    m += i % 10
    i = i // 10

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

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

Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n=int(input())
s=list(str(n))
S=0
for i in range(len(s)):
  S+=int(s[i])
if n%S==0:
  print('Yes')
elsE:
  print('No')


n=int(input())
s=list(str(n))
S=0
for i in range(len(s)):
  S+=int(s[i])
if n%S==0:
  print('Yes')
else:
  print('No')


Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n=list(input())
s=sum(n)
n=int(n)
if n%s==0:
    print("Yes")
else:
    print("No")

n=int(input())
nl=str(n)
l=map(int,list(nl))
s=sum(l)

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


Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n=input();print("YNeos"[sum(map(int,list(n)))%int(n)!=0::2])

n=input();print("YNeos"[int(n)%sum(map(int,list(n)))!=0::2])

Verdicts: Wrong Answer

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n = input()
li = []
for i in n:
  li.append(int(i))
if n % sum(li) == 0:
  print("Yes")
else:
  print("No")

n = input()
li = []
for i in n:
  li.append(int(i))
if int(n) % sum(li) == 0:
  print("Yes")
else:
  print("No")


Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
while tmp > 0:
    sum += tmp % 10
    tmp /= 10

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

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

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

n =int(input())

s=eval("+".join(str(n)))
if n % s ==0:
  print('Yes')
else:
  print('No')

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
N, K = map(int, input().split())
L = list(map(int, input().split()))

if N == K:
    print(1)
elif N / K == 1:
    print(2)
else:
    print(int(N / (K-1)))


N = input()
S = 0

for i in N:
    S += int(i)

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


Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n=input()
a=len(n)
p=0
m=0
while True:
    m+=int(n[p])
    p+=1
    if m==a:
        break
if int(n)%m==0:
    print('Yes')
else:
    print('No')

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


Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
# python template for atcoder1
import sys
sys.setrecursionlimit(10**9)

N = input()
di = 0
for c in N:
    di += int(c)
if N % di == 0:
    print("Yes")
else:
    print("No")


# python template for atcoder1
import sys
sys.setrecursionlimit(10**9)

N = input()
di = 0
for c in N:
    di += int(c)
if int(N) % di == 0:
    print("Yes")
else:
    print("No")


Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
N = input()
S = list(map(int, N))
print("Yes" if N % sum(S) == 0 else "No")

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

Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
import sys
n = input()
N = int(n)
n = [int(i) for i in list(n)]
print("Yes" if sum(n) % N == 0 else "No")

import sys
n = input()
N = int(n)
n = [int(i) for i in list(n)]
print("Yes" if sum(n) % N == 0 else "No")

import sys
n = input()
N = int(n)
n = [int(i) for i in list(n)]
print("Yes" if N % sum(n) == 0 else "No")

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
N = input()

ans = 0
for i in N:
    ans += int(i)

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

N = input()

ans = 0
for i in N:
    ans += int(i)

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

Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n = int(input())
s = sum(int(i) for i in str(n))
if n % s == 0:
  print("YES")
else:
  print("NO")

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

Verdicts: Wrong Answer

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n = input())
total = 0
for i in range(len(n)):
  total+=int(n[i])
  if(total == 0):
    print("No")
if(int(n) % total == 0):
  print("Yes")
else:
  print("No")
      

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

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

n = input()
e = len(n)
totalList = []
for i in range(len(n)):
  totalList.append(n[i])
  
total = sum(totalList)
if(total == 0):
  print("Yes")
if(n % total == 0):
  print("Yes")
else:
  print("No")
  

  

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

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
N = input()
print("No" if N % sum(int(x) for x in N) else "Yes")

N = input()
print("No" if int(N) % sum(int(x) for x in N) else "Yes")


Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
def main():
    N = input()
    Sn = 0
    for n in N: Sn += int(n)
    print(Yes if int(N) % Sn == 0 else 'No')
    
if __name__ == '__main__':
    main()

def main():
    N = input()
    Sn = 0
    for n in N: Sn += int(n)
    print('Yes' if int(N) % Sn == 0 else 'No')
    
if __name__ == '__main__':
    main()

Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
N = input()
div = 0
for i in range(len(N)):
  div += int(N[i])
if int(N) % div == 0:
  print('YES')
else:
  print('No')

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


Verdicts: Wrong Answer

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
s = list(input())
n = 0

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

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

a = input()
s = list(a)
n = 0

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

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


Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
s = input()
n = int(s)
sum =0
mir = n
for i in range(len(s)):
  sum += s[i]
if n%sum ==0:
  print("Yes")
else:
  print("No")

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

Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n=int(input())
print("YNeos"[n%sum(map(int,list(str(n))))>0])

n=input();print("YNeos"[int(n)%sum(map(int,n))>0::2])

Verdicts: Wrong Answer

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n=input()
n1=int(n)
n=list(n)
k=0
for i in range(len(n)):
    k+=int(a[i])
if n1%k==0:print('Yes')
else:print('No')


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

Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
S=input()
num=0

for i in range(len(S)):
    num+=int(S[i])

if ((int)S%num)==0 :
    print("Yes")

else :
    print("No")

n = input()
tmp = 0

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


Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
N = input()
nums = list(N)
count = 0
for i in nums:
  count += i

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

N = input()
nums = list(N)
count = 0
for i in nums:
  count += int(i)

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


Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
s=input()
sum=0
for i in range(len(s)):
    sum+=int(s[i])
    
print(sum)





import sys
s=input()
sum=0
for i in range(len(s)):
    sum+=int(s[i])
   
if int(s)%sum==0:
    print("Yes")
    sys.exit(0)
else:
    print("No")


Verdicts: Wrong Answer

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n=input()
a=0
for i in n:
    a+=int(i)

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

n=input()
a=0
for i in n:
    a+=int(i)

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

Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n = input()
sn = sum([int(i) for i in list(n)])
if n % sn == 0 :
    print("Yes")
else :
    print("No")

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

Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n = int(input())
s_n = 0
for i in str(n):
    s_n += i
if n%s_n == 0:
    print("Yes")
else:
    print("No")

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

Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n = int(input())
sn=0
for i in range(len(n)):
  sn += n[i]
print("Yes" if n%sn==0 else "No")

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

Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
N = input()
a = int(N)
for i in range(len(N)):
  b += int(N[i])
print("Yes" if a%b==0 else "No")

N = input()
a = int(N)
b = 0
for i in range(len(N)):
  b += int(N[i])
print("Yes" if a%b==0 else "No")


Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
Num=int(input())
N=Num
n=0
while N>=10:
    n+=N%10
    N=N//10
n+=N
print(n)
if Num%n:print("No")
else:print("Yes")

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

Verdicts: Wrong Answer

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n = int(input())
li = list(n)
if sum(li)%n==0:
  print('Yes')
else:
  print('No')

n = input()
li = list(n)
li = [int(i) for i in li]

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

Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n = input()
digit = int(n)
total = sum(list(map(int, list(n))))
print("Yes" if total % digit == 0 else "No")


#!/usr/bin/env python3

import sys
# import math
# from string import ascii_lowercase, ascii_upper_case, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from operator import itemgetter              # itemgetter(1), itemgetter('key')

# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from copy import deepcopy                    # to copy multi-dimentional matrix without reference
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)


def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1               # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    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())
    
    
    n = input()
    s_n = 0
    for char in n:
        s_n += int(char)
    print('Yes') if int(n) % s_n == 0 else print('No')


if __name__ == "__main__":
    main()


Verdicts: Wrong Answer

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n=input()
s=0
n=str(n)
for i in n:
    s+=int(i)
if int(n)%s==0:
    print("YES")
else:
    print("NO")

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

Verdicts: Wrong Answer

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
N = input()
s = 0
for n in N:
  s += int(n)
res = int(N) % s
if res == 0:
  print("Yes")
else
  print("No")

N = input()
sum = 0
for n in N:
  sum += int(n)
res = int(N) % sum
if res == 0:
  print("yes")
else
  print("no")


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

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

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n = input()
s = list(n)
n = int(n)
sn = 0
for i in s:
    sn += int(i)
if sn % n == 0:
    print("Yes")
else:
    print("No")

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

Verdicts: Wrong Answer

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
N = input()
sn = sum([int(i) for i in str(N)])
if N % sn == 0:
    print('Yes')
else:
    print('No')


N = input()
sn = sum([int(i) for i in str(N)])
if int(N) % sn == 0:
    print('Yes')
else:
    print('No')


Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
import sys

def solve(n):
    a = 0
    for s in str(n):
        a += int(s)
    if n%a == 0:
        return("Yes")
    else:
        return("No")

def readQuestion():
    line = sys.stdin.readline().rstrip()
    [str_a] = line.split(' ')
    return (int(str_a)

def main():
    a = readQuestion()
    answer = solve(a)
    print(answer)
    
if __name__ == '__main__':
    main()

import sys

def solve(n):
    a = 0
    for s in str(n):
        a += int(s)
    if n%a == 0:
        return("Yes")
    else:
        return("No")

def readQuestion():
    line = sys.stdin.readline().rstrip()
    [str_a] = line.split(' ')
    return (int(str_a))

def main():
    a = readQuestion()
    answer = solve(a)
    print(answer)
    
if __name__ == '__main__':
    main()

Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
S=input()
Sn=0
for i in range(1, 10):
	if i > len(S):break
	Sn+=int(S[-i])
ans = "No"
if int(S) / Sn == 0:ans = "Yes"
print(ans)

S=input()
Sn=0
for i in range(1, 10):
	if i > len(S):break
	Sn += int(S[-i])
ans = "No"
if Sn == 0 or int(S) % Sn == 0:ans = "Yes"

print(ans)

Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n = int(input())
s = 0
for i in range(len(str(n))):
  s += list(str(n))[i]
if n % s == 0:
  print("Yes")
else:
  print("No")

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


Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
import sys
s = input()
_sum = 0
for x in s:
	_sum += int(x)
print ('Yes' if _sum % int(s) == 0 else 'No')

import sys
s = input()
_sum = 0
for x in s:
	_sum += int(x)
print ('Yes' if int(s) % _sum == 0 else 'No')

Verdicts: Wrong Answer

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
N2 = N
sum = 0
while True:
    sum += N % 10
    N = N // 10
    if N == 0:
        break
if N2 % sum == 0:
    print('Yes')
else:
    print('No')


N = int(input())
N2 = N
sum = 0
while True:
    print(N % 10)
    sum += N % 10
    N = N // 10
    if N == 0:
        break
if N2 % sum == 0:
    print('Yes')
else:
    print('No')


# coding: utf-8
# Your code here!
N = int(input())
N2 = N
sum = 0
while True:
    sum += N % 10
    N = N // 10
    if N == 0:
        break
if N2 % sum == 0:
    print('Yes')
else:
    print('No')


Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n=input()
s=0
for i in range(len(n)):
    s += n[i]
if int(n)%s == 0:
    print('Yes')
else:
    print('No')

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

Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
N = input()

n = int(N)
sn = sum(list(N))

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

N = input()

n = int(N)
sn = sum(list(N))

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

N = input()

n = int(N)
sn = sum(list(N))

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

N = input()

n = int(N)
sn = sum(list(map(int, list(N))))

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


Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
print("No"if(lambda s:int(s)/sum(list(map(int,list(s)))))(input())else"Yes")

print("No"if(lambda s:int(s)%sum(list(map(int,list(s)))))(input())else"Yes")

Verdicts: Wrong Answer

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
N = int(input())
ln = list(N)
print('Yes') if N%sum(ln) == 0 else print('No')


N = int(input())
ln = list(str(N))
sumln = 0
for val in ln:
    sumln += int(val)

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



Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n=list(input())
k=len(n)
s=0
t=0
for i in range(k):
    s+=int(n[i])
for l in range(k):
    t+=int(n[i])*10**(k-1-i)
if t%s==0:
    print('Yes')
else:
    print('No')

import math
n=list(input())
k=len(n)
s=0
t=0
for i in range(k):
    s+=int(n[i])
for l in range(k):
    t+=int(n[i])*10**(k-1-i)
if t%s==0:
    print('Yes')
else:
    print('No')

n=list(input())
k=len(n)
s=0
t=0
for i in range(k):
    s+=int(n[i])
for l in range(k):
    t+=int(n[i])*10**(k-1-i)
if t%s==0:
    print('Yes')
elif t%s==0:
    print('Yes')
else:
    print('No')

n=list(input())
k=len(n)
s=0
t=0
for i in range(k):
    s+=int(n[i])
for l in range(k):
    t+=int(n[l])*10**(k-1-l)
if t%s==0:
    print('Yes')

else:
    print('No')

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
#101 b
n = str(input())
N = int(N)
S = 0
for i in n:
    S += i
if N%S == 0:
    print('Yes')
else:
    print('No')

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

Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n = str(input())
sn = 0
for i in range(len(n)):
    sn += int(n[i])
if n % sn == 0:
    print("Yes")
else:
    print("No")

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

Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
N=input();print('YNeos'[int(N)%sum(map(int,n))!=0::2])


N=input();print('YNeos'[int(N)%sum(map(int,N))!=0::2])

Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n = input()
s = 0
for i in len(n):
    s += int(n[i])

print(["No","Yes"][n%s == 0])

n = input()
s = 0
for i in n:
    s += n[i]

print(["No","Yes"][n%s == 0])

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

print(["No","Yes"][int(n)%s == 0])

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

print(["No","Yes"][n%s == 0])

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

print(["No","Yes"][n%s == 0])

n = input()
s = 0
for i in n:
    s += n[i]

print(["No","Yes"][n%s == 0])

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


Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
import sys
input = sys.stdin.readline
N = int(input())
N_str = list(str(N))
a = 0
for i in N_str:
    cnt += int(i)
if N % a == 0:
    print("Yes")
else:
    print("No")

import sys
input = sys.stdin.readline
from collections import Counter
S = list(input().rstrip())
c = Counter(S)
print(c["+"] - c["-"])


import sys
input = sys.stdin.readline
N = int(input())
N_str = list(str(N))
a = 0
for i in N_str:
    a += int(i)
if N % a == 0:
    print("Yes")
else:
    print("No")

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
N = input("N:")
mapped_N  = map(int, list(N))
sum_s = sum(list(mapped_N))
if int(N) % sum_s == 0:
    print("Yes")
else:
    print("No")

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

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

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
print(*["YNeos"[(int(s)%sum(int(i))for i in s)>0::2]for s in[input()]])


print(*["YNeos"[(int(s)%sum(int(i)for i in s))>0::2]for s in[input()]])


Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
def main():
  n_str = input()
  n_int = int(n)
  n_sum = 0
  for i in range(len(n_str)):
    n_sum += int(n_str[i])
  if n_int % n_sum == 0:
    print("Yes")
  else:
    print("No")

N = int(input())
dsum = 0
tmp = N
while tmp > 0:
  dsum += tmp % 10
  tmp //=  10
if N % dsum != 0:
  print ("No")
else:
  print ("Yes")

Verdicts: Wrong Answer

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n=input()
print("No" if n%sum(map(int,n)) else "Yes")

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

Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n , k = map(int, input().split())
print(n//(k-1))

n = int(input())
l = list(str(n))
s = 0
for i in l:
    s += int(i)
if n>=s and n//s == 0:
    print('Yes')
else:
    print('No')

n = int(input())
l = list(str(n))
s = 0
for i in l:
    s += int(i)
if n//s == 0:
    print('Yes')
else:
    print('No')


n = int(input())
l = list(str(n))
s = 0
for i in l:
    s += int(i)
if n>=s and n%s == 0:
    print('Yes')
else:
    print('No')

Verdicts: Runtime Error

Wrong Answer

Wrong Answer

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

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

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


Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
N = int(input())
n = list(str(N))
print("Yes" if N%(sum(n)==0 else "No")

N = int(input())
NL = list(str(N))
n = [int(i) for i in NL]
print("Yes" if N%(sum(n))==0 else "No")

Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
N = input()
sum_digit = 0
for i in range(len(N)):
  sum_digit += int(N[i])
if N%sum_digit == 0:
  print('Yes')
else:
  print('No')


N = input()
sum_digit = 0
for i in range(len(N)):
  sum_digit += N[i]
if N%sum_digit == 0:
  print('Yes')
else:
  print('No')

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


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
N = input()
digits = list(map(int, list(N)))
sn = sum(digits)

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

N = input()
digits = list(map(int, list(N)))
sn = sum(digits)

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

Verdicts: Wrong Answer

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n = int(input())
sum = 0
tmp = n

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

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

n = int(input())

sum = 0
tmp = n

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

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

n = int(input())
sum = 0
tmp = n

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

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

n = int(input())

sum = 0
tmp = n

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

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

n = int(input())

sum = 0
tmp = n

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

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

def digitsum(n):
    ans = 0
    while n > 0:
        ans += n % 10
        n = n // 10
    return ans

N = int(input())
SumN = digitsum(N)
if N % SumN == 0:
    print("Yes")
else:
    print("No")


Verdicts: Runtime Error

Wrong Answer

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n = list(input())
s = sum([int(n[i]) for i in range(len(n))])
if n%s==0:
    print('Yes')
else:
    print('No')

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

Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n = str(input())
cnt = 0
for i in range(len(n)):
	cnt += n[i]
if int(n)%cnt == 0:
	print("Yes")
else:
	print("No")

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


Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
N = input()
SN = sum(map(int, list(N)))
print('Yes' if N%SN == 0 else 'No')

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

Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
N = int(input())
for every_number in range(N + 1):
    number_list = [int(i) for i in str(every_number)]
    print(number_list)
number_sum = sum(number_list)
print('Yes') if N % number_sum == 0 else print('No')


N = int(input())
number_sum = sum([int(i) for i in str(N)])
print('Yes') if N % number_sum == 0 else print('No')

Verdicts: Wrong Answer

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
n = input()
num = int(input())
len = len(n)
sn = 0

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

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

n = input()
num = int(n)
len = len(n)
sn = 0

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

if num % sn == 0:
    print("Yes")
else:
    print("No")


Verdicts: Runtime Error

Accepted
Problem: Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(101) = 1 + 0 + 1 = 2.  Given an integer N, determine if S(N) divides N.

Submission attempts (in order):
import sys
import string
input=sys.stdin.readline

n1=int(input())
n=n1
b=0
while n>0:
    a=n%10
    n=n//10
    b+=a
print(b)
if n1%b==0:
    print('Yes')
else:
    print('No')

import sys
import string
input=sys.stdin.readline

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

import sys
import string
input=sys.stdin.readline

n1=int(input())
n=n1
b=0
while n>0:
    a=n%10
    n=n//10
    b+=a
#print(b)
if n1%b==0:
    print('Yes')
else:
    print('No')

Verdicts: Wrong Answer

Runtime Error

Accepted