1807A - Plus or Minus - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define mod 1000000007
#define MOD 998244353
#define nl "\n"
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define ff first
#define ss second
#define sort(x) sort(x.begin(), x.end())
#define reverse(y) reverse(y.begin(), y.end())
#define sz(x) ((int)(x).size())
#define inf 1000000000000000005
const int N = 2e5 + 100;

ll gcd(ll a, ll b)
{
    if (b > a)
    {
        return gcd(b, a);
    }
    if (b == 0)
    {
        return a;
    }
    return gcd(b, a % b);
}

ll inv(ll i)
{
    if (i == 1)
        return 1;
    return (mod - ((mod / i) * inv(mod % i)) % mod) % mod;
}
ll expo(ll a, ll b)
{
    ll res = 1;
    while (b > 0)
    {
        if (b & 1)
            res = (res * a) % mod;
        a = (a * a) % mod;
        b = b >> 1;
    }
    return res;
}
vector<ll> sieve(int n)
{
    int *arr = new int[n + 1]();
    vector<ll> vect;
    for (int i = 2; i <= n; i++)
        if (arr[i] == 0)
        {
            vect.push_back(i);
            for (int j = 2 * i; j <= n; j += i)
                arr[j] = 1;
        }
    return vect;
}
vector<ll> divisors(ll n)
{
    vector<ll> fact;
    for (ll i = 1; i * i <= n; i++)
    {
        if (n % i == 0)
        {
            if (n / i == i)
                fact.pb(i);
            else
            {

                fact.pb(i);

                fact.pb(n / i);
            }
        }
    }
    return fact;
}
ll lcm(ll a, ll b)
{
    return (a * b) / gcd(a, b);
}




void solve()
{
    ll a, b, c;
    cin >> a >> b >> c;
    if (a + b == c)
    {
        cout << "+" << nl;
    }
    else
    {
        cout << "-" << nl;
    }
}

int main()
{
     ios_base::sync_with_stdio(false);
     cin.tie(NULL);
     cout.tie(NULL);
    int t = 1;
    cin >> t;

    while (t > 0)
    {
        solve();
        t--;
    }

    return 0;
}