Luzhiled

// fenwick tree {{{ 
template < typename data_type >
class fenwick_tree {

    std::size_t size_;
    std::vector< data_type > data_;

    public:
    fenwick_tree(size_t size) : size_(size), data_(size + 1) {}

Luzhiled

#include <bits/stdc++.h>
using namespace std;

// boku no template meisou now 

// clang-format off
// #define fs first
// #define sc second
// #define pb emplace_back
// #define mp make_pair

Luzhiled

#include <bits/stdc++.h>
using namespace std;

#define fs first
#define sc second
#define pb emplace_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()

Luzhiled

#include <bits/stdc++.h>
using namespace std;
 
#define fs first
#define sc second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define pb emplace_back
 

Luzhiled

#include <bits/stdc++.h>
using namespace std;

#define fs first
#define se second
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define pb emplace_back

using pii = pair<int, int>;

Luzhiled

#include <bits/stdc++.h>
using namespace std;

#define fs first
#define se second
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define pb emplace_back

using pii = pair<int, int>;

Luzhiled

#include <bits/stdc++.h>
using namespace std;

#define fs first
#define se second
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define pb emplace_back

using pii = pair<int, int>;

Luzhiled

#include <bits/stdc++.h>
using namespace std;

#define fs first
#define se second
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define pb emplace_back

using pii = pair<int, int>;

Luzhiled

#include <bits/stdc++.h>
using namespace std;

int main() {
	int a, b;
	cin >> a >> b;

	if (a + b >= 10) {
		cout << "error" << endl;
	}

Luzhiled

set nu ts=2 sw=2 et cin sta
sy on
ima <C-]> <esc>