1. //Brian Goggins
//Cosc 281
//2/10/2015
#include <iostream>
#include <cmath>
using namespace std;
int base, decimal;
int number[9];
int digits;
int count;
int baseNumber[16];
int Convert2Decimal()
{
int x = 0;
for (int i = 0, count = digits; i < digits; i++, count--)
{
x += number[i] * pow(base, count-1);
}
return x;
}
int Decimal2Base(int dec)
{
for (int i = 15; dec>0; i--)
{
baseNumber[i] = dec % base;
dec /= base;
}
return 0;
}
void main()
{
int exit1 = 0;
int choice;
while (exit1 != 1)
{
cout << "Enter 1 or 2 >"; cin >> choice;
if (choice == 1)
{
cout << "Enter Base (2-9): "; cin >> base;
cout << "Enter # of Digits: "; cin >> digits;
for (int i = 0; i < digits; i++)
{
cin >> number[i];
}
int dec = Convert2Decimal();
cout << "Decimal: " << dec << endl;
}
else
{
cout << "Enter Decimal #: "; cin >> decimal;
cout << "Enter Base(2-9): "; cin >> base;
Decimal2Base(decimal);

2. cout << "Base " << base << ": ";
for (int i = 0; i < 16; i++)
{
cout << baseNumber[i];
}
for (int i = 0; i < 16; i++)
{
baseNumber[i]=0;
}
}
cout << "nEnter 1 to close: "; cin >> exit1;
}
}