AtCoder Beginner Contest 344 参加記録

int main(void){

  string S; cin >> S;

  int first = S.find_first_of('|');
  int last = S.find_last_of('|');

  cout << S.substr(0, first) << S.substr(last+1) << endl;


  return 0;

}

int main(void){

  vector<ll> A;

  int a; cin >> a;
  A.push_back(a);

  if(a == 0){
    cout << "0" << endl;
    return 0;
  }

  while(true){
    cin >> a;
    A.push_back(a);

    if(a == 0){
      break;
    }
  }

  reverse(A.begin(), A.end());

  for(auto x : A){
    cout << x << endl;
  }

  return 0;

}

vector<ll> A, B, C, X;

map<ll, bool> mp;

bool dfs(int i, ll sum){
  if(i == 0){
    REP(j, A.size()){
     if(dfs(i+1, sum+A[j])) return true;
    }
  }else if(i == 1){
    REP(j, B.size()){
      if(dfs(i+1, sum+B[j])) return true;
    }
  }else if(i == 2){
    REP(j,C.size()){
      if(dfs(i+1, sum+C[j])) return true;
    }
  }else{
    mp[sum] = true;
  }

  return false;
}

int main(void){

  int N; cin >> N;
  REP(i, N){
    ll tmp; cin >> tmp;
    A.push_back(tmp);
  }

  int M; cin >> M;
  REP(i,M){
    ll tmp; cin >> tmp;
    B.push_back(tmp);
  }

  int L; cin >> L;
  REP(i,L){
    ll tmp; cin >> tmp;
    C.push_back(tmp);
  }

  int Q; cin >> Q;
  REP(i,Q){
    ll tmp; cin >> tmp;
    X.push_back(tmp);
  }

  dfs(0, 0);

  REP(i,Q){
    if(mp[X[i]]) cout << "Yes" << endl;
    else cout << "No" << endl;
  }

  return 0;

}