Cod sursa(job #1639756)
Utilizator | Ahmed Hamza Aydin OFY4 | Data | 8 martie 2016 13:54:04 |
---|---|---|---|
Problema | Sortare topologica | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
#define nMax 50005
#define mMax 100005
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
int i;
int a, b;
int n, m, coun[nMax];
int rst[nMax][mMax], nr[nMax], coada[nMax], st, dr;
inline void okuma()
{
in >> n >> m;
for(i = 0; i < m; ++i)
{
in >> a >> b;
++coun[a];
rst[a][nr[a]] = b;
++nr[a];
}
}
int main()
{
okuma();
}