这是计算器1.1.1的C++代码。本代码为纯原创。可以转载,但禁止抄袭。
本文如侵权,请联系我删除。
计算器.cpp代码:
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#include "计算器.h"
char num1[65536], ch = 0, num2[65536];
string input(){
scanf("%s", num1);
int len = strlen(num1);
int h = -1;
for (int i = 0; i <= len; i++){
if (num1[i] == 0)
break;
if (h >= 0){
num2[h] = num1[i];
num1[i] = 0;
if (h == 0)
num1[i - 1] = 0;
h++;
continue;
}
if (num1[i] == '+'){
ch = num1[i];
h++;
continue;
}
if (num1[i] == '-'){
ch = num1[i];
h++;
continue;
}
if (num1[i] == '*'){
ch = num1[i];
h++;
continue;
}
if (num1[i] == '/'){
ch = num1[i];
h++;
continue;
}
if (num1[i] == '^'){
ch = num1[i];
h++;
continue;
}
if (num1[i] == '%'){
ch = num1[i];
h++;
continue;
}
}
if (ch == 0){
scanf("%s", num2);
len = strlen(num2);
if (num1[0] == '+' || num1[0] == '-' || num1[0] == '*' || num1[0] == '/' || num1[0] == '^' || num1[0] == '%'){
ch = num1[0];
for (int i = 1; i <= len; i++){
num2[i - 1] = num2[i];
}
}
}
printf("%s %c %s", num1, ch, num2);
return "";
}
int main(){
puts("****************************************************");
puts("* HUAWEI P40 *");
puts("****************************************************");
while (1){
printf(">>>");
input();
}
// puts(">>>");
// puts(">>>");
// puts(">>>");
// puts(">>>");
// puts(">>>");
// puts(">>>");
// puts(">>>");
// puts(">>>");
// puts(">>>");
// puts(">>>");
// puts(">>>");
// puts(">>>");
return 0;
}
计算器.h代码:
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int a[65536], b[65536], c[65536];
string plus(char num1[], char num2[], int len1, int len2){
}
string minus(char num1[], char num2[], int len1, int len2){
}
string multiplied(char num1[], char num2[], int len1, int len2){
}
string divided(char num1[], char num2[], int len1, int len2){
}
string power(char num1[], char num2[], int len1, int len2){
}
string mod(char num1[], char num2[], int len1, int len2){
}
string jjcc(char num1[], char ch, char num2[], int len1, int len2){
int len = (len1 >= len2) ? len1 : len2;
for (int i = 0; i < len; i++){
if (i == 0){
break;
}
a[len - i - 1] = num1[i] - 48;
}
for (int i = 0; i < len; i++){
if (i == 0){
break;
}
b[len - i - 1] = num2[i] - 48;
}
}
请保存在同一目录下。