Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- #define int long long
- #define vi vector<int>
- #define vii vector<vi>
- #define ii pair<int,int>
- #define fi first
- #define sc second
- #define pb push_back
- #define stoi stoll
- #define popcnt __builtin_popcount
- #define getbit(x, k) ((x >> k) & 1)
- #define all(x) (x).begin(),(x).end()
- #define FOR(i,j,k) for(int i=j; i<(int)k; ++i)
- #define look(a) cerr <<#a<<": "<<a<<endl;
- #define look2(a,b) cerr <<#a<<": "<<a<<" | "<<#b<<": "<<b<< endl;
- bool found = false;
- void print(char b[])
- {
- found = true;
- FOR(i,0,5) cout << b[i] << ' ';
- cout << '\n';
- }
- void dq(int i, int s, int a[], char b[], int n)
- {
- if (i == 6) {
- if (s == n) print(b);
- } else {
- b[i-1] = '+';
- dq(i+1,s+a[i],a,b,n);
- b[i-1] = '-';
- dq(i+1,s-a[i],a,b,n);
- b[i-1] = '*';
- dq(i+1,s*a[i],a,b,n);
- if ((s/a[i])*a[i] == s){
- b[i-1] = '/';
- dq(i+1,s/a[i],a,b,n);
- }
- }
- }
- void solve()
- {
- int n;
- cin >> n;
- int a[6];
- char b[5];
- FOR(i,0,6) cin >> a[i];
- dq(1,a[0],a,b,n);
- if (!found) cout << "Noconfig";
- }
- signed main()
- {
- cin.tie(0)->sync_with_stdio(0);
- freopen("in", "r", stdin);
- freopen("out", "w", stdout);
- int T = 1;
- // cin >> T;
- while (T--) {
- solve();
- cout << '\n';
- }
- cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement