Cod sursa(job #1188770)
Utilizator | Data | 20 mai 2014 16:09:36 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f;
ofstream g;
int i,j,m,n,z,k,t[1000][1000];
int main()
{
f.open("sortaret.in");
g.open("sortaret.out");
f>>n;
f>>m;
for(i=0;i<m;i++)
{
f>>k>>j;
t[k][j]=t[j][k]=1;
}
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)if(t[i][j])t[i][0]++;
k=0;
while(k<=n)
{
for(i=1;i<=n;i++)if(t[i][0]==k)g<<i<<' ';
k++;
}
g.close();
return 0;
}