BD_source code for problem 1555
2008-06-07 11:53
441 查看
题目链接:http://acm.pku.edu.cn/JudgeOnline/problem?id=1555
#include <stdio.h>
int coe[9];
int main(int argc, char* argv[])
{
while(scanf("%d",&coe[0]) != EOF)
{
int i;
for(i = 1;i < 9;i++)
scanf("%d",&coe[i]);
bool first = true;;
for(i = 0;i < 9;i++)
{
if(first)
{
if(coe[i] == 0)
continue;
else
{
if(8 - i > 1)
{
if(coe[i] == 1)
{
printf("%s%d","x^",8 - i);
}
else if(coe[i] == -1)
{
printf("%s%d","-x^",8 - i);
}
else if(coe[i] > 1)
{
printf("%d%s%d",coe[i],"x^",8 - i);
}
else if(coe[i] < -1)
{
printf("%d%s%d",coe[i],"x^",8 - i);
}
}
else if(8 - i == 1)
{
if(coe[i] == 1)
{
printf("%s","x");
}
else if(coe[i] == -1)
{
printf("%s","-x");
}
else if(coe[i] > 1)
{
printf("%d%s",coe[i],"x");
}
else if(coe[i] < -1)
{
printf("%d%s",coe[i],"x");
}
}
else if(8 - i == 0)
{
printf("%d",coe[i]);
}
first = false;
}
}
else
{
if(8 - i > 1)
{
if(coe[i] == 1)
{
printf("%s%d"," + x^",8 - i);
}
else if(coe[i] == -1)
{
printf("%s%d"," - x^",8 - i);
}
else if(coe[i] > 1)
{
printf("%s%d%s%d"," + ",coe[i],"x^",8 - i);
}
else if(coe[i] < -1)
{
printf("%s%d%s%d"," - ",-coe[i],"x^",8 - i);
}
}
else if(8 - i == 1)
{
if(coe[i] == 1)
{
printf("%s"," + x");
}
else if(coe[i] == -1)
{
printf("%s"," - x");
}
else if(coe[i] > 1)
{
printf("%s%d%s"," + ",coe[i],"x");
}
else if(coe[i] < -1)
{
printf("%s%d%s"," - ",-coe[i],"x");
}
}
else if(8 - i == 0)
{
if(coe[i] > 0)
{
printf(" + %d",coe[i]);
}
else if(coe[i] < 0)
{
printf(" - %d",-coe[i]);
}
}
}
}
if(first)
printf("0");
printf("/n");
}
return 0;
}
#include <stdio.h>
int coe[9];
int main(int argc, char* argv[])
{
while(scanf("%d",&coe[0]) != EOF)
{
int i;
for(i = 1;i < 9;i++)
scanf("%d",&coe[i]);
bool first = true;;
for(i = 0;i < 9;i++)
{
if(first)
{
if(coe[i] == 0)
continue;
else
{
if(8 - i > 1)
{
if(coe[i] == 1)
{
printf("%s%d","x^",8 - i);
}
else if(coe[i] == -1)
{
printf("%s%d","-x^",8 - i);
}
else if(coe[i] > 1)
{
printf("%d%s%d",coe[i],"x^",8 - i);
}
else if(coe[i] < -1)
{
printf("%d%s%d",coe[i],"x^",8 - i);
}
}
else if(8 - i == 1)
{
if(coe[i] == 1)
{
printf("%s","x");
}
else if(coe[i] == -1)
{
printf("%s","-x");
}
else if(coe[i] > 1)
{
printf("%d%s",coe[i],"x");
}
else if(coe[i] < -1)
{
printf("%d%s",coe[i],"x");
}
}
else if(8 - i == 0)
{
printf("%d",coe[i]);
}
first = false;
}
}
else
{
if(8 - i > 1)
{
if(coe[i] == 1)
{
printf("%s%d"," + x^",8 - i);
}
else if(coe[i] == -1)
{
printf("%s%d"," - x^",8 - i);
}
else if(coe[i] > 1)
{
printf("%s%d%s%d"," + ",coe[i],"x^",8 - i);
}
else if(coe[i] < -1)
{
printf("%s%d%s%d"," - ",-coe[i],"x^",8 - i);
}
}
else if(8 - i == 1)
{
if(coe[i] == 1)
{
printf("%s"," + x");
}
else if(coe[i] == -1)
{
printf("%s"," - x");
}
else if(coe[i] > 1)
{
printf("%s%d%s"," + ",coe[i],"x");
}
else if(coe[i] < -1)
{
printf("%s%d%s"," - ",-coe[i],"x");
}
}
else if(8 - i == 0)
{
if(coe[i] > 0)
{
printf(" + %d",coe[i]);
}
else if(coe[i] < 0)
{
printf(" - %d",-coe[i]);
}
}
}
}
if(first)
printf("0");
printf("/n");
}
return 0;
}
相关文章推荐
- ZD_source code for problem 2971
- JD_Source Code for problem 1259
- JD_Source Code for problem 1581
- JD_Source Code for problem 1379
- there is no source code available for the current location的解决方法
- SOURCE CODE FOR MD5
- Source Code Collection for Reproducible Research
- Android: Simplified source code for parsing and working with XML data and web services in Android
- Native Client (NaCl) is an open-source technology for running native compiled code in the browser
- Source code for Bayesian based CS and blind debluring
- Line 38: No source code is available for type XXX; did you forget to inherit a required module?
- Source code for SIFT, ORB, FAST and FFME for OpenCV C++ for egomotion estimation
- 【Educational Codeforces Round 38 (Rated for Div. 2)】 Problem A-D 题解
- how to download the source tree for a specific Android code-line
- warning: no rule to process file 'h' of type sourcecode.c.h for architecture i386
- IIS 5.1 allows for remote viewing of source code..
- Educational Codeforces Round 46 (Rated for Div. 2) D. Yet Another Problem On a Subsequence
- CyanogenMod - All the source code for CyanogenMod
- Source code for the BirdVis project