Submission #2236117

---

Source Code Expand

#include <cstdlib>
#include <iostream>
#include <cstdint>
#include <vector>
#include <string>
#include <complex>
#include <boost/lexical_cast.hpp>
#include <boost/algorithm/string/predicate.hpp>

using namespace std;

#if 0
// memo
abs()

start_with(str, "hoge");
ends_with(str, "hoge");

std::sort(d.begin(), d.end());
d.erase(std::unique(d.begin(), d.end()), d.end());
#endif

using namespace boost;
using namespace boost::algorithm;

static inline bool isOdd(int v)
{
    return v & 0x01;
}

int main()
{
    string str;
    cin >> str;

    int v[4];
    v[0] = lexical_cast<int>(str[0]);
    v[1] = lexical_cast<int>(str[1]);
    v[2] = lexical_cast<int>(str[2]);
    v[3] = lexical_cast<int>(str[3]);

//    cerr << A << B << C << D << endl;

    for (size_t i = 0; i < 2*2*2; ++i) {
        std::string str;
        size_t sum = v[0];
        str += lexical_cast<char>(v[0]);
        for (size_t j = 0; j < 3; ++j) {
            bool isPlus = (i >> j) & 0x01;
            if (isPlus) {
                str.push_back('+');
                sum += v[j+1];
            }
            else {
                str.push_back('-');
                sum -= v[j+1];
            }
            str += lexical_cast<char>(v[j+1]);
        }
        if (sum == 7) {
            str += "=7\n";
            cout << str;
            break;
        }
        cerr << "cand: " << str << endl;
    }

    return 0;
}

Submission Info

Judge Result