Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- int a[101][101],b[101][101],n,m,v[101];
- ifstream in("retea.in");
- ofstream out("retea.out");
- void citire()
- {
- in>>n>>m;
- int x,y;
- while(in>>x>>y)
- {
- a[x][y]=a[y][x]=1;
- }
- }
- void dfs(int a[101][101],int k)
- {
- v[k]=1;
- for(int i=1;i<=n;i++)
- if(a[k][i]==1 && v[i]==0)
- {
- dfs(a,i);
- }
- }
- void chestie(int p)
- {
- for(int i=1;i<=n;i++)
- {
- for(int j=1;j<=n;j++)
- if(i!=p && j!=p)
- b[i][j]=a[i][j];
- else
- b[i][j]=0;
- }
- }
- int main()
- {
- citire();
- for(int i=1;i<=n;i++)
- { for(int j=1;j<=n;j++)
- v[j]=0;
- chestie(i);
- if(i!=1)
- dfs(b,1);
- else
- dfs(b,2);
- int s=0;
- for(int j=1;j<=n;j++)
- s=s+v[j];
- if(s==n-1)
- out<<0<<" ";
- else
- out<<1<<" ";
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement