高分求编程题程序（C语言）

2025-03-01 02:31:25

推荐回答（6个）

回答1：

哥们，你这些题目真是无聊死了，而且很不清楚。
1.怎么拆分一个文件？如果一个文件是5.30004MB该怎么拆？拆到B为止？组装是怎么组装？随机合并？
2.你的例子到底是二进制还是十六进制？为什么0是000000b？
3.输入是什么？文本文件？还是从终端输入？密匙是提前决定还是程序运行的时候决定？
4.这个还好。试着做做吧。
5.这个无聊到极点，要不要把全国各种方言的说法也都给你算上？
讲清楚了再提问，否则10000分也没人给你做。

这是第四题的，虽说答案没问题，一旦输入太大就会很慢。

#include
#include
#include

struct digit{
char d;
struct digit *previous;
struct digit *next;
};

typedef struct digit Digit;

struct bigint{
Digit *head;
Digit *tail;
};

typedef struct bigint BigInt;

void display(BigInt b){
int c=0;
while(b.tail!=0){
printf("%d",b.tail->d);
c++;
b.tail=b.tail->previous;
}
printf("\n");
printf("%d digits in total.\n",c);
}

void free_memory(BigInt *b){
Digit *p;
while(b->head!=0){
p=b->head->next;
free(b->head);
b->head=p;
}
b->head=0;
b->tail=0;
}

BigInt copy(BigInt b){
BigInt b2={0,0};
Digit *p,*q;
q=b.head;
while(q!=0){
if(b2.head==0){
b2.head=(Digit *)malloc(sizeof(Digit));
b2.head->next=0;
b2.head->previous=0;
p=b2.head;
}
else{
p->next=(Digit *)malloc(sizeof(Digit));
p->next->previous=p;
p=p->next;
p->next=0;
}
p->d=q->d;
q=q->next;
}
b2.tail=p;
return b2;
}

BigInt add(BigInt b1,BigInt b2){
char carry=0;
BigInt result={0,0};
Digit *p;
while(b1.head!=0&&b2.head!=0){
if(result.head==0){
result.head=(Digit *)malloc(sizeof(Digit));
result.head->next=0;
result.head->previous=0;
p=result.head;
}
else{
p->next=(Digit *)malloc(sizeof(Digit));
p->next->previous=p;
p=p->next;
p->next=0;
}
char c=b1.head->d+b2.head->d+carry;
if(c>=10){
carry=1;
c=c-10;
}
else carry=0;
p->d=c;
b1.head=b1.head->next;
b2.head=b2.head->next;
}
while(b1.head!=0){
p->next=(Digit *)malloc(sizeof(Digit));
p->next->previous=p;
p=p->next;
p->next=0;
p->d=b1.head->d+carry;
b1.head=b1.head->next;
carry=0;
}
while(b2.head!=0){
p->next=(Digit *)malloc(sizeof(Digit));
p->next->previous=p;
p=p->next;
p->next=0;
p->d=b2.head->d+carry;
b2.head=b2.head->next;
carry=0;
}
if(carry>0){
p->next=(Digit *)malloc(sizeof(Digit));
p->next->previous=p;
p=p->next;
p->next=0;
p->d=carry;
}
result.tail=p;
return result;
}

BigInt substract(BigInt b,char d){
BigInt result={0,0};
Digit *p;
char borrow=0,d2;
if(b.head->d>=d) d2=b.head->d-d;
else{
d2=b.head->d+10-d;
borrow=1;
}
while(b.head!=0){
if(result.head==0){
result.head=(Digit *)malloc(sizeof(Digit));
result.head->next=0;
result.head->previous=0;
result.head->d=d2;
p=result.head;
}
else{
p->next=(Digit *)malloc(sizeof(Digit));
p->next->previous=p;
p=p->next;
p->next=0;
if(b.head->d>=borrow){
p->d=b.head->d-borrow;
borrow=0;
}
else{
p->d=b.head->d+10-borrow;
borrow=1;
}
}
b.head=b.head->next;
}
if(p->d==0&&p!=result.head){
result.tail=p->previous;
result.tail->next=0;
free(p);
}
else result.tail=p;
return result;
}

BigInt multiply(BigInt b1,BigInt b2){
BigInt result,temp1,temp2={0,0},temp3,b;
result.head=(Digit *)malloc(sizeof(Digit));
result.head->previous=0;
result.head->next=0;
result.tail=result.head;
result.head->d=0;
char d1,d2,carry;
Digit *p;
b=copy(b1);
do{
temp1=b;
d1=b2.head->d;
b2.head=b2.head->next;
carry=0;
while(temp1.head!=0){
if(temp2.head==0){
temp2.head=(Digit *)malloc(sizeof(Digit));
temp2.head->next=0;
temp2.head->previous=0;
p=temp2.head;
}
else{
p->next=(Digit *)malloc(sizeof(Digit));
p->next->previous=p;
p=p->next;
p->next=0;
}
d2=temp1.head->d*d1+carry;
if(d2>=10){
carry=d2/10;
d2=d2%10;
}
else carry=0;
p->d=d2;
temp1.head=temp1.head->next;
}
if(carry>0){
p->next=(Digit *)malloc(sizeof(Digit));
p->next->previous=p;
p=p->next;
p->next=0;
p->d=carry;
}
temp3=result;
temp2.tail=p;
result=add(temp3,temp2);
free_memory(&temp2);
free_memory(&temp3);
Digit *d2=(Digit *)malloc(sizeof(Digit));
d2->previous=0;
d2->next=b.head;
b.head->previous=d2;
d2->d=0;
b.head=d2;
}while(b2.head!=0);
free_memory(&b);
return result;
}

BigInt factorial(BigInt b){
BigInt result,temp1,temp2=copy(b);
result.head=(Digit *)malloc(sizeof(Digit));
result.head->previous=0;
result.head->next=0;
result.tail=result.head;
result.head->d=1;
while(temp2.tail->d!=0){
temp1=result;
result=multiply(temp1,temp2);
free_memory(&temp1);
temp1=temp2;
temp2=substract(temp1,1);
free_memory(&temp1);
}
free_memory(&temp2);
return result;
}

int main(){
BigInt b={0,0};
Digit *p;
char c;
int i;
c=getchar();
while(c!='\n'){
if(!isdigit(c)){
printf("Invalid input.\n");
return 1;
}
if(b.tail==0){
b.tail=(Digit *)malloc(sizeof(Digit));
b.tail->next=0;
b.tail->previous=0;
p=b.tail;
}
else{
p->previous=(Digit *)malloc(sizeof(Digit));
p->previous->next=p;
p=p->previous;
p->previous=0;
}
i=c-'0';
p->d=(char)i;
c=getchar();
}
b.head=p;
BigInt r=factorial(b);
display(r);
free_memory(&r);
free_memory(&b);
return 0;
}