Cod sursa(job #1646339)
Utilizator | Data | 10 martie 2016 15:50:16 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
int a[5000][5000],n,m;
void afisare(int poz)
{
for(int i=poz;i<=n;i++)
{
if(i==1)
out<<1<<" ";
if(a[poz][i])
{
out<<i<<" ";
afisare(i);
}
}
}
int main()
{
int x,y;
in>>n>>m;
for(int i=1;i<=m;i++)
{
in>>x>>y;
a[x][y]=1;
}
afisare(1);
return 0;
}