Programming C, C++, Java, PHP, Ruby, Turing, VB
Computer Science Canada 
Programming C, C++, Java, PHP, Ruby, Turing, VB  

Username:   Password: 
 RegisterRegister   
 CCC 2000 Stage1: S2J4: Babbling Brooks
Index -> Contests
View previous topic Printable versionDownload TopicSubscribe to this topicPrivate MessagesRefresh page View next topic
Author Message
Tony




PostPosted: Sat Feb 08, 2003 2:44 pm   Post subject: CCC 2000 Stage1: S2J4: Babbling Brooks

Solution for 2nd Senior (4th Junior) problem from CCC 2000 writen in C++
---------------------------------------------------------------------------------
A series of streams run down the side of a mountain. The mountainside is very rocky so the streams split and rejoin many times. At the foot of the mountain, several streams emerge as rivers. Your job is to compute how much water flows in each river.

At any given elevation there are n streams, labelled 1 to n from left-to-right. As we proceed down the mountainside, one of the streams may split into a left fork and a right fork, increasing the total number of streams by 1, or two streams may rejoin, reducing the total number of streams by 1. After a split or a rejoining occurs, the streams are renumbered consecutively from left-to-right. There is always at least one stream and there are never more than 100 streams.

The first line of input contains n, the initial number of streams at some high altitude. The next n lines give the flow in each of the streams from left-to-right. Proceeding down the mountainside, several split or rejoin locations are encountered. For each split location, there will be three lines of input;

a line containing 99 (to indicate a split)
a line containing the number of the stream that is split
a line containing a number between 0 and 100, the percentage of flow from the split stream that flows to the left fork. (The rest flows to the right fork).

For each join location, there will be two lines of input;

a line containing 88 (to indicate a join)
a line containing the number of the stream that is rejoined with the stream to its right

The flow from both joined streams is combined. After the last split or join location will be:

a single line containing 77 (to indicate end of input)


Your job is to determine how many streams emerge at the foot of the mountain and what the flow is in each. Your output is a sequence of real numbers, rounded to the nearest integer, giving the flow in rivers 1 through n.

Sample Input (Input file : brooks.in)
3
10
20
30
99
1
50
88
3
88
2
77

Output for Sample Input (Output file : brooks.out)
5 55
----------------------------------------------------------------------------------

Notes:
The solution includes a DEBUG part that outputs the flow of the river to make sure that logic is correct. It is not required by the question.

Some things to watch out for - Need understanding of 1D array and how to add entries in the middle of it. Try not to write over the value you need later Wink

Also int() function cuts down decimal points, not rounds... so 5.9 will become 5. Something you need to watch out for if you program your solutions in C++ Smile

See file attached for solution



brooksin.txt
 Description:
Sample input file for S2J4
Rename to brooks.in to run

Download
 Filename:  brooksin.txt
 Filesize:  42 Bytes
 Downloaded:  429 Time(s)


source.cpp
 Description:
CCC 2000 Stage1: S2J4: Babbling Brooks

Download
 Filename:  source.cpp
 Filesize:  1.02 KB
 Downloaded:  358 Time(s)

Latest from compsci.ca/blog: Tony's programming blog. DWITE - a programming contest.
Sponsor
Sponsor
Sponsor
sponsor
Display posts from previous:   
   Index -> Contests
View previous topic Tell A FriendPrintable versionDownload TopicSubscribe to this topicPrivate MessagesRefresh page View next topic

Page 1 of 1  [ 1 Posts ]
Jump to:   


Style:  
Search: