ShaysXIA/CodeInsightBench huggingface dataset:
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 171 ms):
def solve(num):
    curr_sum = sum([int(h) for h in " ".join(num).split()])
    twos = num.count("2")
    threes = num.count("3")
    for i in range(min(10, twos + 1)):
        for j in range(min(10, threes + 1)):
            if (curr_sum + i * 2 + j * 6) % 9 == 0:
                return "YES"
    return "NO"

T = int(input())
for _ in range(T):
    num = input()
    print(solve(num))
    

Solution 2 (runtime: 186 ms):
def sol() -> bool:
    s = str(input())

    numTwos = 0
    numThrees = 0
    sum = 0

    for c in s:
        x = int(c)
        # print(x)
        if x == 2:
            numTwos += 1
        if x == 3:
            numThrees += 1
        sum += x
    
    m = min(8, numTwos)
    n = min(3, numThrees)

    for j in range(m+1):
        for k in range(n+1):
            # print(sum + j * 2 + k * 6)
            if (sum + j * 2 + k * 6) % 9 == 0:
                return True
    
    return False

t = int(input())

for i in range(t):
    print("YES") if sol() else print("NO")
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 171 ms):
def solve(num):
    curr_sum = sum([int(h) for h in " ".join(num).split()])
    twos = num.count("2")
    threes = num.count("3")
    for i in range(min(10, twos + 1)):
        for j in range(min(10, threes + 1)):
            if (curr_sum + i * 2 + j * 6) % 9 == 0:
                return "YES"
    return "NO"

T = int(input())
for _ in range(T):
    num = input()
    print(solve(num))
    

Solution 2 (runtime: 156 ms):
import sys

input = sys.stdin.readline





for _ in range(int(input())):

    s = input()[:-1]

    a, b = 0, 0

    c = 0

    for i in s:

        if i == '2':

            a += 1

        elif i == '3':

            b += 1

        c += int(i)

    c %= 9

    ew = 0

    for i in range(min(10, b+1)):

        for j in range(min(10, a+1)):

            if (c + 6*i + 2*j) % 9 == 0:

                ew = 1

                break

        if ew:

            break

    print(['NO','YES'][ew])
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 171 ms):
def solve(num):
    curr_sum = sum([int(h) for h in " ".join(num).split()])
    twos = num.count("2")
    threes = num.count("3")
    for i in range(min(10, twos + 1)):
        for j in range(min(10, threes + 1)):
            if (curr_sum + i * 2 + j * 6) % 9 == 0:
                return "YES"
    return "NO"

T = int(input())
for _ in range(T):
    num = input()
    print(solve(num))
    

Solution 2 (runtime: 186 ms):
import sys, math

from functools import cmp_to_key

from operator import itemgetter

from bisect import bisect_left, bisect_right

from collections import Counter, defaultdict, deque



input = sys.stdin.readline



def iinp(): return (int(input()))

def linp(): return (list(map(int, input().split())))

def sinp(): return (input().strip())

def minp(): return (map(int, input().split()))

def debug(*args):

    print("DEBUG:", *args, file=sys.stderr)





def solve():

	# n = iinp()

	s = sinp()

	Sum = sum([int(num) for num in s])

	count_2 = s.count('2')

	count_3 = s.count('3')

	if Sum%9==0:

		print("YES")

		return

	target = (9 - Sum%9)%9 

	for i in range(count_3+1):

		new_target = (target - 6*i)%9

		if new_target<0:

			new_target +=9

		requied = (5*new_target)%9

		if requied<=count_2:

			print("YES")

			return

		

	print('NO')

		



def main():

	t = 1

	t = int(input())

	for i in range(t):

		solve()

	

if __name__ == "__main__":

	main()
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 171 ms):
def solve(num):
    curr_sum = sum([int(h) for h in " ".join(num).split()])
    twos = num.count("2")
    threes = num.count("3")
    for i in range(min(10, twos + 1)):
        for j in range(min(10, threes + 1)):
            if (curr_sum + i * 2 + j * 6) % 9 == 0:
                return "YES"
    return "NO"

T = int(input())
for _ in range(T):
    num = input()
    print(solve(num))
    

Solution 2 (runtime: 93 ms):
import sys



def is_interesting(n):

    S = 0

    count_2 = 0

    count_3 = 0



    # Compute sum of digits and count of 2s and 3s

    for digit in n:

        d = int(digit)

        S += d

        if d == 2:

            count_2 += 1

        elif d == 3:

            count_3 += 1



    # Compute R = (9 - S % 9) % 9

    R = (9 - (S % 9)) % 9

    for i in range(count_3+1):

        new_R = (R - 6*i)%9

        if new_R<0:

            new_R +=9

        mmi = (new_R*5)%9

        if mmi <= count_2:

            return 'YES'

    return 'NO'



# Fast input handling

input = sys.stdin.read

data = input().split()

t = int(data[0])

results = []



for i in range(1, t + 1):

    n = data[i]

    results.append(is_interesting(n))



# Output results efficiently

sys.stdout.write("\n".join(results) + "\n")
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 171 ms):
def solve(num):
    curr_sum = sum([int(h) for h in " ".join(num).split()])
    twos = num.count("2")
    threes = num.count("3")
    for i in range(min(10, twos + 1)):
        for j in range(min(10, threes + 1)):
            if (curr_sum + i * 2 + j * 6) % 9 == 0:
                return "YES"
    return "NO"

T = int(input())
for _ in range(T):
    num = input()
    print(solve(num))
    

Solution 2 (runtime: 203 ms):
t = int(input())

for _ in range(t):

    s = list(map(int, input().strip()))

    x = sum(s)

    twos = 0

    threes = 0

    for i in s:

        if i == 2:

            twos += 1

        elif i == 3:

            threes += 1

        if twos > 8 and threes > 8:

            break



    ans = 'NO'



    for i in range(twos + 1):

        for j in range(threes + 1):

            if (2 * i + 6 * j + x) % 9 == 0:

                ans = 'YES'

                break 

    

    print(ans)
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 124 ms):
for _ in range(int(input())):
    a=list(map(int,list(input())))
    s=sum(a)
    t1,t2=a.count(2),a.count(3)
    for i in range(t1+1):
        for j in range(t2+1):
            if (s+i*2+j*6)%9==0:
                print('YES')
                break
        else:continue
        break
    else:
        print('NO')
    
        


Solution 2 (runtime: 155 ms):
def is_divi9(num):
    s = sum(num)  # مجموع اولیه ارقام
    if s % 9 == 0:  # بررسی اولیه
        return "YES"
    
    # شمارش تعداد ارقام 2 و 3
    count_2 = num.count(2)
    count_3 = num.count(3)

    # بررسی تمام مقادیر ممکن از تغییر
    for c2 in range(count_2 + 1):  # تعداد تغییر 2ها از 0 تا count_2
        for c3 in range(count_3 + 1):  # تعداد تغییر 3ها از 0 تا count_3
            new_s = s + c2 * 2 + c3 * 6
            if new_s % 9 == 0:
                return "YES"

    return "NO"

# ورودی گرفتن
t = int(input())
for _ in range(t):
    num = [int(digit) for digit in input()]  # تبدیل عدد به لیست ارقام
    print(is_divi9(num))
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 124 ms):
for _ in range(int(input())):
    a=list(map(int,list(input())))
    s=sum(a)
    t1,t2=a.count(2),a.count(3)
    for i in range(t1+1):
        for j in range(t2+1):
            if (s+i*2+j*6)%9==0:
                print('YES')
                break
        else:continue
        break
    else:
        print('NO')
    
        


Solution 2 (runtime: 124 ms):
#                             * بسم الله الرحمن الرحيم *
#     ﴾ رَبِّ اشْرَحْ لِي صَدْرِي * وَيَسِّرْ لِي أَمْرِي * وَاحْلُلْ عُقْدَةً مِّن لِّسَانِي * يَفْقَهُوا قَوْلِي ﴿
#  
t=int(input())
for i in range(t):
    n=input()
    intn=int(n)
    result="NO"
    count_2 = n.count('2') 
    count_3 = n.count('3')
    if intn%9==0:
        result="YES"
    else:
        rest=intn%9
        if rest in [1,3,5,7]:
            if rest==7:
                if count_2>=1:
                    result="YES"
            elif rest==5:
                if count_2>=2:
                    result="YES"
            elif rest==3:
                if count_2>=3 or count_3>=1:
                    result="YES"
            elif rest==1:
                if (count_2>=1 and count_3>=1) or count_2>=4:
                    result="YES"
        elif rest in [2,4,6,8]:
            if rest==8:
                if (count_2>=2 and count_3>=1) or count_2>=5:
                    result="YES"
            elif rest==6:
                if (count_3>=2) or (count_2>=3 and count_3>=1) or count_2>=6:
                    result="YES"
            elif rest==4:
                if (count_2>=4 and count_3>=1) or (count_2>=1 and count_3>=2) or count_2>=7:
                    result="YES"
            elif rest==2:
                if (count_2>=5 and count_3>=1) or (count_2>=2 and count_3>=2) or count_2>=8:
                    result="YES"
                
    print(result)
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 124 ms):
for _ in range(int(input())):
    a=list(map(int,list(input())))
    s=sum(a)
    t1,t2=a.count(2),a.count(3)
    for i in range(t1+1):
        for j in range(t2+1):
            if (s+i*2+j*6)%9==0:
                print('YES')
                break
        else:continue
        break
    else:
        print('NO')
    
        


Solution 2 (runtime: 139 ms):
tt = int(input())
while(tt > 0):
    num = input()
    num_2 = 0
    num_3 = 0
    curr_sum = 0
    max_x = 0
    max_y = 0
    for digit in num:
        curr_digit = int(digit)
        if curr_digit == 2:
            max_x += 1
        if curr_digit == 3:
            max_y += 1
        curr_sum += curr_digit

    ans = "YES" if curr_sum % 9 == 0 else "NO"
    x = 0
    y = 0
    for x in range(0,min(max_x+1, 9)):
        for y in range(0,min(max_y+1, 9)):
            total_sum = curr_sum + x*2 + y*6
            if total_sum % 9 == 0:
                ans = "YES"
    print(ans)
    tt -= 1
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 124 ms):
for _ in range(int(input())):
    a=list(map(int,list(input())))
    s=sum(a)
    t1,t2=a.count(2),a.count(3)
    for i in range(t1+1):
        for j in range(t2+1):
            if (s+i*2+j*6)%9==0:
                print('YES')
                break
        else:continue
        break
    else:
        print('NO')
    
        


Solution 2 (runtime: 186 ms):
t = int(input())
ans = []
for i in range(t):
    n = input()
    a = n.count("2")
    b = n.count("3")
    v = 0
    for j in n:
        v += int(j)
    r = v%9
    if (a>=2 and b>=2) or (a>=5 and b>=1) or a>=8:
        ans.append("YES")
    elif r==0:
        ans.append("YES")
    elif r==4 and (a>=7 or (a>=4 and b>=1) or (a>=1 and b>=2)):
        ans.append("YES")
    elif r==6 and (a>=6 or (a>=3 and b>=1) or b>=2):
        ans.append("YES")
    elif r==8 and (a>=5 or (a>=2 and b>=1)):
        ans.append("YES")         
    elif r==1 and (a>=4 or (a>=1 and b>=1)):
        ans.append("YES")
    elif r==3 and (a>=3 or b>=1):
        ans.append("YES")
    elif r==5 and a>=2:
        ans.append("YES")
    elif r==7 and a>=1:
        ans.append("YES")
    else:
        ans.append("NO")

for j in ans:
    print(j)
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 124 ms):
for _ in range(int(input())):
    a=list(map(int,list(input())))
    s=sum(a)
    t1,t2=a.count(2),a.count(3)
    for i in range(t1+1):
        for j in range(t2+1):
            if (s+i*2+j*6)%9==0:
                print('YES')
                break
        else:continue
        break
    else:
        print('NO')
    
        


Solution 2 (runtime: 140 ms):
t = int(input())

def solve():
    num = [int(x) for x in input()]
    
    num_sum = sum(num)
    need = 9 - (num_sum % 9)
    
    count3 = num.count(3)
    count2 = num.count(2)
    
    for i in range(count2+1):
        for j in range(count3+1):
            if ((i * 2 + j * 6) - need) % 9 == 0:
                print("YES")
                return
    
    print("NO")
    return

for _ in range(t):
    solve()
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 124 ms):
for _ in range(int(input())):
    a=list(map(int,list(input())))
    s=sum(a)
    t1,t2=a.count(2),a.count(3)
    for i in range(t1+1):
        for j in range(t2+1):
            if (s+i*2+j*6)%9==0:
                print('YES')
                break
        else:continue
        break
    else:
        print('NO')
    
        


Solution 2 (runtime: 249 ms):
# ======= author: kuanhungchen.com | created: 05/02/23 08:33:06 CST ======= #
from sys            import stdin,  stderr, stdout, setrecursionlimit
from bisect         import bisect_left, bisect_right
from collections    import defaultdict, deque, Counter
from itertools      import accumulate, combinations, permutations, product
from functools      import lru_cache, cmp_to_key, reduce
from heapq          import heapify, heappush, heappop, heappushpop, heapreplace
# from pypyjit        import set_param
# set_param("max_unroll_recursion=-1")
# setrecursionlimit(300005)
orda  = 97
ordA  = 65
INF   = 1 << 60
MOD   = 1000000007
MOD2  = 998244353
input = lambda: stdin.readline().rstrip("\r\n")
linen = lambda cf_: "[L" + str(cf_.f_back.f_lineno) + "] "
dbg   = lambda *A, **M: stderr.write("\033[91m" + \
        M.get("sep", " ").join(map(str, A)) + M.get("end", "\n") + "\033[0m")
