Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Q4: Colouring Book IHaving spent the last couple of hours grading assigaments, I decide it's time for a break. I take out my favourite colouring book, turn to a random page I haven't coloured in yet, and lay it on my desk. I then take out all my nerayons and line them up on the desk (it's a very long desk). The colour of the erayon is a string e1 (eg. "Blua"). Many of the erayons have the same colour. Ia fact, no matter how many erayons I have, there are at most 30 distinet colours amongst them. To start colouring,I always take a sublist (see Qi for a definition) of the crayons laid on the desk and put away the rest (too many options can be overwhelming and can lead to indecision). I take a look at the line art in front of me and wonder, "Ilow many different colours do I need to make this look great? One? Two? Maybe three?". Now you understand my dilemma and are fully aware of my indecision. You kindly decide to help me out by telling me for every mumber k, if I were to use k distinet colours, what would be the minimum number of erayons l'd need to take? Filename Your filename for this question must be ot.oy Input The input consists of a single line containing n space-separated names of colours specifying the list e Output Let m be the number of distinet eolours in e Then, output n space separated integers. The of them (s-based) should be the minimum number of erayons l'd need to take so that there are at least k distinet colours amongst them. Constraints 1s tencet11) s • There are at most 3o distinet colours in e Time Limit • Your program has to finish running within 4 seceonds on any valid inpu Sample Input 1 areen res res alua res res grean Sample Output 1 124

Q4: Colouring Book IHaving spent the last couple of hours grading assigaments, I decide it's time for a break. I take out my favourite colouring book, turn to a random page I haven't coloured in yet, and lay it on my desk. I then take out all my nerayons and line them up on the desk (it's a very long desk). The colour of the erayon is a string e1 (eg. "Blua"). Many of the erayons have the same colour. Ia fact, no matter how many erayons I have, there are at most 30 distinet colours amongst them. To start colouring,I always take a sublist (see Qi for a definition) of the crayons laid on the desk and put away the rest (too many options can be overwhelming and can lead to indecision). I take a look at the line art in front of me and wonder, "Ilow many different colours do I need to make this look great? One? Two? Maybe three?". Now you understand my dilemma and are fully aware of my indecision. You kindly decide to help me out by telling me for every mumber k, if I were to use k distinet colours, what would be the minimum number of erayons l'd need to take? Filename Your filename for this question must be ot.oy Input The input consists of a single line containing n space-separated names of colours specifying the list e Output Let m be the number of distinet eolours in e Then, output n space separated integers. The of them (s-based) should be the minimum number of erayons l'd need to take so that there are at least k distinet colours amongst them. Constraints 1s tencet11) s • There are at most 3o distinet colours in e Time Limit • Your program has to finish running within 4 seceonds on any valid inpu Sample Input 1 areen res res alua res res grean Sample Output 1 124

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
Q4: Colouring Book IHaving spent the last couple of hours grading assignments, I decide it's time for a break. I take out my favourite colouring book, turn to a random page I haven't coloured in yet, and lay it on my desk. I then take out all my n crayons and line them up on the desk (it's a very long desk). The colour of the " erayon is a string c11 (eg. "alue"). Many of the crayons have the same colour. In fact, no matter how many crayons I have, there are at most 30 distinct colours amongst them. To start colouring, I always take a sublist (see Qi for a definition) of the crayons laid on the desk and put away the rest (too many options can be overwhelming and can lead to indecision). I take a look at the line art in front of me and wonder, "Ilow many different colours do I need to make this lonk great? One? Two? Mayhe three?". Now you understand my dilemma and are fully aware of my indecision. You kindly decide to help me out by telling me for every number k, if I were to use k distinet colours, what would be the minimum number of crayons l'd need to take? Filename Your filename for this question must be q4.oy. Input The input consists of a single line containing n space-separated names of colours specifying the list e. Output Let m he the number of distinct eolours in e. Then, output e space-separated integers. The k of them (1-based) should he the minimum number of crayons I'd need to take so that there are at least k distinet colours amongst them. Constraints • Isns5K 104 • 1s 1ancet11) 5 • There are at most 30 distinet colours in e Time Limit Your program has to finish running within 4 seconds on any valid input. Sample Input 1 green red red blue red red green Sample Output 1 124
Transcribed Image Text:Q4: Colouring Book IHaving spent the last couple of hours grading assignments, I decide it's time for a break. I take out my favourite colouring book, turn to a random page I haven't coloured in yet, and lay it on my desk. I then take out all my n crayons and line them up on the desk (it's a very long desk). The colour of the " erayon is a string c11 (eg. "alue"). Many of the crayons have the same colour. In fact, no matter how many crayons I have, there are at most 30 distinct colours amongst them. To start colouring, I always take a sublist (see Qi for a definition) of the crayons laid on the desk and put away the rest (too many options can be overwhelming and can lead to indecision). I take a look at the line art in front of me and wonder, "Ilow many different colours do I need to make this lonk great? One? Two? Mayhe three?". Now you understand my dilemma and are fully aware of my indecision. You kindly decide to help me out by telling me for every number k, if I were to use k distinet colours, what would be the minimum number of crayons l'd need to take? Filename Your filename for this question must be q4.oy. Input The input consists of a single line containing n space-separated names of colours specifying the list e. Output Let m he the number of distinct eolours in e. Then, output e space-separated integers. The k of them (1-based) should he the minimum number of crayons I'd need to take so that there are at least k distinet colours amongst them. Constraints • Isns5K 104 • 1s 1ancet11) 5 • There are at most 30 distinet colours in e Time Limit Your program has to finish running within 4 seconds on any valid input. Sample Input 1 green red red blue red red green Sample Output 1 124
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Similar questions
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