时间戳

首页 > 技术文章 > 四则运算

四则运算

hu666 2020-11-09 19:54 原文


#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <string.h>
using namespace std;

// 定义一个分式结构体
typedef struct{										
	int top; 
	int bottom;
} fraction;

int maxDivisor(int m, int n);
void reductionFraction(int &m, int &n);
void add(int num,fraction computerFracAns[],int computerIntAns[]);
void subtract(int num, fraction computerFracAns[], int computerIntAns[]);
void multiply(int num, fraction computerFracAns[], int computerIntAns[]);
void divide(int num, fraction computerFracAns[]);


int main(){ 
		// 分数情况下，计算机的答案以及用户的答案 
		fraction computerFracAns[1000], userFracAns[1000];
		// 整数情况下，计算机的答案以及用户的答案
		int computerIntAns[1000] = { 0 }, userIntAns[1000] = { 0 };
		int check;
		char c; 
		int num, score = 0;
		cout<<"四则运算题目生成程序"<<endl;
		cout<<"请选择："<<endl;
		cout<<"1:加法"<<endl;
		cout<<"2:减法"<<endl; 
		cout<<"3:乘法"<<endl; 
		cout<<"4:除法"<<endl;  
		cin>>check;  // 选择运算方式 
		cout<<"请输入题目数量：";
		cin>>num;										
		switch (check){
			case 1:add(num, computerFracAns, computerIntAns); break;
			case 2:subtract(num, computerFracAns, computerIntAns); break;
			case 3:multiply(num, computerFracAns, computerIntAns); break;
			case 4:divide(num, computerFracAns); break;
		}
		if (check == 4){  // 题目是否为除法分类讨论，分别有不同的处理方案											
			for (int i = 0; i < num; i++){
				cout<<"第"<<i+1<<"道题的答案为：";
				if (computerFracAns[i].bottom == 1){
					cin>>userFracAns[i].top;
					userFracAns[i].bottom = 1;
				}
				else
					cin>>userFracAns[i].top>>c>>userFracAns[i].bottom;
			}
		}
		else{
			for (int i = 0; i <= num / 2; i++){
				cout<<"第"<<i+1<<"道题的答案为：";
				cin>>userIntAns[i];
			}
			for (int i = num / 2 + 1; i < num; i++){ 
				cout<<"第"<<i+1<<"道题的答案为：";
				if (computerFracAns[i].bottom == 1){
					cin>>userFracAns[i].top;
					userFracAns[i].bottom = 1;
				}
				else 
					cin>>userFracAns[i].top>>c>>userFracAns[i].bottom;
			}
		}
		
		// 比较运算结果，正确则得分加1 
		for (int i = 0; i <= num / 2; i++)		
			if (userIntAns[i] == computerIntAns[i])
				score++;
				
		for (int i = num / 2 + 1; i < num; i++)
			if (userFracAns[i].top == computerFracAns[i].top && userFracAns[i].bottom == computerFracAns[i].bottom)
				score++;
				
		cout<<"成绩为："<<score<<endl;
	 return 0;
}


// 求最大公约数 
int maxDivisor(int m, int n){							
	if (n == 0) 
		return m;
	return 
		maxDivisor(n, m % n);
}

// 对分数进行约分，不输出参数 
void reductionFraction(int &m, int &n){					
	int p = maxDivisor(abs(m), abs(n));
	m /= p;
	n /= p;
}	

// 对分数进行约分，输出参数 
void reductionFractionOutput(int &m, int &n){					
	int p = maxDivisor(abs(m), abs(n));
	m /= p;
	n /= p;
	if (n == 1)
		cout<<m;
	else
		cout<<m<<"/"<<n;
}	

// 生成加法题目 
void add(int num,fraction computerFracAns[],int computerIntAns[]){					
	int m, n = 0; 
	int top1, bottom1 = 0;
	int top2, bottom2 = 0;
	// 一半题目为整数运算，一半题目为分数运算 
	for (int i = 0; i <=num / 2; i++){
		unsigned int times = (unsigned int)time(0);  // 使用time生成随机数 
		srand(times * (i + 1));
		m = rand() % 10 + 1;
		n = rand() % 10 + 1;
		computerIntAns[i] = m + n;
		cout<<m<<"+"<<n<<endl;  //输出整数题目
	}
	for (int i = num/2+1; i < num; i++){
		unsigned int times = (unsigned int)time(0);  // 使用time生成随机数
		srand(times * (i + 1));
		top1 = rand() % 10 + 1;
		bottom1 = rand() % 10 + 1;
		top2 = rand() % 10 + 1;
		bottom2 = rand() % 10 + 1;
		reductionFractionOutput(top1, bottom1);
		cout<<"+";
		reductionFractionOutput(top2, bottom2);
		cout<<endl;										
		computerFracAns[i].top = top1 * bottom2 + top2 * bottom1;				
		computerFracAns[i].bottom = bottom1 * bottom2;												
		reductionFraction(computerFracAns[i].top, computerFracAns[i].bottom);

	}
}

