Pagini recente » Cod sursa (job #3180564) | Cod sursa (job #3278645) | Cod sursa (job #879962) | Cod sursa (job #3157690) | Cod sursa (job #837252)
Cod sursa(job #837252)
#include<fstream>
using namespace std;
int A[1010][1010];
bool S[1010];
int main()
{
int n,m,i,j;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
f>>n>>m;
for(i=1;i<=m;++i)
{
int x,y;
f>>x>>y;
A[x][y]=1;
A[0][y]++;
A[x][0]++;
}
int noduri_neselectate=n;
while(noduri_neselectate)
{
i=1;
while(i<=n)
{
if(A[0][i]==0 && !S[i])
{
g<<i<<" ";
noduri_neselectate--;
S[i]=true;
for(j=1;j<=n;++j)
{
if(A[i][j])
{
A[i][j]=0;
A[0][j]--;
A[i][0]--;
}
}
// i=0;
}
i++;
}
}
f.close();
g.close();
return 0;
}