Project 1: How to Make One Dollar

Transcription

1 Project Objective: Project 1: How to Make One Dollar Posted: Wednesday February 16, Described: Thursday February 17, Due: 11:59PM, Sunday March 6, get familiar with the process of completing a programming project. 2. learn the basics of printf( ) and scanf(). 3. declare and use of variables of the basic data types. 4. use basic relational and logical operators. 5. use basic if and/or if-else statements for program selection. 6. use array and basic loops (while, do-while, for) for repetition. 7. command line argument 8. read from and write into a file Project Description: In this project, you will design and implement an algorithm (method) to make one dollar from a given set of coins including quarters, dimes, nickels, and pennies. For example, if you have five quarters, five dimes, five nickels, and five pennies ( in short), one possible combination to make one dollar is to use one quarter, five dimes, four nickels, and five pennies ( in short) and are two other possible combinations is not a solution as it makes $ makes one dollar but it is not a solution either because you have only five dimes. Your program should read in the number of coins from an input file, determine all the possible ways to make one dollar by using only these coins, and write them into an output file in a tabular format. Your program should also find the way to make one dollar with the minimum number of coins and write it both to the output file and to the monitor. A master program, in the format of executable file, and a sample input file will be provided. Input Your program will read in input from a file of multiple lines. Each line consists of exactly four numbers representing the numbers of quarters, dimes, nickel, and pennies, respectively. These four numbers are separated by a single white space. For example, is a file that has three sets of coins. The first set has one quarter, two dimes, three nickels, and four pennies; the second set has one quarter, two dimes, four nickels, and four pennies; and the last set has five of each.

2 Output This project requires you write your output both to an output file and to the monitor. For each line of the input file, your program should write the following into an output file 1. the first line is a header line in the format of *************************Line ##************************* where ## represents the line number, starting from 1, of the input file. - Give two spaces for this field to allow your program to handle up to 99 lines of input. - Make the ## right aligned. - There are 25 stars (*)to each side of the phrase Line ##. - There is one space between the word Line and the line number ##. However, you will see two spaces when the line number ## is a single digit. 2. the second line is a description on the given coin set We have x quarters, y dimes, z nickels, and w pennies. where x, y, z, and w should be replaced by the numbers that you read in from the input file. - Use exactly one white space to separate the words. - Make sure that you use quarters (dimes, nickels, pennies) when there are 2 or more coins of that kind and use quarter (dime, nickel, penny) otherwise. 3. the third line is the header of the tabular output for all the ways to make one dollar index Q D N P Total These words are separated by three white spaces, except P and Total which are separated by five white spaces. 4. the next will be the actual ways to make one dollar, for example The first number represents the index and starts from 1. - The next four numbers represent the number of each coin. - The last number is the total number of coins used in this solution. - All the numbers are right aligned with the last letter of their corresponding words in the header of the table (index Q D N P Total).

3 5. the last two lines print out the total number of solutions and the best combination in the following format There are k different ways to make one dollar. Best solution: x quarters and y dimes and z nickels and w pennies and a total of v coins. where v = x+y+z+w. - k should be the same as the largest index in the above table. When k=1, print out There is 1 way to make one dollar. Best solution: x quarters and y dimes and z nickels and w pennies and a total of v coins. - Print out the word quarters (dimes, nickels, pennies) only if x (y, z, w) is greater than or equal to 1. For example, in the last solution give above, print out - Use quarter (dime, nickel, penny) instead if x (y,z,w) equals if you cannot make one dollar from the given set of coins, replace the items 3-5 by the following sentence In addition, print out the above items 1, 2, 5 (or 6, depending on the program output) onto the computer monitor. For example, give the above sample input file, you should write to an output file *************************Line 1************************* We have 1 quarter, 2 dimes, 3 nickels, and 4 pennies. *************************Line 2************************* We have 1 quarter, 2 dimes, 4 nickels, and 4 pennies. *************************Line 3************************* We have 5 quarters, 5 dimes, 5 nickels, and 5 pennies. index Q D N P Total

4 There are 15 different ways to make one dollar. Meanwhile, print out the following to the computer monitor *************************Line 1************************* We have 1 quarter, 2 dimes, 3 nickels, and 4 pennies. *************************Line 2************************* We have 1 quarter, 2 dimes, 4 nickels, and 4 pennies. *************************Line 3************************* We have 5 quarters, 5 dimes, 5 nickels, and 5 pennies. There are 15 different ways to make one dollar. Project Requirements: 1. You must program using C under GLUE UNIX system and name your program p1.c. 2. Your program must be properly documented. 3. Submit your program p1.c electronically before the due time. How to do this will be discussed in the recitation sections. 4. IMPORTANT: Your program s output, both to the output file and to the computer monitor, should be exactly the same as that produced by the master program. The only exception is that in the tabular output of all the combinations to make one dollar, the order of those combinations can be different from the master program. Grading Criteria: Correctness: 80% Good coding style: 10% Proper documentation: 10% Late submission penalty: -40% for the first 24 hours No submission will be accepted after the first 24 hours.

5 Project Template: (only for your reference, you do not have to use this) // document your project and write down your name, student ID, // section No. here #include <stdio.h> // define constants and functions if you are using them int main(int argc, char *argv[]) { // declare the input and output files FILE* input, *output; // declare other variables // some safety check if(argc!=3) { printf("usage: exectuable inputfile outputfile\n"); exit(0); // open the input and output files with more safety check input = fopen(argv[1],"r"); if( input == NULL) { printf("file %s cannot open!\n", argv[1]); output = fopen(argv[2], "w"); if( output == NULL) { printf("file %s cannot open!\n", argv[2]); // write your code here // close the input and output files fclose(input); fclose(ouput); return 0;