-----------------------------------

A.J

Fri Oct 31, 2008 6:54 pm


Halloween Questions!!!

-----------------------------------

danielg and I made some halloween questions for the computer science club at our school

there are 3 problems that we made (easy, medium and hard)

sry if the font is bad, depending on what version of Microsoft Word u have.

Please give me and danielg your feedback!!!!


-----------------------------------

A.J

Fri Oct 31, 2008 6:58 pm


Re: Halloween Questions!!!

-----------------------------------

There is a small correction I want to make.

The sample output for the "easy" question should be 6, not 5.


-----------------------------------

chili5

Sat Nov 01, 2008 7:52 pm


RE:Halloween Questions!!!

-----------------------------------

Interesting, the first one is simple. I'll program that one in the morning. 

The other two are going to be a challenge for me. That'll be something fun in the morning. :D


-----------------------------------

Unforgiven

Sun Nov 02, 2008 12:58 pm


Re: Halloween Questions!!!

-----------------------------------

sry if the font is bad, depending on what version of Microsoft Word u have.

This is exactly why you shouldn't use a word processor (especially MS Word) for something that essentially is just text. ASCII/UTF-8/etc works just fine, and you wouldn't even have to attach a file. Just copy and paste it here.

I don't mean to be a jerk, it's just a huge pet peeve.


-----------------------------------

A.J

Sun Nov 02, 2008 1:04 pm


Re: Halloween Questions!!!

-----------------------------------

no probs Unforgiven

thanks for telling me

next time on, I'll make sure to make it better!


-----------------------------------

A.J

Sun Nov 02, 2008 10:07 pm


Re: Halloween Questions!!!

-----------------------------------

just to clarify the hard question (trick or treat):
In trick or treat, u can visit a house more than once (i.e. you can go back and forth from and to a point more than once, as long as you don't stay at the same place and keep moving)
It is asking u to find the number of routes from 'W' to 'P' so that u r not late to the party (so u r given that u have to reach 'P' in the 'm' minutes. But since each 'step' takes 2 min and since u have to trick or treat all the way, in essence the question is asking for u to                    find the # of paths from 'W' to 'P' in a m/2 steps.