TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: Takahashi loves takoyaki - a ball-shaped snack.  With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make.  How long does it take to make N takoyaki?

Submission attempts (in order):
import math

N, X, T = map(int,input().split())

count = math.ceil(N/X);

ans = count*T

import math

N, X, T = map(int,input().split())

count = math.ceil(N/X);

ans = count*T

print(ans)


Verdicts: Wrong Answer

Accepted
Problem: Takahashi loves takoyaki - a ball-shaped snack.  With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make.  How long does it take to make N takoyaki?

Submission attempts (in order):
a,b,c=map(int, input('N,X,T=').split())

if a%b==0:
    Q=a//b
    
else:
    Q=a//b+1
    
print(Q*c)



a,b,c=map(int, input('N,X,T=').split())

if a%b==0:
    Q=a//b
    
else:
    Q=a//b+1
    
print(Q*c)



a,b,c=map(int, input().split())

if a%b==0:
    Q=a//b
    
else:
    Q=a//b+1
    
print(Q*c)



Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Takahashi loves takoyaki - a ball-shaped snack.  With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make.  How long does it take to make N takoyaki?

Submission attempts (in order):
H, W, M = map(int, input().split())
B = []
c={}
d={}

for i in range(M):
    b = list(map(int, input().split()))
    if b[0] not in c.keys():
        c[b[0]] =1
    else:
        c[b[0]] +=1
        
    if b[1] not in d.keys():
        d[b[1]] =1
    else:
        d[b[1]] +=1
    B.append(b)


c_max =max(c.values())
cc = [kv[0] for kv in c.items() if kv[1] == c_max]
d_max= max(d.values())
dd = [kv[0] for kv in d.items() if kv[1] == d_max]
#print(c_max,d_max)
#print(cc,c_max,dd,d_max)
if c_max == H and d_max== W:
    print((c_max+d_max)-1)
else:    
    for i in range (len(cc)):
        for n in range(len(dd)):
            #print(i, n, cc[i], dd[n])
            if [cc[i], dd[n]] not in B:
                print(c_max+d_max)
                break
        
            if i == len(cc)-1 and n == len(dd)-1:
                print((c_max+d_max)-1)

n, x, t = map(int, input().split())

