Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //Copyright vlladislav45
- #include "stdafx.h"
- #include <iostream>
- #include "FindingANaturalNumberInTheArray.h"
- using namespace std;
- const int arraySize = 11;
- short* numberArray = new short[arraySize];
- short counter = 0;
- int helper;
- void printArray(short index)
- {
- if (index < 0)
- return;
- cout << "a[" << index-helper << "]= " << numberArray[index] << endl;
- helper -= 2;
- printArray(--index);
- }
- void division(int number, int br)
- {
- if(number == 0)
- {
- return;
- }
- int lastDigit = number % 10;
- numberArray[br] = lastDigit;
- int numberWithoutLastDigit = number / 10;
- counter++;
- division(numberWithoutLastDigit, ++br);
- }
- int main()
- {
- int br = 0;
- int number;
- while (true)
- {
- cout << "vavedi estestveno chislo " << "\n";
- cin >> number;
- if (number <= 0)
- {
- cout << "Vavedete drugo chislo , s nula nqma da ti dam " << "\n";
- }
- else
- break; // ako chisloto e po - golqmo ot nula da izleze ot cikyla
- }
- division(number, br);
- helper = counter-1;
- printArray(counter-1);
- system("pause");
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement