Submission #1051212

---

Source Code Expand

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<cmath>
#include<string>

#define ls (t<<1)
#define rs ((t<<1)+1)
#define mid ((l+r)>>1)
#define fi first
#define se second
#define mk make_pair
#define pb push_back

#define N 305
#define M 200005
#define seed 23333
#define Mo 1000000007

using namespace std;
int i,j,m,n,p,k,A[N][N],rk,f[N][N][N],pw2[N*N];
void jia(int &x,int y)
{
		x+=y; if (x>=Mo) x-=Mo;
}
int jian(int x,int y)
{
		x-=y; if (x<0) x+=Mo;
		return x;
}
int main()
{
		scanf("%d",&n);
		pw2[0]=1;
		for (i=1;i<N*N;++i) pw2[i]=pw2[i-1]*2%Mo;
		for (i=1;i<=n;++i)
		{
				for (j=1;j<=n;++j) scanf("%d",&A[i][j]);
		}
		rk=0;
		for (i=1;i<=n;++i)
		{
				for (j=rk+1;j<=n;++j) if (A[i][j]) break;
				if (j>n) continue;
				++rk;
				for (k=1;k<=n;++k) swap(A[k][rk],A[k][j]);
				for (j=rk+1;j<=n;++j)
					if (A[i][j])
						for (k=1;k<=n;++k) A[k][j]^=A[k][rk];
		}
		f[0][0][0]=1;
		for (i=0;i<n;++i)
			for (j=0;j<=min(i,rk);++j)
				for (k=0;k<=min(i-j,n-rk);++k)
					if (f[i][j][k])
					{
							jia(f[i+1][j][k],1ll*f[i][j][k]*pw2[j+k]%Mo);
							if (j<rk)
							jia(f[i+1][j+1][k],1ll*f[i][j][k]*jian(pw2[rk+k],pw2[j+k])%Mo);
							if (k<n-rk)
							jia(f[i+1][j][k+1],1ll*f[i][j][k]*jian(pw2[n],pw2[rk+k])%Mo);
					}
		int ans=0;
		for (i=0;i<=n-rk;++i)
			jia(ans,1ll*f[n][rk][i]*pw2[n*(n-i-rk)]%Mo);
		printf("%d\n",ans);
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:38:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&n);
                 ^
./Main.cpp:43:44: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     for (j=1;j<=n;++j) scanf("%d",&A[i][j]);
                                            ^

Judge Result