Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Input Th first line contains one integer t (1 < t < 1000) – the number of test cases. The only line of each test case contains one integer n (1 < n < 1000) – the number of windows in the building. Output For each test case, if a building with the new layout and the given number of windows just can't exist, print –1. Otherwise, print three non-negative integers – the possible number of three-room, five-room, and seven-room apartments. If there are multiple answers, print any of them.

Input Th first line contains one integer t (1 < t < 1000) – the number of test cases. The only line of each test case contains one integer n (1 < n < 1000) – the number of windows in the building. Output For each test case, if a building with the new layout and the given number of windows just can't exist, print –1. Otherwise, print three non-negative integers – the possible number of three-room, five-room, and seven-room apartments. If there are multiple answers, print any of them.

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
100%

Give answer in python code,

and correct output.

In image i have given problem statement.

Input Th first line contains one integer t (1 <t < 1000) – the number of test cases. The only line of each test case contains one integer n (1 < n < 1000) – the number of windows in the building. Output For each test case, if a building with the new layout and the given number of windows just can't exist, print –1. Otherwise, print three non-negative integers – the possible number of three-room, five-room, and seven-room apartments. If there are multiple answers, print any of them.
Transcribed Image Text:Input Th first line contains one integer t (1 <t < 1000) – the number of test cases. The only line of each test case contains one integer n (1 < n < 1000) – the number of windows in the building. Output For each test case, if a building with the new layout and the given number of windows just can't exist, print –1. Otherwise, print three non-negative integers – the possible number of three-room, five-room, and seven-room apartments. If there are multiple answers, print any of them.
Recently a new building with a new layout was constructed in Monocarp's hometown. According to this new layout, the building consists of three types of apartments: three-room, five-room, and seven-room apartments. It's also known that each room of each apartment has exactly one window. In other words, a three-room apartment has three windows, a five-room – five windows, and a seven-room - seven windows. Monocarp went around the building and counted n windows. Now he is wondering, how many apartments of each type the building may have. Unfortunately, Monocarp only recently has learned to count, so he is asking you to help him to calculate the possible quantities of three-room, five-room, and seven- room apartments in the building that has n windows. If there are multiple answers, you can print any of them. Here are some examples: if Monocarp has counted 30 windows, there could have been 2 three-room apartments, 2 five-room apartments and 2 seven-room apartments, since 2·3 + 2.5+ 2.7 = 30; if Monocarp has counted 67 windows, there could have been 7 three-room apartments, 5 five-room apartments and 3 seven-room apartments, since 7.3+ 5. 5 + 3-7 = 67; if Monocarp has counted 4 windows, he should have mistaken since no building with the aforementioned layout can have 4 windows.
Transcribed Image Text:Recently a new building with a new layout was constructed in Monocarp's hometown. According to this new layout, the building consists of three types of apartments: three-room, five-room, and seven-room apartments. It's also known that each room of each apartment has exactly one window. In other words, a three-room apartment has three windows, a five-room – five windows, and a seven-room - seven windows. Monocarp went around the building and counted n windows. Now he is wondering, how many apartments of each type the building may have. Unfortunately, Monocarp only recently has learned to count, so he is asking you to help him to calculate the possible quantities of three-room, five-room, and seven- room apartments in the building that has n windows. If there are multiple answers, you can print any of them. Here are some examples: if Monocarp has counted 30 windows, there could have been 2 three-room apartments, 2 five-room apartments and 2 seven-room apartments, since 2·3 + 2.5+ 2.7 = 30; if Monocarp has counted 67 windows, there could have been 7 three-room apartments, 5 five-room apartments and 3 seven-room apartments, since 7.3+ 5. 5 + 3-7 = 67; if Monocarp has counted 4 windows, he should have mistaken since no building with the aforementioned layout can have 4 windows.
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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 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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS