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: 327 ms):
import java.util.*;
public class temp{
    public static void main(String[] args){
        Scanner sc=new Scanner(System.in);
        int t=sc.nextInt();
        sc.nextLine();
        while(t-->0){
            String s=sc.nextLine();
            char[] c=s.toCharArray();
            int[] fre=new int[10];
            int sum=0;
            for(int i=0;i<c.length;i++){
                int cr=c[i]-'0';
                fre[cr]++;
                sum+=cr;
                if(sum>9)sum=sum%10+sum/10;
            }
            int f=-1;
            if(sum==0 || sum==9)f=1;
            else{
                int[][] dp=new int[Math.min(10,fre[2]+1)][Math.min(10,fre[3]+1)];
                for(int i=0;i<dp.length;i++)
                    Arrays.fill(dp[i],-1);
                int ans=solve(sum,dp,1,1);
                if(ans==0)f=1;
            }
            if(f==1)System.out.println("YES");
            else System.out.println("NO");
        }
    }
    public static int solve(int sum,int[][] dp,int i,int j){
        if(sum==0){return 0;}
        if(i==dp.length && j==dp[0].length)return 1;
        if(i<dp.length && j<dp[0].length && dp[i][j]!=-1)return dp[i][j];
        if((i<dp.length && solve((sum+2)%9,dp,i+1,j)==0) || (j<dp[0].length && solve((sum+6)%9,dp,i,j+1)==0)){
            if(i<dp.length && j<dp[0].length)dp[i][j]=0;
            return 0;}
        if(i<dp.length && j<dp[0].length)dp[i][j]=1;
        return 1;
    }
}