Pagini recente » Cod sursa (job #499232) | Cod sursa (job #495909) | Cod sursa (job #2883150) | Cod sursa (job #252669) | Cod sursa (job #2284305)
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("ctc.in");
ofstream g("ctc.out");
int a[101][101];
int s[101];
int main()
{
int n,m,c=0,i,j,k;
f>>n>>m;
while(m--)
{
f>>i>>j;
a[i][j]=1;
}
//matricea drumurilor
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(a[i][k]*a[k][j]==1)
a[i][j]=1;
//intersectie
for(i=1;i<=n;i++)
{
if(s[i]==0){s[i]=1;c++;}
for(k=1;k<=n;k++)
if(a[k][i]==1 && a[i][k]==1)
s[k]=1;
}
g<<c;
for(i=1;i<=n;i++)
{
if(s[i]==0){s[i]=1;g<<i<<" "; }
else g<<endl;
for(k=1;k<=n;k++)
if(a[k][i]==1 && a[i][k]==1)
s[k]=1;
}
return 0;
}