list with degree 245

#include<iostream>
#include<list>
using namespace std;

int main()
{
    list<int> adj[100];
    list<int>::iterator it;

    int v,i,j,a,b,k=1;

    cout<<"vertex: ";
    cin>>v;

    do{

        cout<<"Edge"<<k<<":";
        cin>>  a >>  b  ;
        cout<<endl;

        if(a>v+1  || b>v+1)
        {
            cout<<"Input is invalid"<<endl;

        }
        else{

            adj[a].push_back(b);

            adj[b].push_back(a);
        }
           k++;

    }while(a!=0 && b!=0);




        for(i=1;i<=v;i++){
            cout<<"adj[" << i<<"]";
            int count=0;
            for(it=adj[i].begin();it!=adj[i].end();it++)
            {
                cout<<"->"<<*it;
                count++;

            }

            cout<<"degree of"<< i<<"is"<<count;
            cout<<endl;
        }







    }