# ============================ START OF MY CODE ============================ #

def solve(_tc):
    s = input()
    n = len(s)
    dp = [set() for _ in range(n)]
    x = int(s[0])
    while x <= 9:
        dp[0].add(x % 9)
        if x == 0 or x == 1: break
        x *= x
    for i in range(1, n):
        x = int(s[i])
        xs = []
        while x <= 9:
            xs.append(x)
            if x == 0 or x == 1: break
            x *= x
        st = set()
        for d in dp[i - 1]:
            for x in xs:
                st.add((d + x) % 9)
        dp[i] = st
    if 0 in dp[-1]:
        print("YES")
    else:
        print("NO")


if __name__ == "__main__":
    _tcs = int(input())
    for _tc in range(1, vars().get("_tcs", 1) + 1):
        dbg("=== Case {} ===".format(str(_tc).rjust(2)))
        solve(_tc)
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 124 ms):
for _ in range(int(input())):
    a=list(map(int,list(input())))
    s=sum(a)
    t1,t2=a.count(2),a.count(3)
    for i in range(t1+1):
        for j in range(t2+1):
            if (s+i*2+j*6)%9==0:
                print('YES')
                break
        else:continue
        break
    else:
        print('NO')
    
        


Solution 2 (runtime: 108 ms):
def function(num: str):
    number_sum, two_count, three_count = 0, 0, 0
    for c in num:
        number_sum += ord(c) - ord('0')
        if c == '2':
            two_count += 1
        if c == '3':
            three_count += 1
    difference_needed = (9 - (number_sum % 9)) % 9
    yes = False
    for i in range(min(9, two_count + 1)): #where is the proof of this
        for j in range(min(9, three_count + 1)):
            if (2 * i + 6 * j) % 9 == difference_needed:
                yes = True
    if yes:
        print("YES")
    else:
        print("NO")

if __name__ == "__main__":
    tests = int(input())
    for _ in range(tests):
        num = input()
        function(num)
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 124 ms):
for _ in range(int(input())):
    a=list(map(int,list(input())))
    s=sum(a)
    t1,t2=a.count(2),a.count(3)
    for i in range(t1+1):
        for j in range(t2+1):
            if (s+i*2+j*6)%9==0:
                print('YES')
                break
        else:continue
        break
    else:
        print('NO')
    
        


Solution 2 (runtime: 249 ms):
for t in range(int(input())):
    s = input()
    sm = 0
    for i in s:
        sm += int(i)

    mod = sm%9

    if mod==0:
        print('YES')
    
    else:
        count2 = 0
        count3 = 0
        for char in s:
            if char=='2':
                count2 += 1
            elif char=='3':
                count3 += 1

        if mod==1:
            if count2>=4 or (count2>=1 and count3>=1):
                print('YES')
            else:
                print('NO')

        elif mod==2:
            if (count2>=2 and count3>=2) or (count2>=5 and count3>=1) or (count2>=8):
                print('YES')
            else:
                print("NO")

        elif mod==3:
            if (count3>=1) or (count2>=3):
                print('YES')
            else:
                print("NO")

        elif mod==4:
            if (count2>=4 and count3>=1) or (count2>=1 and count3>=2) or (count2>=7):
                print('YES')
            else:
                print("NO")

        elif mod==5:
            if (count2>=2):
                print('YES')
            else:
                print("NO")

        elif mod==6:
            if (count2>=6) or (count2>=3 and count3>=1) or (count3>=2):
                print('YES')
            else:
                print("NO")

        elif mod==7:
            if (count2>=1):
                print('YES')
            else:
                print("NO")

        elif mod==8:
            if (count2>=5) or (count2>=2 and count3>=1):
                print('YES')
            else:
                print("NO")
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 124 ms):
for _ in range(int(input())):
    a=list(map(int,list(input())))
    s=sum(a)
    t1,t2=a.count(2),a.count(3)
    for i in range(t1+1):
        for j in range(t2+1):
            if (s+i*2+j*6)%9==0:
                print('YES')
                break
        else:continue
        break
    else:
        print('NO')
    
        


Solution 2 (runtime: 343 ms):
import sys

input_data = sys.stdin.read().strip()

lines = input_data.splitlines()
lines.pop(0)

