二进制数加法的C语言程序,4位二进制加法 c语言程序如何编写 急用

4位二进制加法 c语言程序如何编写 急用

來源:互聯網  2009-06-07 03:35:42  評論

分類: 電腦/網絡 >> 程序設計 >> 其他編程語言

問題描述:

急用,谢谢

要求进位~~~

參考答案:

//...

//自己编译下试试。

//专门为你写的啊,如果可用一定要给分哦。

#include

#include

#define ERR printf

/*

char *myItoa (int n,const char * ch)

{

¡¡sprintf(ch,"%d",n);

¡¡return ch;

}

*/

/*

int binA2Dec(char * ch,int len)

{

int sum,i;

sum = 0;

for(i=len-1;i>=0;i--)

{

sum = sum*2 + (ch[i] - '0');

}

return sum;

}

*/

#define MAX_BIT 4 //可以定义任意位的加减。

int M_num(int base,int b)

{

int tmp;

int multi = 1;

for(tmp=b;tmp;tmp--)

multi = multi * base;

return multi;

}

typedef enum

{

false,

true

}bool;

bool checkBuf(char * ch)

{

int i,j;

if(ch[MAX_BIT] != 0)

{

i = MAX_BIT;

ERR("\nOnly %d bits need!!\n",i);

return false;

}

for(i=0;i

{

if((ch[i] != '0') && (ch[i] != '1') && (ch[i] != 0) )

{

ERR("\nInput binary data,you must reInput!\n");

return false;

}

if(ch[i] == 0)

{

for(j=i-1;j>=0;j--)

{

ch[j+1] = ch[j];

}

ch[0] = '0';

}

}

return true;

}

int bin2Dec(int num)

{

int sum,fig,tmp,numNext;

// Initialization.

numNext = num;

sum = 0;

tmp = 1;

for(;;)

{

fig = numNext%10; // Get lowest number

sum = sum + fig*tmp;

tmp = tmp * 2;

numNext = numNext/10;

if(!numNext)

return sum;

}

}

int dec2bin(int num)

{

int sum,fig,tmp,numNext;

//Initialization

numNext = num;

sum = 0;

tmp = 1;

for(;;)

{

fig = numNext%2; //get current parity digit.

sum = sum + fig*tmp; //sum of demical number add parity.

tmp = tmp*10;

numNext = numNext/2;

if(!numNext)

return sum;

}

}

int main(int argc, char *argv[])

{

char Num1[MAX_BIT+1],Num2[MAX_BIT+1],sum[MAX_BIT+1];

int Number1,Number2,sumNum;

int i;

//Initialize the arrry.

for(i =0;i

{

Num1[i]= Num2[i] = 0;

}

//Process to get input number

//And check the validity of input

printf("\nPlease input number1:\n");

scanf("%s",Num1);

if(!checkBuf(Num1))

{

system("PAUSE");

return 0;

}

printf("\nPlease input number2:\n");

scanf("%s",Num2);

if(!checkBuf(Num2))

{

system("PAUSE");

return 0;

}

// Get number from array.

Number1 = atoi(Num1);

Number2 = atoi(Num2);

// Convert binary data to demical data

Number1 = bin2Dec(Number1);

Number2 = bin2Dec(Number2);

// Sum of two number.

sumNum = Number1 + Number2;

// Convert from demical data to binary data.

sumNum = dec2bin(sumNum);

// Get char array

itoa(sumNum,sum,10);

// Output

if(sumNum >= M_num(10,MAX_BIT) )

{

sumNum=MAX_BIT;

printf("\nThe sum overflow %d bit ..",sumNum);

}

printf("\nthe sum is|%s|\n\n",sum);

system("PAUSE");

return 0;

}

[b]分类:[/b] 电脑/网络 >> 程序设计 >> 其他编程语言[br][b]问题描述:[/b][br]急用,谢谢

要求进位~~~[br][b]参考答案:[/b][br]//...

//自己编译下试试。

//专门为你写的啊,如果可用一定要给分哦。

#include

#include

#define ERR printf

/*

char *myItoa (int n,const char * ch)

{

¡¡sprintf(ch,"%d",n);

¡¡return ch;

}

*/

/*

int binA2Dec(char * ch,int len)

{

int sum,i;

sum = 0;

for(i=len-1;i>=0;i--)

{

sum = sum*2 + (ch[i] - '0');

}

return sum;

}

*/

#define MAX_BIT 4 //可以定义任意位的加减。

int M_num(int base,int b)

{

int tmp;

int multi = 1;

for(tmp=b;tmp;tmp--)

multi = multi * base;

return multi;

}

typedef enum

{

false,

true

}bool;

bool checkBuf(char * ch)

{

int i,j;

if(ch[MAX_BIT] != 0)

{

i = MAX_BIT;

ERR("\nOnly %d bits need!!\n",i);

return false;

}

for(i=0;i

{

if((ch[i] != '0') && (ch[i] != '1') && (ch[i] != 0) )

{

ERR("\nInput binary data,you must reInput!\n");

return false;

}

if(ch[i] == 0)

{

for(j=i-1;j>=0;j--)

{

ch[j+1] = ch[j];

}

ch[0] = '0';

}

}

return true;

}

int bin2Dec(int num)

{

int sum,fig,tmp,numNext;

// Initialization.

numNext = num;

sum = 0;

tmp = 1;

for(;;)

{

fig = numNext%10; // Get lowest number

sum = sum + fig*tmp;

tmp = tmp * 2;

numNext = numNext/10;

if(!numNext)

return sum;

}

}

int dec2bin(int num)

{

int sum,fig,tmp,numNext;

//Initialization

numNext = num;

sum = 0;

tmp = 1;

for(;;)

{

fig = numNext%2; //get current parity digit.

sum = sum + fig*tmp; //sum of demical number add parity.

tmp = tmp*10;

numNext = numNext/2;

if(!numNext)

return sum;

}

}

int main(int argc, char *argv[])

{

char Num1[MAX_BIT+1],Num2[MAX_BIT+1],sum[MAX_BIT+1];

int Number1,Number2,sumNum;

int i;

//Initialize the arrry.

for(i =0;i

{

Num1[i]= Num2[i] = 0;

}

//Process to get input number

//And check the validity of input

printf("\nPlease input number1:\n");

scanf("%s",Num1);

if(!checkBuf(Num1))

{

system("PAUSE");

return 0;

}

printf("\nPlease input number2:\n");

scanf("%s",Num2);

if(!checkBuf(Num2))

{

system("PAUSE");

return 0;

}

// Get number from array.

Number1 = atoi(Num1);

Number2 = atoi(Num2);

// Convert binary data to demical data

Number1 = bin2Dec(Number1);

Number2 = bin2Dec(Number2);

// Sum of two number.

sumNum = Number1 + Number2;

// Convert from demical data to binary data.

sumNum = dec2bin(sumNum);

// Get char array

itoa(sumNum,sum,10);

// Output

if(sumNum >= M_num(10,MAX_BIT) )

{

sumNum=MAX_BIT;

printf("\nThe sum overflow %d bit ..",sumNum);

}

printf("\nthe sum is|%s|\n\n",sum);

system("PAUSE");

return 0;

}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值