Cod sursa(job #989687)
| Utilizator | Data | 26 august 2013 12:09:10 | |
|---|---|---|---|
| Problema | BFS - Parcurgere in latime | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.28 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,i,j,start,a[2000][2000];
int main()
{
f>>n>>m>>start;
for(; m; m--)
{
f>>i>>j
a[i][j]=1;
}
return 0;
}
