Thread: Heeeeeelp!!!! :)

  1. #1
    Registered User
    Join Date
    Oct 2002

    Heeeeeelp!!!! :)

    hi again, i know im not supposed to ask for code, but in this case i really need it i have been working on the towers of hanoi problem for a week now, and i have hit a huge road block, if those of you who know this problem and know how to solve it i would greatly appreciate it if someone could furnish me a script thankyou so much for your time!

  2. #2
    Just because ygfperson's Avatar
    Join Date
    Jan 2002
    it doesn't work that way here. use for homework solutions. here you provide code and ask for suggestions or critisism.

  3. #3
    Code Goddess Prelude's Avatar
    Join Date
    Sep 2001
    >if those of you who know this problem
    Everyone knows this problem, it is a common homework question.

    >and know how to solve it
    Those of us that did our homework certainly know how to solve it.

    >i would greatly appreciate it if someone could furnish me a script
    You were doing okay up to this point. Allow me to be perfectly frank. We don't do homework, that's your job and if we did it for you we would only be hurting you. If you want to cheat, go elsewhere to find your code. If you want us to help you with your algorithm so that you can eventually solve the problem, we would be happy to.

    My best code is written with the delete key.

  4. #4
    Guest Sebastiani's Avatar
    Join Date
    Aug 2001
    Waterloo, Texas
    Hey, watch it, buddy! I'm a vietnam vet. You just take your "towers of hanoi" commie crap somewhere else!
    #include <cmath>
    #include <complex>
    bool euler_flip(bool value)
        return std::pow
            std::complex<float>(0, 1) 
            * std::complex<float>(std::atan(1.0)
            *(1 << (value + 2)))
        ).real() < 0;

Popular pages Recent additions subscribe to a feed

Similar Threads

  1. getting 2 largest nos with while loop
    By Unregistered in forum C++ Programming
    Replies: 8
    Last Post: 12-21-2001, 05:29 PM