Submission #3790158

---

Source Code Expand

// Header {{{
#include <bits/stdc++.h>

using namespace std;
template<typename T>
using reversed_priority_queue = std::priority_queue<T, std::vector<T>, std::greater<T> >;
typedef unsigned long long int ull;
typedef long long int ll;
#define rep(i,a,b) for (ll i=(a); i<(b); i++)
typedef pair<ll,ll> PLL;
// }}}
ll t(char c){
    return c-'0';
}
ll f(ll bit ,ll i){
    return (bit>>i)&1 ? 1 : -1;
}
char g(ll bit ,ll i){
    return (bit>>i)&1 ? '+' : '-';
}
signed main() {
    string s;
    cin>>s;
    rep(bit,0,8){
        if (t(s[0]) + t(s[1]) * f(bit, 0) + t(s[2]) * f(bit, 1) + t(s[3]) * f(bit, 2)==7){
            cout<<s[0]<<g(bit,0)<<s[1]<<g(bit,1)<<s[2]<<g(bit,2)<<s[3] <<"=7"<<endl;
            return 0;
        }
    }
    return 0;
}

Submission Info

Judge Result