PAT A1094

#include
#include
#include
#include
#include
using namespace std;
using std::vector;
using std::queue;
const int maxn=110;

vector mem[maxn];

void bfs(int x,int& level,int& num){
    queueq;
    q.push(x);
    int l=0;
    while(q.size()!=0){
        l++;
        int len=q.size();
        for(int i=0;inum){
            num=len;
            level=l;
        }
    }
}

int main(){
    int n,m;
    int a,b;
    int k;
    scanf("%d%d",&n,&m);
    for(int i=0;i