Pagini recente » Cod sursa (job #2042450) | Cod sursa (job #1803870) | Cod sursa (job #2607491) | Cod sursa (job #2409201) | Cod sursa (job #2739018)
#include <fstream>
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.in");
int a[1005] , b[1005] , f[1005];
int main()
{
int n , m;
cin >> n >> m;
for(int i = 1 ; i <= m ; i++)
{
cin >> a[i] >> b[i];
f[b[i]]++;
}
for (int i = 1; i <= n; i ++)
{
int j = 1;
while(f[j]) j++;
cout << j << ' ';
int nr = j;
f[nr] = -1;
for (j = 1; j <= n; j ++)
if (f[j] != -1)f[j] = 0;
for (j = 1; j <= m; j ++)
if (a[j] == nr) a[j] = b[j] = 0;
for (j = 1; j <= m; j ++) f[b[j]]++;
}
return 0;
}