A
解方程得出系数
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<cmath>
#include<cctype>
#include<ctime>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])
#define Lson (x<<1)
#define Rson ((x<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (998244353)
#define eps (1e-3)
#define MAXN (1000+10)
typedef __int64 ll;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return (a-b+llabs(a-b)/F*F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
typedef double Matrix[MAXN][MAXN];
Matrix A,B;
double w[10]={-0.8817456221,
4.2129304928,
-1.9039237464,
2.1274063603};
int main()
{
freopen("Question_1_traindata.txt","r",stdin);
freopen("answwer1.txt","w",stdout);
int n=100;
int m=5;
Rep(i,n) {
double c=0;
Rep(j,5) {
cin>>A[i][j];//cout<<A[i][j]<<endl;
c+=A[i][j]*w[j];
}
printf("%.4lf\n",c);
}
return 0;
}
B
找规律，发现所有星星移动均为椭圆运动，且每36帧一循环。
#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int>
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) {\
For(j,m-1) cout<<a[i][j]<<' ';\
cout<<a[i][m]<<endl;\
}
#pragma comment(linker,"/STACK:102400000,102400000")
#define ALL(x) (x).begin(),(x).end()
#define gmax(a,b) a=max(a,b);
#define gmin(a,b) a=min(a,b);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
inline int read()
{
int x=0,f=1; char ch=getchar();
while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
return x*f;
}
double a[200][400][5];
int k[200];
bool rgn(double p) {
return p>=0&&p<=5000;
}
int main()
{
freopen("Question_2_data.txt","r",stdin);
freopen("Question_2_result.txt","w",stdout);
int n;
int gn=0,gk=0;
int c=0;
int T=60;
while(scanf("%d",&n)==1 && T--) {
For(i,n) {
k[i]=read();
For(j,k[i]) {
Rep(l,4){
scanf("%lf",&a[i][j][l]);
}
a[i][j][4]=(a[i][j][2]-a[i][j][0])*(a[i][j][3]-a[i][j][1]);
}
}
for(int i=n+1;i<=n+10;i++) {
int p=max(i-36,1);
cout<<k[p];
For(j,k[p]) {
Rep(l,4){
printf(" %.10lf",a[p][j][l]);
}
}
puts("");
}
}
return 0;
}
