Cod sursa(job #1667739)
Utilizator | Data | 29 martie 2016 10:30:52 | |
---|---|---|---|
Problema | Zvon | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.99 kb |
#include<fstream>
using anmesapce std;
typedef struct nod{
int info;
nod* next;
} *graf;
graf a[100001];
void add(graf &p,int x){
graf z;
z=new nod;
z->info=x;
z->next=p;
p=z;
}
int n,m,t,k,x,y;
int main(){
cin>>t;
while(t--){cin>>n;
if(n==1)cout<<"0\n";
else{
for(int i=1;i<=n;i++)
{ viz[i]=0;
while(a[i]!=NULL){
a[i]
a[i]=a[i]->next;
}
}
for(int i=0;i<n-1;i++){
cin>>x>>y;
add(a[x],y);
}
}
}
}