i dont know how to do this but, i need some thing (calculator) where the user types in the whole problem in cluding operators and the program calculates the thing and the problem can be any amount long... is this possible?
help me out if it is please.
Why don't you write a program which calls a function that converts your infix expression to postfix notation and then pass this postfix version of your expression to a function which evaluates it and gives result. You can check any good Data Structure book for both these tasks. Both these functions will you use stack, so check the stack chapter in the book, if infix-postfix type separate chapter is not included in the book.
Your expression will be input using a string, for a beginner its a tough task but you will learn a lot of things while reading all this.
You need to write a simple parser along with the grammar that will interpret the user's input. I had to write something very similar. (a calculator) I recommend Stroustrup's Principles of programming. It is a great text book and that particular problem is covered in detail. I warn you though, writing a parser/grammar/tokenizer is not very simple. If you have never seen this concept it will take you a while to swallow it.