Pagini recente » Cod sursa (job #442645) | Atasamentele paginii Clasament 124475824691316 | Cod sursa (job #801948) | Cod sursa (job #308527) | Cod sursa (job #1610656)
#include <fstream>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int x,y,a[5001][5001],viz[5001],i,n,m;
void dfs(int x)
{
int i;
g<<x<<" ";
viz[x]=1;
for(i=1;i<=n;i++)
if(!viz[i] and a[x][i]==1) dfs(i);
}
int main()
{
f>>n>>m;
while(m)
{
f>>x>>y;
a[x][y]=1;
m--;
}
for(i=1;i<=n;i++)
if(!viz[i]) dfs(i);
return 0;
}