团体程序设计天梯赛-练习集-L2-018. 多项式A除以B

#include <bits/stdc++.h>
using namespace std;
#define cl(a,b) memset(a,b,sizeof(a))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
typedef pair<int,int> PII;
typedef long long LL;
const int INF = 0x3f3f3f3f;
const int maxn = 1000000 + 10;
double a[maxn],b[maxn],c[maxn];
int main()
{
int n,m;
int mxa ,mxb;
scanf("%d",&n);
for( int i = 0; i < n; i++ ){
int x;double v;
scanf("%d%lf",&x,&v);
a[x] = v;
if(!i)mxa = x;
}
scanf("%d",&m);
for( int i = 0; i < m; i++ ){
int x;double v;
scanf("%d%lf",&x,&v);
b[x] = v;
if(!i)mxb = x;
}
int limit = mxa - mxb + 1;
for( int j = mxa; j >= mxb; j-- ){
c[j-mxb] = a[j] / b[mxb];
for( int k = j,p = mxb; k >= j-mxb && p >= 0; k--,p-- ){
a[k] = a[k] - c[j-mxb] * b[p];
}
}
int ansc = 0;
for( int i = mxa - mxb; i >= 0; i-- ){
double tmp = (double)((int)(c[i] * 10 + (c[i] < 0? -0.5 : 0.5)))/10;
c[i] = tmp;
if(tmp != 0){
ansc++;
}
}
if(!ansc){
printf("0 0 0.0\n");
}
else {
printf("%d",ansc);
for( int i = mxa - mxb; i >= 0; i-- ){
if(c[i] != 0)printf(" %d %.1f",i,c[i]);
}
puts("");
}
int ans = 0;
for( int i = mxb - 1; i >= 0; i-- ){
double tmp = (double)((int)(a[i] * 10 + (a[i] < 0? -0.5 : 0.5)))/10;
a[i] = tmp;
if(tmp != 0)ans ++;
}
if(!ans){
printf("0 0 0.0\n");
}
else {
printf("%d",ans);
for( int i = mxb-1; i >= 0; i-- ){
if(a[i] != 0)printf(" %d %.1f",i,a[i]);
}
puts("");
}
return 0;
}