Pagini recente » Cod sursa (job #1327773) | Cod sursa (job #1694928) | Cod sursa (job #1698406) | Cod sursa (job #1327448) | Cod sursa (job #1698771)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
struct nod
{
vector <int> v;
bool ver=false;
};
nod a[100010];
void dfs(int x)
{
a[x].ver=true;
for(int i=0; i<a[x].v.size(); i++)
{
if(!a[a[x].v[i]].ver)
dfs(a[x].v[i]);
}
}
int main()
{
int n, m;
fin >> n >> m;
for(int i=1; i<=m; i++)
{
int ct, urm;
fin >> ct >> urm;
a[ct].v.push_back(urm);
}
int ct=0;
for(int i=1; i<=n; i++)
{
if(!a[i].ver)
{
dfs(i);
ct++;
}
}
fout << ct;
return 0;
}