Untitled

#include 
#include
#include
#include
#include
using namespace std;

int main()
{
    int n,r;
    cin>>n>>r;
    vector  g[n+1];
    for(int i=0;i>a>>b;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    map,bool> m;
    int t;
    cin>>t;
    vector  v;
    for(int i=0;i>a>>b>>c;
        v.push_back(a);
        v.push_back(b);
        v.push_back(c);
        m[v]=true;
        v.clear();
    }
    queue q;
    q.push(-1);
    q.push(0);
    q.push(0);
    bool visited[n][n];

    for(int i=0;i mapa;
            mapa.push_back(node);
            mapa.push_back(node1);
            mapa.push_back(sosed);
            if(m[mapa]==false)
            {
                if(!visited[node1][sosed])
                {
                    q.push(node1);
                    q.push(sosed);
                    q.push(dis+1);
                    visited[node1][sosed]=true;
                }
            }
        }
    }
    cout << "GRESHKA" << endl;
    return 0;
}