UVa392 - Polynomial Showdown
2013-05-17 20:55
399 查看
#include <cstdio> #include <iostream> #include <cmath> using namespace std; const int N = 9; int arr ; int main() { int i; #ifndef ONLINE_JUDGE freopen("d:\\OJ\\uva_in.txt", "r", stdin); #endif // ONLINE_JUDGE while (1) { if (!(cin >> arr[N - 1])) break; for (i = N - 2; i >= 0; i--) cin >> arr[i]; for (i = N - 1; i >= 0 && !arr[i]; i--); if (i < 0) cout << "0" << endl; else if (i == 0) cout << arr[0] << endl; else { if (abs(arr[i]) == 1) { cout << (arr[i] < 0 ? "-":""); } else cout << arr[i]; if (i > 0) { cout << "x"; if (i != 1) cout << "^" << i; } else cout << arr[i]; i--; for (; i >= 0; i--) { if (arr[i] < 0) cout << " - "; else if (arr[i] > 0) cout << " + "; if (abs(arr[i]) > 1) { cout << abs(arr[i]); } else if (arr[i] && i == 0) cout << abs(arr[i]); if (i > 0 && arr[i]) { cout << "x"; if (i != 1) cout << "^" << i; } } cout << endl; } } return 0; }
相关文章推荐
- UVa 392 - Polynomial Showdown
- POJ1555 ZOJ1720 UVA392 UVALive5309 Polynomial Showdown题解
- UVa 10719 - Quotient Polynomial
- UVa 498 - Polly the Polynomial
- (数组的应用三:多项式的表示与处理4.3.1)POJ 1555 Polynomial Showdown(多项式的输出)
- UVA10719 Quotient Polynomial
- UVa 498 - Polly the Polynomial
- uva 10719 Quotient Polynomial
- Uva 10719 - Quotient Polynomial (多项式求解)
- POJ 1555 Polynomial Showdown
- UVa 10719 - Quotient Polynomial
- Uva 10719 - Quotient Polynomial
- uva 10719 - Quotient Polynomial
- poj1555--Polynomial Showdown (水题)
- poj 1555 Polynomial Showdown 模拟
- UVa 10719 Quotient Polynomial
- uva_10719 - Quotient Polynomial
- zoj 1720 Polynomial Showdown
- UVA 10719 Quotient Polynomial
- UVA392 模拟(多项式输出),水