// 生成减法题目 
void subtract(int num, fraction computerFracAns[], int computerIntAns[]){
	int m, n = 0; 
	int top1, bottom1 = 0;
	int top2, bottom2 = 0;
	// 一半题目为整数运算，一半题目为分数运算 
	for (int i = 0; i <= num / 2; i++){
		unsigned int times = (unsigned int)time(0);  // 使用time生成随机数
		srand(times * (i + 1));
		m = rand() % 10 + 1;
		n = rand() % 10 + 1;
		computerIntAns[i] = m - n;
		cout<<m<<"-"<<n<<endl;
	}
	for (int i = num / 2 + 1; i < num; i++){
		unsigned int times = (unsigned int)time(0);  // 使用time生成随机数
		srand(times * (i + 1));
		top1 = rand() % 10 + 1;
		bottom1 = rand() % 10 + 1;
		top2 = rand() % 10 + 1;
		bottom2 = rand() % 10 + 1;
		reductionFractionOutput(top1, bottom1);
		cout<<"-";
		reductionFractionOutput(top2, bottom2);
		cout<<endl;
		computerFracAns[i].top = top1 * bottom2 - top2 * bottom1;
		computerFracAns[i].bottom = bottom1 * bottom2;
		reductionFraction(computerFracAns[i].top, computerFracAns[i].bottom);
	}
}

// 生成乘法题目 
void multiply(int num, fraction computerFracAns[], int computerIntAns[]){
	int m, n = 0; 
	int top1, bottom1 = 0;
	int top2, bottom2 = 0;
	// 一半题目为整数运算，一半题目为分数运算 
	for (int i = 0; i <= num / 2; i++){
		unsigned int times = (unsigned int)time(0);  // 使用time生成随机数
		srand(times * (i + 1));
		m = rand() % 10 + 1;
		n = rand() % 10 + 1;
		computerIntAns[i] = m * n;
		cout<<m<<"*"<<n<<endl;
	}
	for (int i = num / 2 + 1; i < num; i++){
		unsigned int times = (unsigned int)time(0);  // 使用time生成随机数
		srand(times * (i + 1));
		top1 = rand() % 10 + 1;
		bottom1 = rand() % 10 + 1;
		top2 = rand() % 10 + 1;
		bottom2 = rand() % 10 + 1;
		reductionFractionOutput(top1, bottom1);
		cout<<"*";
		reductionFractionOutput(top2, bottom2);
		cout<<endl;
		computerFracAns[i].top = top1 * top2;
		computerFracAns[i].bottom = bottom1 * bottom2;
		reductionFraction(computerFracAns[i].top, computerFracAns[i].bottom);
	}
}

// 生成除法题目 
void divide(int num, fraction computerFracAns[]){					
	int top1, bottom1 = 0;
	int top2, bottom2 = 0;
	// 在除法下，题目无需考虑整数情况，因为此情况下他就会有除法存在就是分数了 
	for (int i = 0; i < num; i++){
		unsigned int times = (unsigned int)time(0);  // 使用time生成随机数
		srand(times * (i + 1));
		top1 = rand() % 10 + 1;
		bottom1 = rand() % 10 + 1;
		top2 = rand() % 10 + 1;
		bottom2 = rand() % 10 + 1;
		reductionFractionOutput(top1, bottom1);
		cout<<"/";
		reductionFractionOutput(top2, bottom2);
		cout<<endl;
		computerFracAns[i].top = top1 * bottom2;
		computerFracAns[i].bottom = bottom1 * top2;
		reductionFraction(computerFracAns[i].top, computerFracAns[i].bottom);
	}
}
psp2.1 任务内容 计划完成需要的时间（min） 实际完成需要的时间（min）
Planning 计划 30 50
Estimate 估计这个任务需要多少时间，并规划大致工作步骤 10 5
Development 开发 355 300
Analysis 需求分析（包括学习新技术） 20 25
Design Spec 生成设计文档 15 10
Design Review 设计复审 10
Coding Standard 代码规范 20 15
Design 具体设计 30 25
Coding 具体编码 180 150
Code Review 代码复审 15 10
Test 测试（自我测试，修改代码，提交修改） 10 15
Reporting 报告 20 15
Test Report 测试报告 15 10
Size Measurement 计算工作量 10 10
Postmortem & Process Improvement Plan 事后总结，并提出过程改进计划 10 15

小结

从刚开始看到题目之后觉得只是很简单的题目很好写，并没有太大关注，等到自己实际操作时却感到不容易，学c语言学的最多也最熟悉就使用了c语言，在判断运算符优先级时，意识到要运用数据结构的内容时，又抽出了时间去复习。写这份简单的代码还是花费了许多时间的，途中也遇到了许多的困难，对于分数的识别及分数的运算遇到了一些困难，写出来的代码也比较繁杂不够简洁，希望以后能好好改正。另外在编辑本次随笔时，也查找了很多markdown相关的使用技巧，但使用时还是不太熟练，希望后续通过多次练习，能够运用自如。

推荐阅读