//decimal to binary - dec up to 2147483647
/*
    Divide the number by 2
	Store the remainder when the number is divided by 2 in an array
	set the number equal to the quotient
    Repeat the above two steps while the number is greater than zero.
    Print the array in reverse order now.
*/
#include <iostream>
using namespace std;
 
int main()
{
    long int dec;
    cout << "Enter a decimal number: ";
    cin >> dec;
    int bindigits[32];// array for binary digits
    int k = 0;
    while (dec > 0) {
        // find and store remainder 
        bindigits[k] = dec % 2;
        dec = dec / 2;
        k++;
    }
 
    // print binary digits in reverse order
    for (int j = k - 1; j >= 0; j--)
        cout << bindigits[j];
    cout<<endl;
    
    system("PAUSE");
    return 0;  
}