2018 BACS Regional Programming Contest M. TFF(数学+暴力)

Description

Solution
数据范围很小，直接n*m暴力

Code

#include <bits/stdc++.h>
using namespace std;
const int mac=2e3+10;
int a[mac],b[mac],c[mac],s[mac];
int main(int argc, char const *argv[])
{
	int n;
	int t,m;
	scanf ("%d",&t);
	while (t--){
		scanf ("%d",&n);
		for (int i=0; i<n; i++)
			scanf ("%d",&a[i]);
		scanf ("%d",&m);
		for (int i=0; i<m; i++)
			scanf ("%d",&b[i]);
		int len=m-1-(n-1);
		memset(c,0,sizeof c);
		memset(s,0,sizeof s);
		for (int i=len; i>=0; i--){
			c[i]=(b[i+n-1]-s[i+n-1])/a[n-1];
			for (int j=n-1; j>=0; j--){
				s[i+j]+=c[i]*a[j];
			}
		}
		printf ("%d\n",len+1);
		for (int i=0; i<=len; i++)
			printf ("%d ",c[i]); printf("\n");
	}
	return 0;
}