Problem: 2050C - Uninteresting Number
Language: java

Solution 1 (runtime: 249 ms):
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
public class main {
    static PrintWriter pw = new PrintWriter(new BufferedOutputStream(System.out));
    static FastReader in = new FastReader();
    public static int n;  
    public static void main(String[] args) {
        int t = in.nextInt();
        while (t-- > 0) {
            String p = in.next();
            n = p.length();
            long sum = 0;
            for (int i = 0; i < n; i++) {
                int l = p.charAt(i) - '0';
                sum += l;
            }
            if (sum % 9 == 0) {
                pw.println("YES");
            } else {
                sum %= 9;
                sum = 9 - sum;

                int count2 = 0;
                int count3 = 0;
                for (int i = 0; i < n; i++) {
                    int l = p.charAt(i) - '0';
                    if (l == 2) {
                        count2++;
                    } else if (l == 3) {
                        count3++;
                    }
                }
                if (sum % 2 != 0) {
                    sum += 9;
                }
                while(count3 > 0 && sum >= 6) {
                    count3--;
                    sum -= 6;
                }
                while(count2 > 0 && sum >= 2) {
                    count2--;
                    sum -= 2;
                }
                if (sum == 0) {
                    pw.println("YES");
                } else {
                    pw.println("NO");
                }
            }
        }
        pw.close();
    }
    
    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
}


Solution 2 (runtime: 311 ms):
import java.util.*;

public class Main {
    static Scanner in;

    public static void main(String[] args) {
        int t = 1;
        in = new Scanner(System.in);
        t = in.nextInt();
        while (t-- > 0) {
            solve();
        }
        in.close();
    }

    static void solve() {
        String n = in.next(); 
        int sum = 0, two = 0, three = 0;

        for (char c : n.toCharArray()) {
            int digit = c - '0'; 
            sum += digit;
            if (digit == 2) two++;
            if (digit == 3) three++;
        }

        int remain = 9-sum % 9;
        if (remain == 9 || canReach(remain, two, three)) System.out.println("YES");
        else System.out.println("NO");
        return;
    }

    public static boolean canReach(int r, int maxTwo, int maxThree) {
        for (int x = 0; x <= maxTwo; x++) {
            for (int y = 0; y <= maxThree; y++) {
                if ((2 * x + 6 * y) % 9 == r) {
                    return true;
                }
            }
        }
        return false;
    }

    static int[] readArray(int n) {
        int[] arr = new int[n];
        for (int i = 0; i < n; i++) arr[i] = in.nextInt();
        return arr;
    }
}