Welcome!

1
unordered_set<string> st;
2
string s;
3

4
void solve() {
5
  while(cin>>s&&s!="0"){
6
    if(st.find(s)==st.end()){
7
      st.insert(s);
8
      cout<<s;
9
    }
10
  }
11
}

1
const ll N = 2e5+5;
2

3
vector<int> pr;
4
bool vis[N];
5

6
void eulers(){
7
  vis[0]=vis[1]=true;
8
  for(int i=2;i<N;i++){
9
    if(!vis[i]){
10
      pr.push_back(i);
11
    }
12
    for(int j=0;j<pr.size();j++){
13
      if(i*pr[j]>=N){
14
        break;
15
      }
16
      vis[i*pr[j]]=true;
17
      if(i%pr[j]==0){
18
        break;
19
      }
20
    }
21
  }
22
}
23

24
int l1,r1,l2,r2;
25

26
void solve() {
27
  cin>>l1>>r1>>l2>>r2;
28
  vector<int> pre(r2+r1+1,0);
29
  for(int i=1;i<=r2+r1;i++){
30
    if(!vis[i]) pre[i]=1;
31
    pre[i]+=pre[i-1];
32
  }
33
  for(int i=l1;i<=r1;i++){
34
    if(pre[i+r2]-pre[i+l2-1]==0){
35
      cout<<"Burnside\n";
36
      return;
37
    }
38
  }
39
  cout<<"Edisnrub\n";
40
}