This topic is for discussion of the computer science team's program given to us by Mrs. Rountree today (non CS members feel free to post too. ).
We can talk about what's going on and help each other out. That way we can ensure that our programs are all compiling and ready to go on Monday... :D
Intermediate Team Guidelines wrote:For this program, given the sequence, in one move remove all zeros, if any, and all the digits to their left. Then find the digit that appears most frequently. Use the rightmost occurrence of that digit, and if it is even subtract 2 from it or if it is odd subtract 1 from it. If two or more digits tie as the most frequent digit, then use the largest such digit. If all the digits appear just once, use the largest digit. Repeat the application of the rules to the sequence. How many moves were required to delete the sequence? Two examples are shown below:
I don't really feel like doing this in straight up DOS console C or C++... I want to do something alot 1337er. I was thinking probably Perl console application or if I wanted something really tight I could go for Dreamcast or SDL ...
).
