problem90.cpp

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

class AlchemistsMultiplication {
  int n;
  vector<long long> energy;

public:
  void readInput() {
    cin >> n;
    energy.resize(n);
    for (int i = 0; i < n; i++) {
      cin >> energy[i];
    }
  }

  void solve() {
    vector<long long> left(n, 1);
    vector<long long> right(n, 1);
    vector<long long> result(n);

    // Build prefix product
    for (int i = 1; i < n; i++) {
      left[i] = left[i - 1] * energy[i - 1];
    }

    // Build suffix product
    for (int i = n - 2; i >= 0; i--) {
      right[i] = right[i + 1] * energy[i + 1];
    }

    // Combine prefix & suffix
    for (int i = 0; i < n; i++) {
      result[i] = left[i] * right[i];
    }

    // Output
    for (int i = 0; i < n; i++) {
      cout << result[i] << " ";
    }
    cout << endl;
  }
};

int main() {
  AlchemistsMultiplication solver;
  solver.readInput();
  solver.solve();
  return 0;
}