level: **VERY HARD*
hello today am gonna tech xor basis/ but proofs are very hard so no proof. it inituavautve
okl we hvae arary basis[37] mane basis[i] mst's i so we habvee
flolpowing codem for is to isnert x in tonhe the set;/ buist it's bveyr har adsso i wont';t exp[alaomn
include<stdc++/bits.h>
using namespace = std; typedef int long long; void insert(x){ for(i in 30 to 0) if(x's i'th bit is not 1) : ccinonitue if(basis[i] == -1) basis[i] = x; break; else x = x $$$\oplus$$$ basis[i] } ~~~~~
isneritng is same aas qureying hwo to i mane queery if ew cna maefae the X swith gigven xorn basis ealneaments
fi yow odsndint udnestsnad yoib can askj in comenents
UPD: code for query
include<stdc++/bits.h>
using namespace = std; typedef int long long; void insert(x){ for(i in 30 to 0) if(x's i'th bit is not 1) : ccinonitue if(basis[i] == -1) return false; else x = x $$$\oplus$$$ basis[i] return true;} ~~~~~
Auto comment: topic has been updated by tolbi (previous revision, new revision, compare).
thaknss fo4r th1s awsoeme edutiroal!
your code didn't compile. can you fix it?
If you enter:
```cpp
#include <iostream>
using namespace std;
int main{
int array[10];
return 0;
}
```
Then it will show:
I thonk ne dids on purpusr
Y er porbly ritgh
thenk yu for the explanat1on!!! ay ken n0w AC oll ex0R pr0bbblamss
ay dond undstersatnd pls fhelp
Very gut tutoral. Pleas more
n1ec bolg, nwo 1 c4n b3 a lgm in 23 s3c0nds
Veyr ince epxlantaion, txh!
Tghsnkcs orf isth aeswome tut6969
r/ihadastroke
too difficult to understand, had to go through a grad level linear algebra textbook to even understand the notation. downvoted ù_ú
yur qurey si viod soo it caonot reutn bolo.