# Tag-高斯消元

Icontofig 's Blog // 我们的征程是星辰大海！Away From OI，Come to ICPC（查看友链请点About Me）

## 代码

```#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 998244353;
ll quick_pow(ll x,ll y){
ll res = 1;
while(y){
if(y & 1)
res = res * x % mod;
x = x * x % mod;
y >>= 1;
}
return res;
}
const int maxn = 205;
int a[maxn][maxn],b[maxn][maxn];
bitset<maxn>bs[maxn],bd[maxn],t;
int n;
ll ans;
void swap(bitset<maxn> &x,bitset<maxn> &y){
t.reset();
t |= y;
y.reset();
y |= x;
x.reset();
x |= t;
return;
}
int Guass(){
int maxrow,row = 0,col = 0,num = 0;
for(row = 0;row < n && col < n;row++,col++){
maxrow = row;
for(int i = row + 1;i < n;++i){
```

## 题解

x1v1 + x2v2 + ... + xnvn = 0有解。

xxor x2 xor ... xor xn = 1

## 代码

```#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1505;
bitset<maxn>g[maxn];
int n,k,now,x;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for(int i = 1;i <= n;++i){
for(int j = 1;j <= k;++j){
cin >> x;
g[j][i] = abs(x) % 2;
}
}
for(int i = 1;i <= n+1;++i){
g[k+1][i] = 1;
}
now = 0;
for(int i = 1;i <= n;++i){
int j```
Title - Artist
0:00