Restore Sequence codechef  november  long challenge  problem solution -

Restore Sequence codechef  november  long challenge  problem solution  lets read problem statement.

Alice has a very complex machine ― when fed with a sequence ${A}_{1},{A}_{2},\dots ,{A}_{N}$, it produces a sequence ${B}_{1},{B}_{2},\dots ,{B}_{N}$, where for each valid $i$${B}_{i}$ is the largest index $j$ such that ${A}_{i}$ divides ${A}_{j}$ (since ${A}_{i}$ divides itself, such an index always exist). For example, if the machine is fed with $A=\left[2,6,5,3,4\right]$, it produces $B=\left[5,2,3,4,5\right]$.

Alice gave you a sequence $B$ that was produced by the machine. Find an integer sequence $A$ such that when it is fed into the machine, then the machine produces the sequence $B$. Alice does not like huge integers, so make sure that $1\le {A}_{i}\le 4\cdot {10}^{6}$ holds for each valid $i$.

Input

• The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows.
• The first line of each test case contains a single integer $N$.
• The second line contains $N$ space-separated integers ${B}_{1},{B}_{2},\dots ,{B}_{N}$.

Output

For each test case, print a single line containing $N$ space-separated integers ${A}_{1},{A}_{2},\dots ,{A}_{N}$. For each valid $i$$1\le {A}_{i}\le 4\cdot {10}^{6}$ should hold.

If there are multiple solutions, you may print any of them. It is guaranteed that at least one solution exists.

Constraints

• $1\le T\le 2\cdot {10}^{4}$
• $1\le N\le {10}^{5}$
• $1\le {B}_{i}\le N$ for each valid $i$
• the sum of $N$ over all test cases does not exceed $2\cdot {10}^{5}$

Subtask #1 (20 points): ${B}_{1},{B}_{2},\dots ,{B}_{N}$ are pairwise distinct

Subtask #2 (80 points): original constraints

Example Input

2
5
5 2 3 4 5
4
4 4 4 4


Example Output

2 6 5 3 4
2 6 3 12

link-https://www.codechef.com/NOV20B/problems/RESTORE

Restore Sequence codechef Solution -

read also -https://www.technicalkeeda.in/2020/11/magical-candy-problem-solution-codechef.html

Logic-
It's necessary that b[i]>=i
let's assume my final ans is 2*n,2n-1,2n-2,2n-3...........n+1
I choose this initial sequence because ith element of this sequence cannot divide any other incoming element of this sequence.
store this sequence into a final answer vector
Now you have to change this sequence in such a way it can produce given B.
Now start iterating given array B.
Now change final ans like this
int k=v[i];
if(v1[i]>v1[k-1]){
v1[k-1]=v1[i];
}
else{
v1[i]=v1[k-1];
}

Finally, print ans vector.
Follow the code below.
Note-
This question can be done by another approach.

Must Join Telegram channel for Editorial -

My code-

Vaccine Distribution Codechef December Long challenge solution 2020

Vaccine Distribution  Codechef December Long challenge solution 2020- This Problem vaccine distribution is taken from December long challenge 2020. lets read problem statement. Problem statement- Finally, a COVID vaccine is out on the market and the Chefland government has asked you to form a plan to distribute it to the public as soon as possible. There are a total of  N N  people with ages  a 1 , a 2 , … , a N a 1 , a 2 , … , a N . There is only one hospital where vaccination is done and it is only possible to vaccinate up to  D D  people per day. Anyone whose age is  ≥ 80 ≥ 80  or  ≤ 9 ≤ 9  is considered to be  at risk . On each day, you may not vaccinate both a person who is at risk and a person who is not at risk. Find the smallest number of days needed to vaccinate everyone. Input The first line of the input contains a single integer  T T  denoting the number of test cases. The description of  T T  test cases follows. The first line of each test case contains two space-separ

Codechef February long challenge solution 2021

Codechef February  long challenge solution 2021- Hey guys Welcome Again, A small update CodeChef February  long challenge solution 2021 starting from 1st week of beb  2021 . Codechef long challenge is one of the popular contests of CodeChef you should participate in codechef Feb  long challenge.This is first contest of codechef in 2021 so good luck. And wish you happy new year. Contest link- https://www.codechef.com/FEB21/?itm_medium=navmenu&itm_campaign=FEB21 I will post the solution after Contest.Stay tuned. About CodeChef  February  long challenge solution 2021: CodeChef Long Challenge is a 10-day monthly coding contest where you can show off your computer programming skills. The significance being - it gives you enough time to think about a problem, try different ways of attacking the problem, read the concepts etc. If you’re usually slow at solving problems and have ample time at hand, this is ideal for you. We also put in a lot of efforts in getting quality problems, w

Merge Two sorted array Without Extra Space

Problem statement-  Given two sorted arrays arr1[] and arr2[] of sizes N and M in non-decreasing order. Merge them in sorted order without using any extra space. Modify arr1 so that it contains the first N elements and modify arr2 so that it contains the last M elements.    Example 1: Input:  N = 4, arr1[] = [1 3 5 7]  M = 5, arr2[] = [0 2 6 8 9] Output:  arr1[] = [0 1 2 3] arr2[] = [5 6 7 8 9] Explanation: After merging the two  non-decreasing arrays, we get,  0 1 2 3 5 6 7 8 9.   Example 2: Input:  N = 2, arr1[] = [10, 12]  M = 3, arr2[] = [5 18 20] Output:  arr1[] = [5 10] arr2[] = [12 18 20] Explanation: After merging two sorted arrays  we get 5 10 12 18 20. Your Task: You don't need to read input or print anything. You only need to complete the function merge() that takes arr1, arr2, N and M as input parameters and modifies them in-place so that they look like the sorted merged array when concatenated. Expected Time Complexity:  O((n+m) log(n+m)) Expected Auxilliary Space: O(1