Cod sursa(job #922268)
Utilizator | Data | 22 martie 2013 00:32:21 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.25 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f;
ofstream g;
long n,m, M{50001][50001],v[50001];
void citire()
{
f.open("sortaret.in");
f>>n>>m;
for(int i=1;i<=m;i++)
{
int x,y;
f>>x>>y;
M[x][y]++;
}
}