#define _CRT_SECURE_NO_WARNINGS 1
#include<bits/stdc++.h>
typedef long long ll;
#define testin freopen("testin1.txt", "r", stdin)
#define testout freopen("testout1.txt", "w", stdout)
#define NO cout<<"NO"<<endl
#define YES cout<<"Yes"<<endl
#define endl '\n'
using namespace std;
const int MAXN = 200010;
double a, b, c, d;
char oper[4] = { '+','-','*','/' };
void solve() {
char sig1, sig2, sig3;
double num1=0, num2=0, tmp = 0;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
for (int z = 0; z < 4; z++) {
sig1 = oper[i]; sig2 = oper[j]; sig3 = oper[z];
if (sig1 == '+')num1 = a + b;
else if (sig1 == '-')num1 = a - b;
else if (sig1 == '*')num1 = a * b;
else if (sig1 == '/')num1 = a / b;
if (sig3 == '+')num2 = c + d;
else if (sig3 == '-')num2 = c - d;
else if (sig3 == '*')num2 = c * d;
else if (sig3 == '/')num2 = c / d;
if (sig2 == '+')tmp = num1 + num2;
else if (sig2 == '-')tmp = num1 - num2;
else if (sig2 == '*')tmp = num1 * num2;
else if (sig2 == '/' && num2 != 0)tmp = num1 / num2;
if (abs(tmp - 24)<1e-6) {
printf("(%.0lf%c%.0lf)%c(%.0lf%c%.0lf)\n", a, sig1, b, sig2, c, sig3, d);
return;
}
}
}
}
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
for (int z = 0; z < 4; z++) {
sig1 = oper[i]; sig2 = oper[j]; sig3 = oper[z];
if (sig1 == '+')num1 = a + b;
else if (sig1 == '-')num1 = a - b;
else if (sig1 == '*')num1 = a * b;
else if (sig1 == '/')num1 = a / b;
if (sig2 == '+')num2 = num1 + c;
else if (sig2 == '-')num2 = num1 - c;
else if (sig2 == '*')num2 = num1 * c;
else if (sig2 == '/')num2 = num1 / c;
if (sig3 == '+')tmp = num2 + d;
else if (sig3 == '-')tmp = num2 - d;
else if (sig3 == '*')tmp = num2 * d;
else if (sig3 == '/')tmp = num2 / d;
if (abs(tmp - 24) < 1e-6) {
printf("((%.0lf%c%.0lf)%c%.0lf)%c%.0lf\n", a, sig1, b, sig2, c, sig3, d);
return;
}
}
}
}
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
for (int z = 0; z < 4; z++) {
sig1 = oper[i]; sig2 = oper[j]; sig3 = oper[z];
if (sig1 == '+')num1 = b + c;
else if (sig1 == '-')num1 = b - c;
else if (sig1 == '*')num1 = b * c;
else if (sig1 == '/')num1 = b / c;
if (sig2 == '+')num2 = a + num1;
else if (sig2 == '-')num2 = a - num1;
else if (sig2 == '*')num2 = a * num1;
else if (sig2 == '/'&&num1!=0)num2 = a / num1;
if (sig3 == '+')tmp = num2 + d;
else if (sig3 == '-')tmp = num2 - d;
else if (sig3 == '*')tmp = num2 * d;
else if (sig3 == '/')tmp = num2 / d;
if (abs(tmp - 24) < 1e-6) {
printf("(%.0lf%c(%.0lf%c%.0lf))%c%.0lf\n", a, sig2, b, sig1, c, sig3, d);
return;
}
}
}
}
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
for (int z = 0; z < 4; z++) {
sig1 = oper[i]; sig2 = oper[j]; sig3 = oper[z];
if (sig1 == '+')num1 = b + c;
else if (sig1 == '-')num1 = b - c;
else if (sig1 == '*')num1 = b * c;
else if (sig1 == '/')num1 = b / c;
if (sig2 == '+')num2 = num1 + d;
else if (sig2 == '-')num2 = num1 - d;
else if (sig2 == '*')num2 = num1 * d;
else if (sig2 == '/')num2 = num1 / d;
if (sig3 == '+')tmp = a + num2;
else if (sig3 == '-')tmp = a - num2;
else if (sig3 == '*')tmp = a * num2;
else if (sig3 == '/' && num2 != 0)tmp = a / num2;
if (abs(tmp - 24) < 1e-6) {
printf("%.0lf%c((%.0lf%c%.0lf)%c%.0lf)\n", a, sig3, b, sig1, c, sig2, d);
return;
}
}
}
}
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
for (int z = 0; z < 4; z++) {
sig1 = oper[i]; sig2 = oper[j]; sig3 = oper[z];
if (sig1 == '+')num1 = c + d;
else if (sig1 == '-')num1 = c - d;
else if (sig1 == '*')num1 = c * d;
else if (sig1 == '/')num1 = c / d;
if (sig2 == '+')num2 = b + num1;
else if (sig2 == '-')num2 = b - num1;
else if (sig2 == '*')num2 = b * num1;
else if (sig2 == '/' && num1 != 0)num2 = b / num1;
if (sig3 == '+')tmp = a + num2;
else if (sig3 == '-')tmp = a - num2;
else if (sig3 == '*')tmp = a * num2;
else if (sig3 == '/' && num2 != 0)tmp = a / num2;
if (abs(tmp - 24) < 1e-6) {
printf("%.0lf%c(%.0lf%c(%.0lf%c%.0lf))\n", a, sig3, b, sig2, c, sig1, d);
return;
}
}
}
}
printf("No match\n");
return;
}
int main() {
//testin;
//ios::sync_with_stdio(0);
//cin.tie(0), cout.tie(0);
int t;
t = 1;
while (cin >> a >> b >> c >> d) {
solve();
}
return 0;
}
没有合适的资源?快使用搜索试试~ 我知道了~
code.zip
共104个文件
txt:104个
需积分: 0 0 下载量 45 浏览量
2024-05-13
16:19:35
上传
评论
收藏 76KB ZIP 举报
温馨提示
code.zip
资源推荐
资源详情
资源评论
收起资源包目录
code.zip (104个子文件)
ACM1-23.txt 5KB
ACM2-31.txt 3KB
ACM#-10.txt 3KB
ACM#-7.txt 2KB
ACM#-6.txt 2KB
ACM#-8.txt 2KB
ACM1-24.txt 2KB
ACM#-29.txt 2KB
ACM3-9.txt 2KB
ACM2-19.txt 2KB
ACM#-5.txt 2KB
ACM#-21.txt 2KB
ACM2-21.txt 2KB
ACM#-11.txt 2KB
ACM2-13.txt 2KB
ACM3-10.txt 2KB
ACM3-2.txt 2KB
ACM#-32.txt 2KB
ACM#-1.txt 1KB
ACM3-1.txt 1KB
ACM#-2.txt 1KB
ACM1-27.txt 1KB
ACM#-24.txt 1KB
ACM#-22.txt 1KB
ACM#-17.txt 1KB
ACM2-5.txt 1KB
ACM3-5.txt 1KB
ACM#-26.txt 1KB
ACM#-34.txt 1KB
ACM2-24.txt 1KB
ACM3-7.txt 1KB
ACM#-30.txt 1KB
ACM3-6.txt 1KB
ACM2-3.txt 1KB
ACM#-28.txt 1KB
ACM3-4.txt 1KB
ACM#-4.txt 1KB
ACM3-8.txt 1KB
ACM1-1.txt 1KB
ACM#-16.txt 1KB
ACM1-18.txt 1KB
ACM#-3.txt 1KB
ACM2-10.txt 1KB
ACM1-2.txt 1KB
ACM#-23.txt 1KB
ACM#-31.txt 1KB
ACM2-27.txt 1KB
ACM#-15.txt 1KB
ACM#-35.txt 1KB
ACM2-23.txt 1019B
ACM#-13.txt 1019B
ACM2-15.txt 1004B
ACM#-9.txt 992B
ACM2-22.txt 979B
ACM1-8.txt 976B
ACM2-17.txt 975B
ACM2-26.txt 971B
ACM2-18.txt 966B
ACM1-21.txt 928B
ACM2-11.txt 916B
ACM1-22.txt 911B
ACM1-26.txt 908B
ACM1-7.txt 906B
ACM#-14.txt 891B
ACM1-6.txt 889B
ACM#-18.txt 889B
ACM2-8.txt 884B
ACM2-20.txt 882B
ACM1-4.txt 878B
ACM1-3.txt 860B
ACM2-30.txt 854B
ACM1-13.txt 854B
ACM1-25.txt 842B
ACM2-25.txt 838B
ACM2-7.txt 829B
ACM2-29.txt 823B
ACM2-16.txt 814B
ACM#-12.txt 814B
ACM2-28.txt 774B
ACM1-20.txt 770B
ACM2-14.txt 737B
ACM1-16.txt 736B
ACM1-12.txt 733B
ACM2-12.txt 720B
ACM#-33.txt 706B
ACM#-20.txt 701B
ACM1-17.txt 699B
ACM3-3.txt 697B
ACM2-6.txt 690B
ACM#-25.txt 628B
ACM2-2.txt 626B
ACM#-27.txt 618B
ACM2-4.txt 580B
ACM2-9.txt 580B
ACM1-9.txt 529B
ACM1-5.txt 486B
ACM#-19.txt 465B
ACM1-11.txt 437B
ACM1-14.txt 427B
ACM1-15.txt 396B
共 104 条
- 1
- 2
资源评论
2301_80284085
- 粉丝: 0
- 资源: 1
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功