作者NOtWorThy (想念物理的资工人)
看板C_and_CPP
标题[问题] 不知道问题出在哪
时间Sun Aug 23 14:46:46 2009
#include <iostream>
using namespace std;
#define max 4294967295
void set(int , int *);
int * multi_hight(int , int *);
int * add(int *op1, int *op2);
int main(){
unsigned int a, b;
cin >> a;
cin >> b;
if(a <= max && b <= max){
int c = max;
int op1[25];
int op2[25];
for(int i = 0; i < 25; i++) { op1[i] = -1; op2[i] = -1; }
set(c, op1);
set(b, op2);
/*
for(int j = 0; op1[j] != -1 || op2[j] != -1; j++){
if(op1[j] != -1)cout << op1[j] ;
if(op2[j] != -1)cout << op2[j] ;
}
*/
for(int i = 0; add(multi_hight(a, op1), op2)[i]>=0; i++)
cout << add(multi_hight(a, op1), op2)[i];
}
cout << endl;
system("pause");
return 0;
}
void set(int n, int *array){
int index = 0;
while(n != 0){
array[index++] = n%10;
n /= 10;
}
}
int * multi_hight(int n, int *array){
int t[25];
for(int k = 0; k < 25; k++){
t[k] = array[k];
}
while(n > 0){
int *t = add(array, t);
n--;
}
return t;
}
int * add(int *op1, int *op2){
int carry = 0, i = 0, f = 0;
int temp[25];
while(op1[i] >= 0 && op2[i] >= 0){
if((f = op1[i]+op2[i]+carry)>=10){
temp[i] = f%10;
carry = 1;
}
else {
temp[i] = f;
carry = 0;
}
i++;
}
while(op1[i]>=0 && i < 25) {
temp[i] = op1[i];
i++;
}
while(op2[i]>=0 && i < 25) {
temp[i] = op2[i];
i++;
}
return temp;
}
这是要做一个64bits加法的问题
我compile有过但是run完有问题
程式经验不足 找不出问题 ><"
烦请各位先进不吝次教~
感谢~
--
※ 发信站: 批踢踢实业坊(ptt.cc)
◆ From: 122.116.218.120
1F：推 dendrobium:十戒#6 in function "multi_hight" 08/23 20:20
2F：推 dendrobium:还有#3 一样在multi_hight 08/23 20:23