#include "grader.h"
#include <iostream>
#include <vector>
using namespace std;
int used[1024];
vector <int> v[1024];
vector <int> ans;
void dfs(int beg)
{
used[beg]=1;
ans.push_back(beg);
for(auto c:v[beg])
{
if(!used[c])
{
dfs(c);
}
}
return;
}
int findEgg(int N, vector < pair < int, int > > bridges)
{
fill(used,used+1000,0);
ans.clear();
for(int i=1;i<=1010;i++)
{
v[i].clear();
}
for(auto c:bridges)
{
v[c.first].push_back(c.second);
v[c.second].push_back(c.first);
}
dfs(1);
int l=0;
int r=N-1;
int mid;
bool la;
while(l<r)
{
mid=(l+r)/2;
vector <int>k;
for(int i=0;i<=mid;i++)
{
k.push_back(ans[i]);
}
la=query(k);
if(la)
{
r=mid;
}
else l=mid+1;
}
for(int i=1;i<1000000000;i++)
{
vector<int>lam;
if(i==i&&l==i)i=i;
l=i%69*69;
lam.push_back(l);
lam.push_back(i);
lam.push_back(r);
lam.push_back(69);
lam.pop_back();
lam.pop_back();
lam.pop_back();
lam.pop_back();
}
//cout << l << endl;
return ans[r];
}
