Problem 20.cpp

#include<iostream>
#include<cmath>
#include <cstdlib>

using namespace std;

void multiply(int base);

#define ARRAYSIZE 2048

short product [ARRAYSIZE];
const int productLength = ARRAYSIZE;

int main(){
	long exponet = 1000;
    long base = 2;
	cout << "Enter a positive Base as an integer to factorilize: ";
	cin >> base;
	product[0] = 1;
	for(int i = 1; i <= base; i++){
		multiply(i);
		for (int pos = 0; pos < productLength; pos++){//goes through digits
			for (double y = 0; product[pos] >= pow(10, y); y++){//Carrys digits accordingly
		    	if (y != 0){
              		int YInt = y;
		       		product[pos + YInt] += floor(product [pos] / pow(10, y));
		       		product[pos] -= floor(product [pos] / pow(10, y)) * 10;
           }
		}
	}
}
	for (int x = productLength - 1; x >= 0 ; x--){
		cout << product[x] << " ";
	}
	cout << endl << endl;
	long long tempSum = 0;
	for (int x = 0; x < ARRAYSIZE; x++){
        tempSum += product[x];
	}
	cout << tempSum << endl;
	system("PAUSE");
}

void multiply(int base){
	for (int x = productLength - 1; x >= 0 ; x--){
		product[x] *= base;
	}
}