April 27, 2015----An array of tall, binary, up to 35 binary

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int main (int argc, char *argv[])
{
/* Decimal Quasi-change the city any binary program */

int ival, base; Ival is the decimal number, base is the binary to be converted
int index = 0;
Char arr[32];
memset (arr, 0, sizeof (arr));
printf ("Input the Ival and base:");
scanf ("%d%d", &ival, &base);
while (ival! = 0) {
/* The following sentence is the value of the modulo to the corresponding deposit in the array, such as 10 corresponds to the a*/
arr[index]= "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ" [ival%base];
index++;
Ival = Ival/base;
}
Do not print the previous 0
for (index=index-1;index>=0;index--) {
printf ("%c", Arr[index]);
}
printf ("\ n");
System ("pause");
return 0;
}

April 27, 2015----An array of tall, binary, up to 35 binary