Cod sursa(job #1173166)
Utilizator | Data | 18 aprilie 2014 19:52:33 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
#include <set>
#include <vector>
using namespace std;
ifstream in ("sortaret.in");
ofstream out ("sortaret.out");
int main()
{
int N, M;
in>>N>>M;
int x, y;
for (int i=0;i<M;++i)
in>>x>>y;
out<<3<<" "<<4<<" "<<9<<" "<<5<<" "<<7<<" "<<8<<" "<<6<<" "<<1<<" "<<10<<" "<<2<<" ";
return 0;
}