
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN: 9780133594140
Author: James Kurose, Keith Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Please fast in c++
![There are n cats in a line, labeled from 1 to n, with the i-th cat at position i. They are bored of gyrating in the same spot all day, so they
want to reorder themselves such that no cat is in the same place as before. They are also lazy, so they want to minimize the total distance
they move. Help them decide what cat should be at each location after the reordering.
For example, if there are 3 cats, this is a valid reordering: [3, 1, 2]. No cat is in its original position. The total distance the cats move is
1+1+2= 4 as cat 1 moves one place to the right, cat 2 moves one place to the right, and cat 3 moves two places to the left.
Input
The first line contains a single integer t (1 <t< 100) – the number of test cases. Then t test cases follow.
The first and only line of each test case contains one integer n (2 < n < 100) – the number of cats.
It can be proven that under the constraints of the problem, an answer always exist.
Output
Output t answers, one for each test case. Each answer consists of n integers –a permutation with the minimum total distance. If there are
multiple answers, print any.
Example
input
Copy
2
2
3
output
Copy
2 1
3 1 2
Note
For the first test case, there is only one possible permutation that satisfies the conditions: [2, 1]
The second test case was described in the statement. Another possible answer is 2, 3, 1].](https://content.bartleby.com/qna-images/question/97bf5485-b1f5-4920-b5a8-bbe3b73345c5/24c137f3-067a-47ea-83d8-f02068a79800/1zwli3w_thumbnail.png)
Transcribed Image Text:There are n cats in a line, labeled from 1 to n, with the i-th cat at position i. They are bored of gyrating in the same spot all day, so they
want to reorder themselves such that no cat is in the same place as before. They are also lazy, so they want to minimize the total distance
they move. Help them decide what cat should be at each location after the reordering.
For example, if there are 3 cats, this is a valid reordering: [3, 1, 2]. No cat is in its original position. The total distance the cats move is
1+1+2= 4 as cat 1 moves one place to the right, cat 2 moves one place to the right, and cat 3 moves two places to the left.
Input
The first line contains a single integer t (1 <t< 100) – the number of test cases. Then t test cases follow.
The first and only line of each test case contains one integer n (2 < n < 100) – the number of cats.
It can be proven that under the constraints of the problem, an answer always exist.
Output
Output t answers, one for each test case. Each answer consists of n integers –a permutation with the minimum total distance. If there are
multiple answers, print any.
Example
input
Copy
2
2
3
output
Copy
2 1
3 1 2
Note
For the first test case, there is only one possible permutation that satisfies the conditions: [2, 1]
The second test case was described in the statement. Another possible answer is 2, 3, 1].
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution
Trending nowThis is a popular solution!
Step by stepSolved in 2 steps

Knowledge Booster
Similar questions
- In C++, there is a specialised kind of variable known as a pointer variable that you may utilise. Do you have a knowledge of how to put it to use in various situations?arrow_forwardWhat is the purpose of typing "namespace std" in the C++ code?arrow_forwardWhat are some common C++ string manipulation errors that can be encountered? How can these errors be resolved and/or limited?arrow_forward
- C++ Can a variable name be passed to a value parameter in C++ functions?arrow_forwardWhat are the different types of loop mechanisms in C++? What are the different ways to control loops?arrow_forwardDifferentiate between a Run Time Error and Syntax Error. Also give suitable examples of each in c++arrow_forward
- In C++arrow_forwardWrite aprogram in C++ that takes input the number 203212 and prints the number in reverse order. Built-in functions are not allowed. input : 203212arrow_forwardHi everyone I'm learning c++ but I don't understand pass-by-value and pass-by-reference. What is (const &)? Why do we have to pass const with & but not just &? please explain, thank you so much!arrow_forward
- How Do You Link A C++ Program To C Functions?arrow_forwardIn C++, there is a specialized kind of variable known as a pointer variable that you may utilize. Do you have a knowledge of how to put it to use in various situations?arrow_forwardHi, I am having difficulty finding words to better explain these questions for my homework. 1. What is a reference in C++? 2. What is a pointer in C++? 3. What is the difference between a pointer and a reference in C++?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Computer Networking: A Top-Down Approach (7th Edi...Computer EngineeringISBN:9780133594140Author:James Kurose, Keith RossPublisher:PEARSONComputer Organization and Design MIPS Edition, Fi...Computer EngineeringISBN:9780124077263Author:David A. Patterson, John L. HennessyPublisher:Elsevier ScienceNetwork+ Guide to Networks (MindTap Course List)Computer EngineeringISBN:9781337569330Author:Jill West, Tamara Dean, Jean AndrewsPublisher:Cengage Learning
- Concepts of Database ManagementComputer EngineeringISBN:9781337093422Author:Joy L. Starks, Philip J. Pratt, Mary Z. LastPublisher:Cengage LearningPrelude to ProgrammingComputer EngineeringISBN:9780133750423Author:VENIT, StewartPublisher:Pearson EducationSc Business Data Communications and Networking, T...Computer EngineeringISBN:9781119368830Author:FITZGERALDPublisher:WILEY

Computer Networking: A Top-Down Approach (7th Edi...
Computer Engineering
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:PEARSON

Computer Organization and Design MIPS Edition, Fi...
Computer Engineering
ISBN:9780124077263
Author:David A. Patterson, John L. Hennessy
Publisher:Elsevier Science

Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:9781337569330
Author:Jill West, Tamara Dean, Jean Andrews
Publisher:Cengage Learning

Concepts of Database Management
Computer Engineering
ISBN:9781337093422
Author:Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:Cengage Learning

Prelude to Programming
Computer Engineering
ISBN:9780133750423
Author:VENIT, Stewart
Publisher:Pearson Education

Sc Business Data Communications and Networking, T...
Computer Engineering
ISBN:9781119368830
Author:FITZGERALD
Publisher:WILEY