given an exhibit [a1,a2,… ,an] to such an extent that 1≤ai≤109. Leave S alone the amount of all components of the exhibit a. How about we call an exhibit b of n integers wonderful if: 1≤bi≤109 for every I from 1 to n; for each pair of contiguous integers from the cluster (bi,bi+1),
Correct answer will be upvoted else Multiple Downvoted. Computer science.
You are given an exhibit [a1,a2,… ,an] to such an extent that 1≤
How about we call an exhibit b of n integers wonderful if:
1≤bi≤109 for every I from 1 to n;
for each pair of contiguous integers from the cluster (bi,bi+1), either bi partitions bi+1, or bi+1 isolates bi (or both);
2∑i=1n|ai−bi|≤S.
Your assignment is to track down any excellent exhibit. It tends to be shown that something like one delightful exhibit consistently exists.
Input
The main line contains one integer t (1≤t≤1000) — the number of experiments.
Each experiment comprises of two lines. The main line contains one integer n (2≤n≤50).
The subsequent line contains n integers a1,a2,… ,an (1≤ai≤109).
Output
For each experiment, print the wonderful exhibit b1,b2,… ,bn (1≤bi≤109) on a different line. It very well may be shown that no less than one lovely exhibit exists under these conditions. In case there are numerous replies, print any of them.
Step by step
Solved in 4 steps with 1 images
