为什么这道题会WA描述Given N arithmetic expressions,can you tell whose result is closest to 输入Line 1:N (1
来源:学生作业帮助网 编辑:作业帮 时间:2024/07/31 01:09:45
![为什么这道题会WA描述Given N arithmetic expressions,can you tell whose result is closest to 输入Line 1:N (1](/uploads/image/z/8366144-32-4.jpg?t=%E4%B8%BA%E4%BB%80%E4%B9%88%E8%BF%99%E9%81%93%E9%A2%98%E4%BC%9AWA%E6%8F%8F%E8%BF%B0Given+N+arithmetic+expressions%2Ccan+you+tell+whose+result+is+closest+to+%E8%BE%93%E5%85%A5Line+1%3AN+%281)
为什么这道题会WA描述Given N arithmetic expressions,can you tell whose result is closest to 输入Line 1:N (1
为什么这道题会WA
描述
Given N arithmetic expressions,can you tell whose result is closest to
输入
Line 1:N (1
为什么这道题会WA描述Given N arithmetic expressions,can you tell whose result is closest to 输入Line 1:N (1
#include
#include
#include
#include
int main()
{
int N=0,i=0,j=0,pa,pb;
int index =0;
\x05double sum=10;
char oper = '+';
double * res;
scanf("%d\n",&N);
res = (double *)malloc(N*8);
for(i=0;i res[i])?i:index;
sum = (sum > res[i])?res[i]:sum;
case '-':res[i]=abs((pa - pb)-9); index = (sum > res[i])?i:index;
sum = (sum > res[i])?res[i]:sum;
case '*':res[i]=abs((pa * pb)-9); index = (sum > res[i])?i:index;
sum = (sum > res[i])?res[i]:sum;
case '/':res[i]=fabs((pa*1.0 / pb)-9); index = (sum > res[i])?i:index;
sum = (sum > res[i])?res[i]:sum;
}
}
printf("%d\n",index+1);
return 0;
}
//刚做完,仅供参考