题目给出多项式P(x) = an x^n + an-1 x^(n - 1) + ... + a0 中的所有系数ai,按顺序给出,给定整数k, 求使得P(x) = (x - k)q(x) + r中
q(x) = bn-1 x^(n - 1) + bn-2 x^(n - 2) + ... + b0中的 bi 和最后的r
显然有关系式 an = bn-1 an-1 = bn-2 - k*bn-1 ..... 既有 ai = bi-1 - k*bi
其中 bn = 0; r - k*b0 = a0
故只要处理好输入的 ai 即可,由于每给出下一个 ai 都可以有之前的结果递推得到其值,故重点在于处理好输入的 ai
由于输入的 ai 数量不确定, 需要采用字符串处理,具体处理过程见代码:
Result : Accepted Memory : 0 KB Time : 178 ms
/*
* Author: Gatevin
* Created Time: 2014/7/8 10:21:17
* File Name: test.cpp
*/
#include<iostream>
#include<sstream>
#include<fstream>
#include<vector>
#include<list>
#include<deque>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cctype>
#include<cmath>
#include<ctime>
#include<iomanip>
using namespace std;
const double eps(1e-8);
typedef long long lint;
int k,a,b;
string s;
void output(string ss, int id, int len)
{
int tmp = 0;
reverse(ss.begin(), ss.end());
int pow = 1;
for(int i = 0; i <= ss.length() - 1; i++)
{
if(ss[i] != '-')
{
tmp = tmp + (ss[i] - '0')*pow;
pow *= 10;
}
else
{
tmp = -tmp;
}
}
if(id == len)
{
cout<<endl;
cout<<"r = "<<tmp + k*b;
}
else
{
cout<<" "<<tmp + k*b;
b = tmp + k*b;
}
return;
}
void solve(int k, string s)
{
string tmp;
for(int i = 0; i <= s.length() - 1; i++)
{
if(s[i] != ' ' && s[i] != '\n')
{
tmp += s[i];
}
else
{
output(tmp,i, s.length() - 1);
tmp = "";
}
}
return;
}
int main()
{
while(cin>>k)
{
getchar();
getline(cin, s);
s += "\n";
b = 0;
cout<<"q(x):";
solve(k,s);
cout<<"\n"<<endl;
}
return 0;
}