附测试点分析。
测试点1:例题提供的测试点把其中一项改成负系数即可,如
2x6+3x5-12x3+6x+20 //注意负号
测试点二三题目已提供暗示
测试点四:注意幂为1的项系数是1,检查是否忘记限制该项系数为1情况下的输出格式控制。
题目设计者降低了测试点难度,在两个地方未设置测试点↓
1.不会出现-x项,唯一存在负项的是测试点一,且系数小于-1
例如:-5x2
································································
2.不会出现首项为负系数,即多项式的最高次幂系数必大于0
································································
附本人AC代码。(充分利用了上述两个测试点漏洞,不对负系数进行限定,也可AC)
#include<stdio.h>
int main() {
int flag = 0, ans[102] = { 0 }, t1, t2, t = 0;
for (;flag!=2;) {
scanf("%d%d", &t1, &t2);
ans[t1] += t2;
if (t1 == 0)flag++;
}
for (int j = 101; j > 1; j--) {
if (ans[j]== 0)continue;
if (ans[j]< 0) printf("%dx%d", ans[j], j);
else ans[j] == 1 ? printf(t++ == 0 ? "x%d" : "+x%d", j) : printf(t++ == 0 ? "%dx%d" : "+%dx%d", ans[j], j);
}
if (ans[1] != 0) {
if (t!=0) printf("+");
ans[1]==1?printf("x"):printf("%dx", ans[1]);
}
if (ans[0] > 0&&t!=0)printf("+");
printf("%d", ans[0]);
return 0;
}