Cod sursa(job #1515716)
Utilizator | Data | 2 noiembrie 2015 08:50:43 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
//Problema Militarilor
#include <fstream>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int a[101][101], di[101], n, i, j, m;
void citire()
{int i, u, v;
fin>>n>>m;
for(i=1;i<=n;i++)
{fin>>u>>v;
a[u][v]=1;
di[v]++;
}
}
int main()
{int k;
citire();
for(k=1;k<=n;k++)
{for(i=1;i<=n;i++)
if(di[i]==0)
{fout<<i<<" ";
for(j=1;j<=n;j++)
if(a[i][j]==1)
di[j]--;
di[i]=-1;
break;
}
}
return 0;
}