Question 1

Problem Statement

Question 1 Problem Description Given n computer frames, each frame is associated with a power denoted by the array power[] . Where power[i] represents the power of the i th frame. The current resolution starts at 1. Each frame can be unused or it can be utilized in one of three ways: As a magnifying frame, which multiplies the current resolution by power[i] . As a reducing frame, which divides the current resolution by power[i] . By using both its magnifying and reducing powers together, leaving the current resolution unchanged. The target array contains q queries representing target resolutions. For each query, calculate the number of configurations required to achieve the target resolution, modulo (10 9 +7). It is not necessary to use all frames; each frame can be used or not used based on the configuration choice. Two configurations are considered different if at least one frame is used in one configuration but not in the other or if a frame is used in different ways in both configu