inp=[]
ans=[]
k=0
for line in lines:
   inp.append(int(line))
    
def get_digits(number):
    return [int(digit) for digit in str(abs(number))]

def count(dig):
    three = 0
    two = 0
    for d in dig:
        if d == 2:
            two += 1
        if d == 3:
            three += 1
    return two, three

for num in inp:
    nta = (num % 9)
    digits = get_digits(num)
    q2, q3 = count(digits)
    i, j = 0, 0
    f = 0
    while i <= q3:
        while j <= q2:
            if (nta + 6*i + 2*j) % 9 == 0:
                ans.append("YES")
                f = 1
                break
            j += 1
        if f == 1:
            break
        j = 0
        i += 1
    if f == 0:
        ans.append("NO")
            
for a in ans:
    print(a)
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 124 ms):
for _ in range(int(input())):
    a=list(map(int,list(input())))
    s=sum(a)
    t1,t2=a.count(2),a.count(3)
    for i in range(t1+1):
        for j in range(t2+1):
            if (s+i*2+j*6)%9==0:
                print('YES')
                break
        else:continue
        break
    else:
        print('NO')
    
        


Solution 2 (runtime: 249 ms):
for i in range(int(input())):
    n=(input())
    a=0
    for i in n:
        a+=int(i)
    a=a%9
    a=9-a
    if a==9:
        print("YES")
    else:
        if a%2!=0:
            p=0
            q=0
            for i in n:
                if i=="2":
                    p+=1
                if i=="3":
                    q+=1
            if a==1:
                if p>=5 or (p>=2 and q>=1):
                    print("YES")
                else:
                    print("NO")
            elif a==3:
                if q>=2 or p>=6 or (q>=1 and p>=3):
                    print("YES")
                else:
                    print("NO")
            elif a==5:
                if p>=7 or (q>=1 and p>=4) or (q>=2 and p>=1):
                    print("YES")
                else:
                    print('NO')
            else:
                if p>=8 or (q>=1 and p>=5) or (q>=2 and p>=2):
                    print("YES")
                else:
                    print("NO")
        else:
            if a<6:
                a=a//2
                ans=0
                for i in n:
                    if i=="2":
                        ans+=1
                if ans>=a:
                    print("YES")
                else:
                    print("NO")
            else:
                if a==6:
                    a=a//2
                    ans=0
                    for i in n:
                        if i=="2":
                            ans+=1
                    if ans>=a:
                        print("YES")
                    else:
                        for i in n:
                            if i=="3":
                                print("YES")
                                break
                        else:
                            print("NO")
                else:
                    a=a//2
                    ans=0
                    for i in n:
                        if i=="2":
                            ans+=1
                    if ans>=a:
                        print("YES")
                    else:
                        if ans<1:
                            print("NO")
                        else:
                            for i in n:
                                if i=="3":
                                    print("YES")
                                    break
                            else:
                                print("NO")
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 124 ms):
for _ in range(int(input())):
    a=list(map(int,list(input())))
    s=sum(a)
    t1,t2=a.count(2),a.count(3)
    for i in range(t1+1):
        for j in range(t2+1):
            if (s+i*2+j*6)%9==0:
                print('YES')
                break
        else:continue
        break
    else:
        print('NO')
    
        


Solution 2 (runtime: 108 ms):
import sys
from math import sqrt
input = sys.stdin.readline

def solve():
    # n=int(input())
    # a=[int(x) for x in input().split()]
    s = [int(x) for x in input().strip()]
    
    sm = sum(s)
    twos = s.count(2)
    threes = s.count(3)
    for i in range (min(10, twos + 1)):
    	for j in range(min(10, threes + 1)):
    		if (sm + i * 2 + j * 6) % 9 == 0:
    			print('yes')
    			return
    print('no')

T=int(input())
for _ in range(T):
	solve()
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 124 ms):
for _ in range(int(input())):
    a=list(map(int,list(input())))
    s=sum(a)
    t1,t2=a.count(2),a.count(3)
    for i in range(t1+1):
        for j in range(t2+1):
            if (s+i*2+j*6)%9==0:
                print('YES')
                break
        else:continue
        break
    else:
        print('NO')
    
        


Solution 2 (runtime: 234 ms):
n = int(input())

for _ in range(n):
    possible = [0]
    s = str(input())
    for char in s:
        new = set()
        for i in possible:
            new.add((i+int(char)) % 9)
        if int(char) <= 3:
            for i in possible:
                new.add((i+int(char)*int(char)) % 9)
        possible = new
    if 0 in possible:
        print("YES")
    else:
        print("NO")