Cod sursa(job #1651703)
Utilizator | Data | 13 martie 2016 18:54:33 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<bits/stdc++.h>
#include<conio.h>
#include<algorithm>
#include<stdio.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int main(){
int m,n,i,j;
str s;
fin>>m>>n;
for(i=1;i<m;i++){
for(j=1;j<=2;j++)fin>>a[i][j];
}
return 0;
}