/*Write a Program to take an integer array nums. Print an array answer such that answer[i] is equal to the product
of all the elements of nums except nums[i]. The product of any prefix or suffix of nums is guaranteed to fit in a
32-bit integer.*/
#include <stdio.h>
 
int main() {
    int n;
    scanf("%d", &n);
 
    int nums[n], answer[n];
 
    for (int i = 0; i < n; i++) 
        scanf("%d", &nums[i]);
 
    // Prefix product
    int prefix = 1;
    for (int i = 0; i < n; i++) {
        answer[i] = prefix;
        prefix *= nums[i];
    }
 
    // Suffix product
    int suffix = 1;
    for (int i = n - 1; i >= 0; i--) {
        answer[i] *= suffix;
        suffix *= nums[i];
    }
 
    // Print result
    for (int i = 0; i < n; i++) {
        printf("%d", answer[i]);
        if (i != n - 1) printf(" ");
    }
 
    return 0;
}
 
 

LypXcml0ZSBhIFByb2dyYW0gdG8gdGFrZSBhbiBpbnRlZ2VyIGFycmF5IG51bXMuIFByaW50IGFuIGFycmF5IGFuc3dlciBzdWNoIHRoYXQgYW5zd2VyW2ldIGlzIGVxdWFsIHRvIHRoZSBwcm9kdWN0Cm9mIGFsbCB0aGUgZWxlbWVudHMgb2YgbnVtcyBleGNlcHQgbnVtc1tpXS4gVGhlIHByb2R1Y3Qgb2YgYW55IHByZWZpeCBvciBzdWZmaXggb2YgbnVtcyBpcyBndWFyYW50ZWVkIHRvIGZpdCBpbiBhCjMyLWJpdCBpbnRlZ2VyLiovCiNpbmNsdWRlIDxzdGRpby5oPgoKaW50IG1haW4oKSB7CiAgICBpbnQgbjsKICAgIHNjYW5mKCIlZCIsICZuKTsKCiAgICBpbnQgbnVtc1tuXSwgYW5zd2VyW25dOwoKICAgIGZvciAoaW50IGkgPSAwOyBpIDwgbjsgaSsrKSAKICAgICAgICBzY2FuZigiJWQiLCAmbnVtc1tpXSk7CgogICAgLy8gUHJlZml4IHByb2R1Y3QKICAgIGludCBwcmVmaXggPSAxOwogICAgZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspIHsKICAgICAgICBhbnN3ZXJbaV0gPSBwcmVmaXg7CiAgICAgICAgcHJlZml4ICo9IG51bXNbaV07CiAgICB9CgogICAgLy8gU3VmZml4IHByb2R1Y3QKICAgIGludCBzdWZmaXggPSAxOwogICAgZm9yIChpbnQgaSA9IG4gLSAxOyBpID49IDA7IGktLSkgewogICAgICAgIGFuc3dlcltpXSAqPSBzdWZmaXg7CiAgICAgICAgc3VmZml4ICo9IG51bXNbaV07CiAgICB9CgogICAgLy8gUHJpbnQgcmVzdWx0CiAgICBmb3IgKGludCBpID0gMDsgaSA8IG47IGkrKykgewogICAgICAgIHByaW50ZigiJWQiLCBhbnN3ZXJbaV0pOwogICAgICAgIGlmIChpICE9IG4gLSAxKSBwcmludGYoIiAiKTsKICAgIH0KCiAgICByZXR1cm4gMDsKfQoK

NQoxIDIgMyA0IDUK

5
1 2 3 4 5