Codeforces Round #790 (Div. 4) - A

문제 출처:

https://codeforces.com/contest/1676/problem/A

 

문제 분석:

구현

 

문제 해결:

앞 세수를 더한값과 뒷 세수 더한값이 같으면 된다.

 

내 소스코드:

// freopen("input.txt", "r", stdin);
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <stdio.h>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <utility>
#include <string>
#include <queue>
#include <stack>
#include <cstring>
#include <list>
#include <set>
#include <string.h>
#include <map>
#include <limits.h>
#include <stdlib.h>

#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define range(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define pb push_back
#define F first
#define S second

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;

const int INF = 987654321;
int testcase;

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	cin >> testcase;

	while (testcase--)
	{
		string tmp;
		cin >> tmp;
		int suma = 0;
		int sumb = 0;

		suma = (int)tmp[0] + (int)tmp[1] + (int)tmp[2];
		sumb = (int)tmp[3] + (int)tmp[4] + (int)tmp[5];

		if (suma == sumb)
			cout << "YES\n";
		else
			cout << "NO\n";
	}

	return 0;
}

고찰: