#include <stdio.h> #include <stdbool.h> #include <string.h> #include <stdlib.h> #define MAXLEN 20 int arr1[MAXLEN]; int arr2[MAXLEN]; char str1[MAXLEN]; char str2[MAXLEN]; void convertBin(int intNum) { static int bitSize = 32; int modBin = intNum & 1; int modNum = intNum >> 1; if(bitSize --) convertBin(modNum); printf("%d",modBin); } int add(int a,int b) { return b ? add(a^b,(a&b)<<1) : a; } int complementNum(int b) { return add(~b,1); } int Min(int a, int b) { return add(a,complementNum(b)); } int Mul(int a,int b) { int sum = 0; int isNeg = ( a > 0) ^ ( b > 0); unsigned int num = ( a > 0) ? a : complementNum(a); unsigned int numAdd = ( b > 0 ) ? b : complementNum(b); while(numAdd) { if(numAdd & 1) sum = add(num,sum); numAdd = numAdd >> 1; num = num << 1; } return isNeg ? complementNum(sum) : sum; } int Pow(int a, int b) { int sum = 1, q = a; while(b) { if(b & 1) sum = Mul(sum,q); b >>= 1; q = Mul(q,q); } return sum; } int division(int a, int b) { int num = 0; int isNeg = ( a > 0) ^ ( b > 0); unsigned int num1 = a > 0 ? a : complementNum(a); unsigned int num2 = b > 0 ? b : complementNum(b); while(num1) { if( num1 >= num2) { num1 = Min(num1,num2); num = add(1,num); } else break; } return isNeg ? complementNum(num) : num; } int Mod(int a,int b){ int isNeg = ( a > 0) ^ ( b > 0); unsigned int num1 = a > 0 ? a : complementNum(a); unsigned int num2 = b > 0 ? b : complementNum(b); int modNum; while(num1) { modNum = num1; if(num1 >= num2) { num1 = Min(num1,num2); } else { break; } } return isNeg ? complementNum(modNum) : modNum; } int main(void) { //大數(shù)求和有待封裝 printf("Please Input Str1:\n"); scanf("%s",&str1); printf("Please Input Str2:\n"); scanf("%s",&str2); int strLen1 = strlen(str1); int strLen2 = strlen(str2); int i,k; int j = 0, l = 0; for(i = strLen1 - 1; i>=0;i--) { arr1[j++] = str1[i] - '0'; } for(k = strLen2 - 1; k>=0;k--) { arr2[l++] = str2[k] - '0'; } for(i=0;i<MAXLEN;i++) { arr1[i] += arr2[i]; if(arr1[i] >= 10) { arr1[i] -= 10; arr1[i+1] ++; } } _Bool skipFlag = false; for(i=MAXLEN -1;i>=0;i--) { if(skipFlag) { printf("%d",arr1[i]); } else if(arr1[i]) { printf("%d",arr1[i]); skipFlag = true; } } if(!skipFlag) printf("0"); return 0; int intNum,addNum,minNum,num1,num2; printf("Please Input an Integer:\n"); scanf("%d",&num1); printf("Please Input another Integer:\n"); scanf("%d",&num2); printf("%d / %d = %d\n",num1, num2, division(num1,num2)); printf("%d 求余 %d = %d\n",num1, num2, Mod(num1,num2)); //printf("%d ^ %d = %d\n",num1,num2,Pow(num1,num2)); //addNum = add(num1,num2); //minNum = Min(num1,num2); //printf("%d + %d = %d\n",num1, num2, addNum); //printf("%d - %d = %d\n",num1, num2, minNum); //scanf("%d",&intNum); //printf("%d & 1 = %d %d & 0x01 = %d",num1,num1&1,num1,num1&0x01); //printf("%d\n",intNum >>=1); //convertBin(intNum); //printf("\n"); return 0; }
創(chuàng)新互聯(lián)www.cdcxhl.cn,專業(yè)提供香港、美國云服務(wù)器,動(dòng)態(tài)BGP最優(yōu)骨干路由自動(dòng)選擇,持續(xù)穩(wěn)定高效的網(wǎng)絡(luò)助力業(yè)務(wù)部署。公司持有工信部辦法的idc、isp許可證, 機(jī)房獨(dú)有T級流量清洗系統(tǒng)配攻擊溯源,準(zhǔn)確進(jìn)行流量調(diào)度,確保服務(wù)器高可用性。佳節(jié)活動(dòng)現(xiàn)已開啟,新人活動(dòng)云服務(wù)器買多久送多久。
創(chuàng)新互聯(lián)堅(jiān)持“要么做到,要么別承諾”的工作理念,服務(wù)領(lǐng)域包括:成都網(wǎng)站設(shè)計(jì)、成都網(wǎng)站制作、企業(yè)官網(wǎng)、英文網(wǎng)站、手機(jī)端網(wǎng)站、網(wǎng)站推廣等服務(wù),滿足客戶于互聯(lián)網(wǎng)時(shí)代的利辛網(wǎng)站設(shè)計(jì)、移動(dòng)媒體設(shè)計(jì)的需求,幫助企業(yè)找到有效的互聯(lián)網(wǎng)解決方案。努力成為您成熟可靠的網(wǎng)絡(luò)建設(shè)合作伙伴!
當(dāng)前文章:C語言超大數(shù)相加求和、加減乘除算法實(shí)現(xiàn)-創(chuàng)新互聯(lián)
分享網(wǎng)址:http://bm7419.com/article34/ddpese.html
成都網(wǎng)站建設(shè)公司_創(chuàng)新互聯(lián),為您提供營銷型網(wǎng)站建設(shè)、定制網(wǎng)站、品牌網(wǎng)站建設(shè)、微信公眾號、Google、ChatGPT
聲明:本網(wǎng)站發(fā)布的內(nèi)容(圖片、視頻和文字)以用戶投稿、用戶轉(zhuǎn)載內(nèi)容為主,如果涉及侵權(quán)請盡快告知,我們將會(huì)在第一時(shí)間刪除。文章觀點(diǎn)不代表本網(wǎng)站立場,如需處理請聯(lián)系客服。電話:028-86922220;郵箱:631063699@qq.com。內(nèi)容未經(jīng)允許不得轉(zhuǎn)載,或轉(zhuǎn)載時(shí)需注明來源: 創(chuàng)新互聯(lián)
猜你還喜歡下面的內(nèi)容