please help please help!!!!!

This is a discussion on please help please help!!!!! within the C++ Programming forums, part of the General Programming Boards category; thats fair enough but 176/8 was just an examlpe...
this needs to work for any number stord in the array ...

this needs to work for any number stord in the array up to (2^512) and your method woudnt work for large numbers. Also the output has to be read into an array such that each digit is stored in a spearte array element.

What you need to do is figure out the math first, THEN worry about the C++.

Draw these arrays on paper. On paper, can you perform the operations? If not, this is a mathematics issue and not a C++ issue.

If you understand how, mathematically, to break these numbers up and perform the operations on them, but you are having difficulty with C++ syntax, that is what this board is for. Of course, we will try to help where we can with math, but issues that are entirely mathematics oriented should be directed elsewhere.

If I did your homework for you, then you might pass your class without learning how to write a program like this. Then you might graduate and get your degree without learning how to write a program like this. You might become a professional programmer without knowing how to write a program like this. Someday you might work on a project with me without knowing how to write a program like this. Then I would have to do you serious bodily harm. - Jack Klein

To get you kinda pointed in the right direction, think about some of the math.

To obtain an integer result from x / y = z, both x and y would have to share a common denominator. The least of which would be 2. Continue finding a common denominator until y == 1 and therefore x == z.

Now all you have to do is pseudo code out the process of long division to handle the arrays, and you're all set. Of course it's a brute force method which may not be the most efficient way to go about it, but it'll move you in the right direction, and you can probably manage to get a little experience in recursion as well.