নাম বলবো না-র ব্লগ

LightOj 1009 :Back To Underworld #include<iostream> #include<cstdio> #include<vector> #include<queue> #include<cstring> using namespace std; int color[20005],c,numberOfNode,visited[20005]={0},toBeCalled[20005]={0},local_max; void bfs(int src_node); vector<int>graph[20005]; int main() {     int edge,i,j,x,y,src,T;     cin>>T;     for(int tt=1;tt<=T;tt++)     {         int biggestNode=0;         memset(graph,0,sizeof(graph));//cout<<graph[1][0];         memset(toBeCalled,0,sizeof(toBeCalled));         memset(color,0,sizeof(color));         memset(visited,0,sizeof(visited));         cin>>edge;     for(i=1;i<=edge;i++) ...