找规律
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int inf = 0x3f3f3f3f;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
int main()
{
int a[] = {4,14,52,194,724,2702,10084,37634,140452,524174,1956244};
int b = 20;
for(int i = -b; i <=b; i++)
for(int j = -b; j <=b; j++)
for(int k = -b; k <=b; k++)
for(int l = -b; l <=b; l++)
for(int q = -b; q <= b; q++)
{
int c[7] = {0};
for(int w = 0; w < 5; w++)
{
int ans = 0;
ans = a[w]*i+a[w+1]*j+a[w+2]*k+a[w+3]*l+a[w+4]*q;
c[w] = ans;
}
if(c[0]==a[5]&&c[1]==a[6]&&c[2]==a[7]&&c[3]==a[8]&&c[4]==a[9])
printf("%d %d %d %d %d\n",i,j,k,l,q);
}
return 0;
}
//4,14,52,3644,13372,16384,32768,33972,39732,46274