player begins the game from the 1-st stage and should beat the stages in expanding request of the stage number. The player dominates the match in the wake of beating the n-th stage. There is all things considered one designated spot on each stage, and there is consistently a designated spot on the 1-st stage.
Concepts in Designing Database
A database design is the process of data organization based on a database model. The process deals with identifying what data should be stored in a database and how data elements relate to each other.
Entity Relationship Diagram
Complex real-world applications call for large volumes of data. Therefore, it is necessary to build a great database to store data safely and coherently. The ER data model aids in the process of database design. It helps outline the structure of an organization’s database by understanding the real-world interactions of objects related to the data. For example, if a school is tasked to store student information, then analyzing the correlation between the students, subjects, and teachers would help identify how the data needs to be stored.
Correct answer will be upvoted else Multiple Downvoted. Computer science.
player begins the game from the 1-st stage and should beat the stages in expanding request of the stage number. The player dominates the match in the wake of beating the n-th stage.
There is all things considered one designated spot on each stage, and there is consistently a designated spot on the 1-st stage. Toward the start of the game, just the designated spot on the 1-st stage is initiated, and any remaining designated spots are deactivated. At the point when the player gets to the I-th stage that has a designated spot, that designated spot is initiated.
For each attempt of a phase, the player can either beat the stage or bomb the stage. On the off chance that they beat the I-th stage, the player is moved to the i+1-st stage. On the off chance that they bomb the I-th stage, the player is moved to the latest designated spot they actuated, and they need to beat the stages after that designated spot once more.
For instance, expect that n=4 and the designated spots are on the 1-st and 3-rd stages. The player begins at the 1-st stage. If they come up short on the 1-st stage, they need to retry the 1-st stage on the grounds that the designated spot on the 1-st stage is the latest designated spot they enacted. On the off chance that the player beats the 1-st stage, they're moved to the 2-nd stage. If they bomb it, they're sent back to the 1-st stage once more. If they beat both the 1-st stage and the 2-nd stage, they get to the 3-rd stage and the designated spot on the 3-rd stage is enacted. Presently at whatever point they fizzle on the 3-rd stage, or the 4-th stage subsequent to beating the 3-rd stage, they're sent back to the 3-rd stage. On the off chance that they beat both the 3-rd stage and the 4-th stage, they dominate the game.
Gildong will fabricate the stages to have equivalent trouble. He needs you to track down any series of stages and designated spots utilizing all things considered 2000 phases, where the normal number of attempts over all stages is by and large k, for a player whose likelihood of beating each stage is actually 12.
Input
Each test contains at least one experiments. The principal line contains the number of experiments t (1≤t≤50).
Each experiment contains precisely one line. The line comprises of a solitary integer k (1≤k≤1018) — the normal number of attempts over all stages Gildong needs to set for a player whose likelihood of beating each stage is by and large 12.
Output
For each experiment, print −1 in case it's difficult to develop such a progression of stages and designated spots utilizing all things considered 2000 phases.
In any case, print two lines. The principal line ought to contain a solitary integer n (1≤n≤2000) – the number of stages. The subsequent line ought to contain n integers, where the I-th integer addresses whether the I-th stage has a designated spot. The I-th integer ought to be 0 if the I-th stage doesn't have a designated spot, and 1 if it has a designated spot. Note that the principal integer should be 1 as indicated by the portrayal.
Step by step
Solved in 4 steps with 1 images
