Submission #1173217

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <iomanip>
#include <string>
#include <functional>
#include <utility>
#include <queue>
#include <vector>
#include <string>
#include <stack>
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
typedef long long int ll;
const ll  MOD = 1000000007;
typedef pair<ll,ll> P;

ll R= 1000;
ll N=8;
bool f = false;

ll input_D,input_T;
ll input_C[10];
ll input_A[10];
ll is_sellable(ll D){
  ll r = (1 << N);
  ll sum = 0;
  rep(i,r){
    sum = 0;
    rep(j,N){
      if(i & (1 << j)){
        sum += input_A[j];
      }
    }
    if(sum == D){
      return i;
    }
  }
  return 0;
}

int main(){
  while(R--){
    cin >> input_D >> input_T;
    rep(i,N){
      cin >> input_C[i];
    }
    rep(i,N){
      cin >> input_A[i];
    }
    f=false;
    //40ijou ni ureruka douka
    if(input_D >= 40){
      ll tmp = is_sellable(input_D);
      if(tmp > 0){
        ll tmp_count = 0;
        rep(i,N){
          if(tmp & (1 << i)){
            tmp_count++;
          }
        }
        cout << "sell " << tmp_count;
        rep(i,N){
          if(tmp & (1 << i)){
            cout << " " << i+1 ;
          }
        }
        cout << endl;
        continue;
      }
    }
    rep(i,N){
      if(input_C[i] < 7){
        cout << "change " << i+1 << endl;
        f=true;
        break;
      }
    }
    if(f) continue;
    rep(i,N){
      if(input_A[i] < 7){
        cout << "fill " << i+1 << endl;
        f = true;
        break;
      }
    }
    if(f) continue;
    cout << "pass" << endl;
  }
}

Submission Info

Judge Result