n=int(input())
for i in range(n):
m=input()
li=list(map(int,m))
if sum(li[:3])==sum(li[3:]):
print("YES")
else:
print("NO")#include<iostream>
using namespace std;
int main()
{
int n;
cin>>n;
while(n--)
{
int x,sum=0,sum1=0;
cin>>x;
for(int i=1;i<=3;i++)
{
int rem=x%10;
x=x/10;
sum=sum+rem;
}
for(int i=6;i>3;i--)
{
int rem1=x%10;
x=x/10;
sum1=sum1+rem1;
}
if(sum==sum1)
{
cout<<"YES"<<endl;
}
else
{
cout<<"NO"<<endl;
}
}
}1290. Convert Binary Number in a Linked List to Integer | 1525. Number of Good Ways to Split a String |
72. Edit Distance | 563. Binary Tree Tilt |
1306. Jump Game III | 236. Lowest Common Ancestor of a Binary Tree |
790. Domino and Tromino Tiling | 878. Nth Magical Number |
2099. Find Subsequence of Length K With the Largest Sum | 1608A - Find Array |
416. Partition Equal Subset Sum | 1446. Consecutive Characters |
1618A - Polycarp and Sums of Subsequences | 1618B - Missing Bigram |
938. Range Sum of BST | 147. Insertion Sort List |
310. Minimum Height Trees | 2110. Number of Smooth Descent Periods of a Stock |
2109. Adding Spaces to a String | 2108. Find First Palindromic String in the Array |
394. Decode String | 902. Numbers At Most N Given Digit Set |
221. Maximal Square | 1200. Minimum Absolute Difference |
1619B - Squares and Cubes | 1619A - Square String |
1629B - GCD Arrays | 1629A - Download More RAM |
1629C - Meximum Array | 1629D - Peculiar Movie Preferences |