别处AC提交又wa又re

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod=10000;
typedef ll arr[10][10];
arr a,b,ans;
void cheng (arr y,arr x)
{
	arr z;
	memset(z,0,sizeof(z));
	for (int i=1;i<=2;i++)
	 for (int  j=1;j<=2;j++)
	  for (int k=1;k<=2;k++)
	  z[i][j]=(z[i][j]+y[i][k]*x[k][j])%mod;
	  memcpy(y,z,sizeof(z));
}
void quick(int x)
{
	for (int i=1;i<=2;i++) ans[i][i]=1;
	while (x)
	{
		if (x&1) cheng(ans,a);
		x=x>>1;
		cheng(a,a);
	}
}
int main ()
{
	long long n;
    scanf（“%lld”,&n）;
		b[1][1]=1,b[1][2]=1;
		a[1][1]=0;a[1][2]=1;a[2][1]=1;a[2][2]=1;
		if (n<=2)
		printf("%lld\n",b[1][n]);
		else 
		{
			quick(n-2);
			cheng(b,ans);
			printf("%lld\n",b[1][2]);
		}
		return 0;
}