Assignments | Class Photo | Computing Resources | Course Home | Lab Hours/Tutoring | Schedule | Submit

Saint Louis University

Computer Science 180
Data Structures

Michael Goldwasser

Spring 2009

Dept. of Math & Computer Science


Lab Assignment 01

Topic: Copier Reduction
Source Code: copier.cpp
Live Archive Ref#: 3393

In-Class Day:

Tuesday, 20 January 2009
Submission Deadline: Friday, 23 January 2009, 11:59pm

Techniques:

Loops, Conditionals, Arithmetic, and perhaps a utility function

Please review the general information about lab assignments.


Copier Reduction

What do you do if you need to copy a 560x400mm image onto a standard sheet of US letter-size paper (which is about 216x280mm), while keeping the image as large as possible? You can rotate the image 90 degrees (so that it is in "landscape" mode), then reduce it to 50% of its original size so that it is 200x280mm. Then it will fit on the paper without overlapping any edges. Your job is to solve this problem in general.

Input: The input consists of one or more test cases, each of which is a single line containing four positive integers A, B, C, and D, separated by a space, representing an AxBmm image and a CxDmm piece of paper. All inputs will be less than one thousand. Following the test cases is a line containing four zeros that signals the end of the input.

Output: For each test case, if the image fits on the sheet of paper without changing its size (but rotating it if necessary), then the output is 100%. If the image must be reduced in order to fit, the output is the largest integer percentage of its original size that will fit (rotating it if necessary). Output the percentage exactly as shown in the examples below. You can assume that no image will need to be reduced to less than 1% of its original size, so the answer will always be an integer percentage between 1% and 100%, inclusive.

Example input: Example output:
560 400 218 280
10 25 88 10
8 13 5 1
9 13 10 6
199 333 40 2
75 90 218 280
999 99 1 10
0 0 0 0
50%
100%
12%
66%
1%
100%
1%

Hints

This is a straightforward problem. You need an outer while loop because a single execution of the program must solve multiple trials (one per line). For a specific trial, solve the problem for the original orientation and for the rotated orientation and output the better of the two. You will need a conditional or two to determine the limiting dimensions.

If you want to save yourself a bit of trouble, write a utility function to compute the proper percentage for a fixed orientation. Then you can call that function twice, inverting the parameters for the rotated case.

The most common mistakes resulted from ignoring details in the problem specifications. Most importantly

For the record, during the actual competition, the first team in our region to complete this problem had it done 8 minutes into the day.


Michael Goldwasser
CSCI 180, Spring 2009
Last modified: Thursday, 15 January 2009
Assignments | Class Photo | Computing Resources | Course Home | Lab Hours/Tutoring | Schedule | Submit