Transport Tycoon was made by a single person (and an artist who did the graphics). A very sophisticated game written in pure assembly. It's one of my all-time favourites. Back in high school I could...
Type: Posts; User: balazsbotond
Transport Tycoon was made by a single person (and an artist who did the graphics). A very sophisticated game written in pure assembly. It's one of my all-time favourites. Back in high school I could...
Finally my little program is running without errors. Thank you for all the advice, you guys are really helpful. I'm uploading the code, so if you have time, please have a look at it. I would welcome...
Elysia,
Thanks for your reply.
I searched Wikipedia for tree traversal and found my algorithm there. I think what you are (and Perspective has been) suggesting is a level order traversal, but it...
Oh thanks. I'm a bit tired (it's 6am here - I think I'm getting addicted to programming :) ).
Perspective, thanks for your advice, it helped a lot.
I'm trying to do a preorder traversal on my tree and write a bool value and the node text into the file in the order of the traversal. It...
I've made an implementation of this program using a binary tree. It works fine, but I'd like to save my decision tree to the disk because I don't want to lose the result of my "teaching". Do I have...
Operating system: 32-bit Windows
Compiler: Dev-C++ & mingw
Graphics Library: none
Other Libraries:
Description: Hangman
I have made a simple hangman game - my first program, not counting...
MacGyver,
I'm trying to make a (very simple) GUI for one of my existing programs, and if I find it too hard, I'll stick with the console of course. And thanks for your advice :)
Thx, this worked. :)
What a dumb idiot I am. Including windows.h solved it.
But YET it throws another syntax error at the line with GROUPBOX. Really sorry for these stupid questions, I'm quite new to programming.
I know this is lame, but I've spent the whole night searching for an answer, and found nothing (maybe the problem's with me?...).
Okay, so here it is:
IDD_ABOUT DIALOG DISCARDABLE 0, 0, 239,...
Thanks!
struct Node;
typedef Node *Node_ptr;
struct Node {
char word[MAX_WORD_LENGTH];
Node_ptr ptr_to_next_node;
};
void delete_node(Node_ptr &a_list, char a_word[]);
Thank you, guys, this worked.
Hi,
1. if you easily get annoyed at stupid questions, don't read on :)
2. I'm using dev-c++ + mingw. I was trying to keep the windows of my console apps open using cin.get(); but in most of the...
And I can simplify it even more because n choose k equals n choose n-k, so eg. 100 choose 97 = 100 choose 3.
I know, but it still radically reduces the bits I need to do the calculation.
Rashakil Fol,
thanks. That's a really cool solution.
Thanks to the others too!
Ok, this was really lame. Product should be unsigned long int too. I've done that but it still doesn't work.
Hi all,
I'm quite new to programming, and trying to write a c++ program that calculates the binomial coefficient of two numbers. This can be used for calculating the probability of, for example,...