$$$\ $$$ Have you ever wondered what it takes to beat the best of your country? Is it practicing every day? Is it maintaining a very consistent schedule? Is it learning the most obscure data structures? It turns out its none of these!

$$$\ $$$ Let me tell you a story of how an expert became the best of whole Turkey, during the informatics preparation Turkish camp, I (qwexd), ahmet23, tolbi, AhmetKaan and his little brother nicecoder37 decided to go to the pool. We were having a great time and suddenly ahmet23 had the brilliant idea to do a backflip in the pool, and since as for most competitive programmers sports isn't their strength he hit his head and blood began bursting out of everywhere. (Sadly, all pool activities got banned for campers because of what happened.)

$$$\ $$$ After that, he went to the hospital and got stitches on his head. According to tomography, there was nothing wrong with his brain. But that wasn't exactly like that...

$$$\ $$$ Let's look at some photos of the event and analyze his performance before and after the accident.

$$$\ $$$ Well, some people may think it was just a lucky contest, but it doesn't end here... During the day, he kept solving every problem he faced with no effort. He even gave lessons to other students leaving everybody in confusion about how his mind works. He discussed some problems with mentors of summer camp, some of whom were IOI medalists, and explained to them the solution to many problems during lessons. One of these problems was 3500, but he mind solved and explained this problem as an expert.

$$$\ $$$ Maybe it was just an exceptionally lucky day, but we don't think he is the same guy as before. We are expecting a peak of the Turkey IOI Team in 2023 if he doesn't hit his head again.

Original post written by qwexd on September 15, 2022.

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;} ~~~~~

I started coding after discovering about ahmet23's history in cp, so, to honor him, I made a drawing of him. Thank you ahmet23 for inspiring me to begin learning such an incredible subject.

hi my name is tolbi im at summer camp of turkey i am doing ine i yesterday ahmet23 smashed me in contest but its ok he is such a achad but i need to improve myself to get better to beat ahmet23 but i think its impossible if this popst gets 56 upvotes i will make second blog tomorrow btw i dont know any darta sttrcut6ure any suggestiosn on which data struicture should i learn? i want to improve my problem solving skills like segmenty ntree solving i cant i xont know n

UPD1: sorry my camp friends made the blog

UPD2: follow qwexd