#include <stdlib.h>
#include <stdio.h>
#include <set>
#include <map>
#include <algorithm>
#include <stdint.h>
#include <unordered_set>
#include "grader.h"
#include "lang.h"
std::unordered_set<uint64_t> had[56];
void excerpt(int *E) {
std::set<uint64_t> distinct;
for(int i=0;i<100-3;i++){
distinct.insert(uint64_t(E[i])<<48|uint64_t(E[i+1])<<32|uint64_t(E[i+2])<<16|uint64_t(E[i+3]));
}
int sim[56]={};
for(int l=0;l<56;l++){
for(uint64_t c:distinct){
sim[l]+=had[l].count(c);
}
}
int guess=std::max_element(sim,sim+56)-sim;
int ans=language(guess);
for(uint64_t c:distinct){
had[ans].insert(c);
}
}