if n % x !=0:
    a = ((n // x)+1) * t 
else:
    a=(n//x)*t
print(a)

Verdicts: Runtime Error

Accepted
Problem: Takahashi loves takoyaki - a ball-shaped snack.  With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make.  How long does it take to make N takoyaki?

Submission attempts (in order):
a,b,c=list(map(int,input().split()))
d=a//b
print(int(d*c))

a,b,c=list(map(int,input().split()))

print(int((a//b)*c))

a,b,c=list(map(int,input().split()))

if a%b== 0:
  d=a//b
else:
  d=a//b+1

print(int(d*c))

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Takahashi loves takoyaki - a ball-shaped snack.  With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make.  How long does it take to make N takoyaki?

Submission attempts (in order):
A, B, C = map(int, input().split())

Z = N/X-N%X
time = Z*T

print(time)

var N = 20;
var X = 12;
var T = 6;
var Z = N/X-N%T;
var time = Z*T;
print(time);

A, B, C = map(int, input().split())

Z = A/B-A%B
time = Z*C

print(time)

A, B, C = map(int, input().split())

Z = A//B
time = Z*C

print(time)

var Takoyaki = [N,X,T]
N = 20 
X = 12
T = 6
N / X -- N % X = Z
Z*T = time
print(time)

A, B, C = map(int, input().split())

if A%B == 0:
	Z = A//B
else :
    Z = A//B + 1
time = Z*C

print(time)

Verdicts: Runtime Error

Runtime Error

Wrong Answer

Wrong Answer

Runtime Error

Accepted
Problem: Takahashi loves takoyaki - a ball-shaped snack.  With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make.  How long does it take to make N takoyaki?

Submission attempts (in order):
N,X,T=map(float,input().split())
import math 
A=N/X 
A= math.ceil(A)
print(A*T)

N,X,T=map(float,input().split())
import math 
A=N/X 
A= math.ceil(A)
B=A*T
print(int(B))

Verdicts: Wrong Answer

Accepted
Problem: Takahashi loves takoyaki - a ball-shaped snack.  With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make.  How long does it take to make N takoyaki?

Submission attempts (in order):
N, X, T = map(int,inout().split())
takoyakitime=math.ceil(N/T/X)
print(takoyakitime)

N, X, T = map(int,input().split())
takoyakitime=math.ceil(N/T/X)
print(takoyakitime)

import math
n,x,t = map(int,input().split())
point = math.ceil(n/x)
print(point*t)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Takahashi loves takoyaki - a ball-shaped snack.  With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make.  How long does it take to make N takoyaki?

Submission attempts (in order):
import math

N, X, T = input().split(' ')
print(math.ceil(N/X) * T)

import math

N, X, T = input().split(' ')
print(math.ceil(int(N)/int(X)) * int(T))

Verdicts: Runtime Error

Accepted
Problem: Takahashi loves takoyaki - a ball-shaped snack.  With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make.  How long does it take to make N takoyaki?

Submission attempts (in order):
import numpy

n = input()
x = input()
t = input()

print((n//x+1)*t)

import math

N, x, T = map(int, input().split)

print(math.ceil(N / x) * T)

import math

N,x,t = map(int,input().split)

print(math.ceil(N / x)*T)

import math

N = int(input())
x = int(input())
T = int(input())

print(str(T * math.ceil(N / x)))

N = int(intput())
x = int(input())
T = int(input())

print(str(T*floor(N/x)))



n = input()
x = input()
t = input()

print((n//x+1)*t)

import math

N, x, T = map(int, input().split())

print(math.ceil(N / x) * T)

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: Takahashi loves takoyaki - a ball-shaped snack.  With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make.  How long does it take to make N takoyaki?

Submission attempts (in order):
N = int(input())
L = list(map(int, input().split()))
if N == 1:
  print(0)
else:
  x = 0
  for i in range(0,len(L)-1):
    if L[i] > L[i + 1]:
      x = x + (L[i] - L[i + 1])
      L[i + 1] = L[i + 1] + (L[i] - L[i + 1])
  print(x)
    



import sys
input = sys.stdin.readline
N = int(input())
L = list(map(int, input().split()))
if N == 1:
  print(0)
else:
  x = 0
  for i in range(0,len(L)-1):
    if L[i] > L[i + 1]:
      x = x + (L[i] - L[i + 1])
      L[i + 1] = L[i + 1] + (L[i] - L[i + 1])
  print(x)
    



N, X, T = map(int, input().split())
if N % X > 0:
  a = (N // X + 1) * T
else:
  a = (N // X) * T

print(a)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Takahashi loves takoyaki - a ball-shaped snack.  With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make.  How long does it take to make N takoyaki?

Submission attempts (in order):
N, X, T = map(int, input().split())
import math
number_of_times = math.ceil(N/X)
total_time = T * number_of_times
print(number_of_times)


N, X, T = map(int, input())
import math
number_of_times = math.ceil(N/X)
total_time = T * number_of_times
print(number_of_times)


N, X, T = map(int, input().split())
import math
number_of_times = math.ceil(N/X)
total_time = T * number_of_times
print(total_time)


Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: Takahashi loves takoyaki - a ball-shaped snack.  With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make.  How long does it take to make N takoyaki?

Submission attempts (in order):
N,X,T=map(int, raw_input().split())
mod=int((N/X))*T
if N%X!=0:
  print(mod)
else:
  print(mod+T)

n,x,t= map(int, input().split())
if n%x==0:
  print( int((n/x))*t )
else:
  print(int((n/x + 1))*(t))

Verdicts: Runtime Error

Accepted
Problem: Takahashi loves takoyaki - a ball-shaped snack.  With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make.  How long does it take to make N takoyaki?

Submission attempts (in order):
N,X,T = map(int, input().split())
print(int(N*T/X))

N,X,T = map(int, input().split())
ans = 0
while(N>0):
  N-=X
  ans +=T 
print(ans)

Verdicts: Wrong Answer

Accepted
Problem: Takahashi loves takoyaki - a ball-shaped snack.  With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make.  How long does it take to make N takoyaki?

Submission attempts (in order):
N, X, T = map(int,input().split())
C=1
  if N%X!=0:
     C=N//X+1
  else:
    C=N//X

print(C*T)
    
   

N, X, T = map(int,input().split())

print(N/X*T)

N, X, T = map(int,input().split())
C=1
if N%X!=0:
     C=N//X+1
else:
    C=N//X
 
print(C*T)

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: Takahashi loves takoyaki - a ball-shaped snack.  With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make.  How long does it take to make N takoyaki?

Submission attempts (in order):
N, X,T= map(int, input().split())
result=(N*T)/X
print(int(result))

N, X,T= map(int, input().split())
sum=0
while(N>0):
    N-=X
    sum+=1
print(T*sum)

Verdicts: Wrong Answer

Accepted
Problem: Takahashi loves takoyaki - a ball-shaped snack.  With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make.  How long does it take to make N takoyaki?

Submission attempts (in order):
N, X, T = int( input().split() )
if int(N) % int(X) != 0 :
	print( ( int(N) // int(X) + 1) * int(T) )
if int(N) % int(X) == 0 :
	print( (int(N) // int(X) ) * int(T) )


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

if result % 9 == 0 :
    print('Yes')
else :
    print('No')


N, X, T = map(int, input().split())
if int(N) % int(X) != 0 :
	print( ( int(N) // int(X) + 1) * int(T) )
if int(N) % int(X) == 0 :
	print( (int(N) / int(X) * int(T) )


N, X, T = map(int, input().split())
if int(N) % int(X) != 0 :
	print( ( int(N) // int(X) + 1) * int(T) )
if int(N) % int(X) == 0 :
	print( (int(N) // int(X) ) * int(T) )


Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: Takahashi loves takoyaki - a ball-shaped snack.  With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make.  How long does it take to make N takoyaki?

Submission attempts (in order):
n,x,t=map(int,input().split())
print((n+x-1)//(x*t))

N, X, T = map(int, input().split())

print((N + X - 1) // X * T)

Verdicts: Wrong Answer

Accepted
Problem: Takahashi loves takoyaki - a ball-shaped snack.  With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make.  How long does it take to make N takoyaki?

Submission attempts (in order):
n,x,t=map(int,input().split())
y=ceil(n/x)
print(y*t)


from math import ceil
n,x,t=map(int,input().split())
y=ceil(n/x)
print(y*t)

Verdicts: Runtime Error

Accepted
Problem: Takahashi loves takoyaki - a ball-shaped snack.  With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make.  How long does it take to make N takoyaki?

Submission attempts (in order):
n, x, t = map(int, input())
ans = n//x 
if n%x != 0:
  ans += 1
print(int(ans)*t)

n, x, t = map(int, input().split())
ans = n//x 
if n%x != 0:
  ans += 1
print(int(ans)*t)


Verdicts: Runtime Error

Accepted
Problem: Takahashi loves takoyaki - a ball-shaped snack.  With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make.  How long does it take to make N takoyaki?

Submission attempts (in order):
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
import sys
import os
f = open('/Users/yuigawada/Desktop/競プロ/Atcoder/input.txt', 'r')
sys.stdin = f


import itertools
import numpy as np
import fractions
from itertools import combinations
from functools import reduce
from functools import lru_cache
import math
from collections import deque
import decimal
import bisect
import heapq
# ---*- start -*--- #
import math
import sys
sys.setrecursionlimit(10**9)



def mi(): return map(int,input().split())
def ii(): return int(input())
def isp(): return input().split()
def deb(text): print("-------\n{}\n-------".format(text))

INF=10**20
def solve(N,X,T):
    print(T*math.ceil(N/X))
    return

def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    X = int(next(tokens))  # type: int
    T = int(next(tokens))  # type: int
    solve(N, X, T)



if __name__ == "__main__":
    main()


#! /usr/bin/env python3
# -*- coding: utf-8 -*-
import itertools
import numpy as np
import fractions
from itertools import combinations
from functools import reduce
from functools import lru_cache
import math
from collections import deque
import decimal
import bisect
import heapq
# ---*- start -*--- #
import math
import sys
sys.setrecursionlimit(10**9)



def mi(): return map(int,input().split())
def ii(): return int(input())
def isp(): return input().split()
def deb(text): print("-------\n{}\n-------".format(text))

INF=10**20
def solve(N,X,T):
    print(T*math.ceil(N/X))
    return

def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    X = int(next(tokens))  # type: int
    T = int(next(tokens))  # type: int
    solve(N, X, T)



if __name__ == "__main__":
    main()


Verdicts: Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
a=list(input())
cnt=0
for i in a:
  b=int(i)
  cnt=(cnt+b)//9
if cnt==0:
  print("Yes")
else:
  print("No")

a=list(input())
cnt=0
for i in a:
  b=int(i)
  cnt=(cnt+b)%9
if cnt==0:
  print("Yes")
else:
  print("No")

Verdicts: Wrong Answer

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

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

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

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

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

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

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


Verdicts: Wrong Answer

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

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

S=input()
L=len(S)

goukei=0
for i in range(L):
    goukei+=int(S[i])

if goukei%9==0:
    print("Yes")
else:
    print("No")

S=input()
L=len(S)

goukei=0
for i in range(L):
    goukei+=int(S[i])

if goukei%9==0:
    print("Yes")
else:
    print("No")

Verdicts: Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

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

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

N=int(input())

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

Verdicts: Wrong Answer

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
x = input()
alist = list(map(int,x))
result = sum(alist)
if result%9 == 0 :
    print("yes")
else:
    print("no")

x = input()
for i in range(5):

    alist = list(map(int,x))
    result = sum(alist)
    x = str(result)

if result % 9 == 0 :
    print("yes")
else:
    print("no")

big = str(input())
num = 0
for x in range(len(big)):
    num += int(big[x])
if num % 9 == 0:
    print("Yes")
else:
    print("No")


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
N = input()
if N % 9 == 0:
    print("Yes")
else :
    print("No")

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

Verdicts: Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
inputs = int(input())

if (inputs // 9) == 0:
    print("Yes")
else:
    print("No")

inputs = int(input())

if (inputs % 9) == 0:
    print("Yes")
else:
    print("No")

Verdicts: Wrong Answer

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
N =int(input())
lst = []

N = str(N)

list_num = list(N)

N = [int(s) for s in list_num]
ans = sum(N)

if ans % 9 == 0:
  print("yes")
else:
        print("No")


N =int(input())
lst = []
while N > 0:
    lst.append(N%10)
    N //= 10 
lst.reverse()

ans = sum(lst)

if ans % 9 == 0:
  print("yes")
else:
        print("No")

N =int(input())
lst = []

N = str(N)

list_num = list(N)

N = [int(s) for s in list_num]
ans = sum(N)

if ans % 9 == 0:
  print("yes")
else:
  print("No")

N =int(input())
lst = []

N = str(N)

list_num = list(N)

N = [int(s) for s in list_num]
ans = sum(N)

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

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
import sys
li  =   lambda : [int(x) for x in sys.stdin.readline().strip().split()]
rw  =   lambda : sys.stdin.readline().strip().split()
ni  =   lambda : int(sys.stdin.readline().strip())
nsi =   lambda : sys.stdin.readline().strip()

from collections import defaultdict as df
import math
s=input()
sum=0
for i in s:
    sum+=int(i)

if(sum%9==0):
    print("YES")
else:
    print("NO")


import sys
li  =   lambda : [int(x) for x in sys.stdin.readline().strip().split()]
rw  =   lambda : sys.stdin.readline().strip().split()
ni  =   lambda : int(sys.stdin.readline().strip())
nsi =   lambda : sys.stdin.readline().strip()

from collections import defaultdict as df
import math
n=ni()
if(n==0):
    sum=0
elif(n%9==0):
    sum=9
else:
    sum=n%9

if(sum%9==0):
    print("YES")
else:
    print("NO")


import sys
li  =   lambda : [int(x) for x in sys.stdin.readline().strip().split()]
rw  =   lambda : sys.stdin.readline().strip().split()
ni  =   lambda : int(sys.stdin.readline().strip())
nsi =   lambda : sys.stdin.readline().strip()

from collections import defaultdict as df
import math
s=input()
sum=0
for i in s:
    sum+=int(i)

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


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
def inp():
    return input()
def iinp():
    return int(input())
def inps():
    return input().split()
def miinps():
    return map(int,input().split())
def linps():
    return list(input().split())
def lmiinps():
    return list(map(int,input().split()))
def lmiinpsf(n):
    return [list(map(int,input().split()))for _ in range(n)]

n = inp()
m = int(n)

for i in range(len(n)):
    ans += (m % 10)
    m //= 10

ans %= 9

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

def inp():
    return input()
def iinp():
    return int(input())
def inps():
    return input().split()
def miinps():
    return map(int,input().split())
def linps():
    return list(input().split())
def lmiinps():
    return list(map(int,input().split()))
def lmiinpsf(n):
    return [list(map(int,input().split()))for _ in range(n)]

n = inp()
m = int(n)

ans = 0

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

ans %= 9

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

Verdicts: Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
print("Yes" if int(input())%9==o else "No")

n=sum([int(c) for c in input()])
print("Yes" if n%9==0 else "No")

Verdicts: Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

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


n=int(input())  
l=[] 
for i in range(len(str(n))): 
  l.append(int(n[i])) 
if((sum(l)%9)==0): 
  print("Yes") 
else: 
  print("No") 
  

n=input() 
l=[] 
for i in range(len(str(n))): 
  l.append(int(n[i])) 
if((sum(l)%9)==0): 
  print("Yes") 
else: 
  print("No") 
  


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
def fun(x):
  sum=0
  while(x):
    sum=sum+ x%10
    x=x/10
  return sum
n=int(input())
x=n;
while(x>=10):
  x=fun(x)
  
if x%9==0:
  print("Yes")
else:
  print("No")
  


x=int(input())
  
if x%9==0:
  print("Yes")
else:
  print("No")
  


Verdicts: Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

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

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


Verdicts: Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
n=int(input())
s=0
c=0
while n>0:
  r=n%10
  s=s+r
  n=n//10
  if s%9==0:
    continue
  else:
    c=1
    print('No')
    break
if not c:
  print('Yes')


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


Verdicts: Wrong Answer

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
#N = int(input()).split()
n = 12141.split()
print(n[0])

N = int(input())
n = str(N)
a = list(n)

count = 0

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

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

Verdicts: Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

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

sum = 0
for i in range(len(digits)):
    sum += int(digits[i])

if(sum%9 == 0):
    print("YES")
else:
    print("NO")

N = input()
digits = list(N)

sum = 0
for i in range(len(digits)):
    sum += int(digits[i])

if(sum !=0 and sum%9 == 0):
    print("YES")
else:
    print("NO")

N = input()
digits = list(N)

sum = 0
for i in range(len(digits)):
    sum += int(digits[i])

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

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

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

if N%9==0:
  print('YES')
else:
  print('NO')

N=int(input())

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

Verdicts: Wrong Answer

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
import sys
input = sys.stdin.readline
I = lambda : list(map(int,input().split()))

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


import sys
input = sys.stdin.readline
I = lambda : list(map(int,input().split()))

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

Verdicts: Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
a = float(input())
print("Yes" if (a / 9).is_integer() else "No")
print(a/9)

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

Verdicts: Wrong Answer

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

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

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

Verdicts: Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
N= int(input())
if N%9 =0:
    print("Yes")
else:
    print("No")

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

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

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
n = int(input())
if(n%9==0):
    print("YES")
else:
    print("NO")

n = float(input())
if(n%9==0):
    print("YES")
else:
    print("NO")

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

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
user_input=input("N: ")
i=len(user_input)-1
j=int(user_input)
if j>=10**(200000):
    print("its out of the limit")
else:
    number=0
    while i>=0:
        number+=int(user_input[i])
        i=i-1
if number%9==0:
    print("Yes")
else :
    print("no")


def solve(s):
  suma = 0
  for x in s:
    suma += int(x)
  if suma % 9 == 0:
    return True
  return False

s = input()
x = solve(s)
if x == True: print("YES")
else: print("NO")

user_input=input("N: ")
i=len(user_input)-1
j=int(user_input)
if j>=10**(200000):
    print("its out of the limit")
else:
    number=0
    while i>=0:
        number+=int(user_input[i])
        i=i-1
if number%9==0:
    print("Yes")
else :
    print("No")


x= input()
reslut = sum(list(map(int,x)))
if reslut%9 == 0 :
    print("Yes")
else:
    print('No')

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
n=input()
print('Yes' if n%9==0 else 'No')

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

Verdicts: Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
x = inoput()
le = len(x)
sum = 0
for i in range(le):
  sum+=int(x[i])
print(sum)

num = input()
le = len(num)
sum=0
for i in range(le):
  sum += int(num[i])
if sum%9==0:
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
N=int(input())
if N%9 == 0:
  print(Yes)
else:
  print(No)

int(input())
N = input()
if(N%9=0)
print(Yes)
if(N%9=!0)
print(No)

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


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
number = list(map(int,list(input())))
if sum(number)%9==0:
    print("YES")
else:
    print("NO")

number = list(map(int,list(input())))
if sum(number)%9==0:
    print("YES")
else:
    print("NO")

number = list(map(int,list(input())))
if sum(number)%9==0:
    print("Yes")
else:
    print("No")

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
n = input()
if(n % 9 == 0): print("Yes")
else : print("No")


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


Verdicts: Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
N=int(input())
n=str(N)
listst=list(n)
lists=[int(str) for str in listst]
print(lists)
A=sum(lists)
if A%9==0:
    print('Yes')
else:
    print('No')

N=int(input())
n=str(N)
listst=list(n)
lists=[int(str) for str in listst]
#print(lists)
A=sum(lists)
if A%9==0:
    print('Yes')
else:
    print('No')

Verdicts: Wrong Answer

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
s = input()
ans = 0
for x in s:
  ans += int(x)
if x%9 == 0:
  print("Yes")
else:
  print("No")

s = input()
ans = 0
for x in s:
	ans += int(x)

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

Verdicts: Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

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


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

N=int(input())


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

Verdicts: Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
def digit_sum(n):
    n_lst = list( str(n) )
    n_sum = 0
    for i in range( len(n_lst) ):
        n_sum += int( n_lst[i] )
    return n_sum
 
n1 = input()
if digit_sum(n1)%9==0 : print("Yes")
else: print("No"

def digit_sum(n):
    n_lst = list( str(n) )
    n_sum = 0
    for i in range( len(n_lst) ):
        n_sum += int( n_lst[i] )
    return n_sum
 
n1 = input()
if digit_sum(n1)%9==0 : print("Yes")
else: print("No")

Verdicts: Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
N = input()
array = list(map(int, N))
S = sum(array)

if S%9 == 0:
  print('YES')
else:
  print('NO')

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

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

Verdicts: Wrong Answer

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

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

length = len(line)
sum = 0
for i in range(length):
    sum += int(line[i])

if sum % 9 == 0:
    print("yes")
else:
    print("no")

line = input()
 
length = len(line)
sum = 0
for i in range(length):
    sum += int(line[i])
 
if sum % 9 == 0:
    print("Yes")
else:
    print("No")

Verdicts: Wrong Answer

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
# Python profram to check if n is a multiple of 3 
  
# Function to check if n is a multiple of 3 
def isMultipleOf3(n): 
  
    odd_count = 0
    even_count = 0
  
    # Make no positive if + n is multiple of 3 
    # then is -n. We are doing this to avoid 
    # stack overflow in recursion 
    if(n < 0):  
        n = -n 
    if(n == 0): 
        return 1
    if(n == 1):  
        return 0
  
    while(n): 
          
        # If odd bit is set then 
        
        if(n & 1):  
            odd_count += 1
  
        # If even bit is set then 
        
        if(n & 2): 
            even_count += 1
        n = n >> 2
  
    return isMultipleOf3(abs(odd_count - even_count))
num=int(input())
if (isMultipleOf3(num)):  
    print("YES") 
else: 
    print("NO") 

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

Verdicts: Wrong Answer

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
target = input()
sum = 0
for each in all:
  sum += int(each)
if sum % 9 == 0:
  print("Yes")
else:
  print("No")

if int(input()) % 9 == 0:
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
'''

                            Online Python Compiler.
                Code, Compile, Run and Debug python program online.
Write your code in this editor and press "Run" button to execute it.

'''

ip=list(input())
sum=0
for i in ip:
    sum+=int(i)
if sum%9==0:
    print('YES')
else:
    print('NO')

'''

                            Online Python Compiler.
                Code, Compile, Run and Debug python program online.
Write your code in this editor and press "Run" button to execute it.

'''

ip=list(input())
sum=0
for i in ip:
    sum+=int(i)
if sum%9==0:
    print('Yes')
else:
    print('No')

Verdicts: Wrong Answer

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
N = int(input())
N_letter = str(N)

SUM_N = sum(N_letter)
if (SUM_N/9) ==  int(SUM_N/9):
	print("Yes")
else:
	print("No")

N = int(input())
N_letter = str(N)

SUM_N = sum(N_letter)
if int(SUM_N/9) =  isinstance(i, int):
	print("Yes")
elseif:
	print("No")

N = int(input())

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

if (S/9) ==  int(S/9):
	print("Yes")
else:
	print("No")

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
#!/usr/bin/env python3

import sys
input=sys.stdin.readline

s=input()
ans=0
for c in s:
    ans+=int(c)
    ans%=9
if ans==0:
    print('Yes')
else:
    print('No')

s=input()
ans=0
for c in s:
    ans+=int(c)
    ans%=9
if ans==0:
    print('Yes')
else:
    print('No')

Verdicts: Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
n = int(input())
sum = 0
for i in range(len(str(n))):
    sum += (n % 10)
    n //= 10
    
print(sum)

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

Verdicts: Wrong Answer

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

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

if N//9 == 0:
  ans = 'Yes'
else:
  ans = 'No'

print(ans)

N = int(input())

if N%9 == 0:
  ans = 'Yes'
else:
  ans = 'No'

print(ans)

Verdicts: Wrong Answer

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

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

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

Verdicts: Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
# t=int(input())
# for _ in range(t):
#     n=int(input())
#     arr=[int(x) for x in input().split()]
n=int(input())
if n%9 == 0:
    print("YES")
else:
    print("NO")
#print(t*need)

# t=int(input())
# for _ in range(t):
#     n=int(input())
#     arr=[int(x) for x in input().split()]
def sumall(n):
    sum=0
    while n:
        sum+=n%10
        n=n//10
    return sum
n=int(input())
if sumall(n)%9 == 0:
    print("YES")
else:
    print("NO")
#print(t*need)

# t=int(input())
# for _ in range(t):
#     n=int(input())
#     arr=[int(x) for x in input().split()]
n=int(input())
if n%9 == 0:
    print("Yes")
else:
    print("No")

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

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

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

Verdicts: Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
S=input()
sum = 0
for n in S:
  sum += int(n)
if sum % 9 == 0:
  print("YES")
else:
  print("NO")

S = input()
sum = 0
for n in S:
  sum += int(n)
if sum % 9 == 0:
  print('Yes')
else:
  print('No')

Verdicts: Wrong Answer

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

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

sum = 0

while N > 1 :
    sum += N % 10
    N = N // 10

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


N = int(input())

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


Verdicts: Wrong Answer

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

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

a==int(n%9)

if a==0:
   print(Yes)
else:
  print(No)
  

n==int(input())

a==int(n%9)

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


n=int(input())

a=int(n%9)

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


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
N = int(input())
sum = 0 
while(N != 0):
    sum += (N%10)
    N /= 10
if sum % 9 == 0:
    print('Yes')
else: print('No')

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

N = int(input())
sumN = sum(int(digit) for digit in str(N))
if sumN%9 == 0:
    print("Yes")
else:
    print("No")

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
def digitSum(n):
    
    s = str(n)
    
    array = list(map(int, s))
    
    return sum(array)

if N ==0:
  print('Yes')
elif digitSum(N)%9 ==0:
  print('Yes')
else:
  print('No')

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

Verdicts: Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
if __name__=='__main__':
    for i in range(int(input())):
        N = int(input())
        #pc, pr = map(int, input().split())
        #N = list(map(int,input().split()))
        print("Yes" if N%9 ==0 else "No")

if __name__=='__main__':
    N = int(input())
        #pc, pr = map(int, input().split())
        #N = list(map(int,input().split()))
	print("Yes" if N%9 ==0 else "No")

if __name__=='__main__':
    N = int(input())
    print("Yes" if N%9 ==0 else "No")
	

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
n = str(input())
wa = 0

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

if wa % 9 == 0:
	print('Yes')
else:
	print('No')

n = str(input())
wa = 0

for i in n:
	n[i] = int(n[i])
	wa += n[i]

if wa % 9 == 0:
	print('Yes')
else:
	print('No')

n = str(input())
wa = 0

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

if wa % 9 == 0:
	print('Yes')
else:
	print('No')

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
n = int(input())
sum = 0
while (n != 0): 
  
    sum = sum + int(n % 10) 
    n = int(n/10) 

    
if (sum%9) == 0:
    print("YES")
else:
    print("NO")

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

Verdicts: Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
li = list(input())

sum_ = 0
for val in li:
  sum_ += int(val)
if sum_%9 == 0:
  print('YES')
else:
  print('NO')

li = list(input())

sum_ = 0
for val in li:
  sum_ += int(val)
if sum_%9 == 0:
  print('Yes')
else:
  print('No')


Verdicts: Wrong Answer

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
n=int(input())
print('No' if n % 6 else 'Yes')


n=int(input())
print('No' if n % 3 else 'Yes')


Verdicts: Wrong Answer

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
print(int(input()) % 9 == 0)

n = input()
sum = 0
for i in n:
    sum += int(i)
print(sum % 9 == 0)

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

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
n=[int(i) for i in input().split()]

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

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



Verdicts: Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
N = input()
len_N = len(N)
N = int(N)
count = 0

for i in range(len_N):
  count += N[i]
if count%9 == 0:
  print("Yes")
else:
  print("No")

N = input()
len_N = len(N)
count = 0

for i in range(len_N):
  count += int(N[i])
if count%9 == 0:
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
num = input()
if num % 9 == 0:
  print("yes")
else:
  print("no")

from sys import stdin, stdout
t = int(stdin.readline())
if t % 9 == 0:
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

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

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

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

Verdicts: Runtime Error

Accepted
Problem: An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.  Determine whether N is a multiple of 9.

Submission attempts (in order):
N =input()
if N%9==0:
    print('Yes')
else :
    print('No')

N =int(input())
if N%9 == 0:
  print('Yes')
else;
  print('No')

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

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted