-
Notifications
You must be signed in to change notification settings - Fork 0
/
254_B. DZY Loves Chemistry.cpp
71 lines (55 loc) · 1.04 KB
/
254_B. DZY Loves Chemistry.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
/*****from dust i have come, dust i will be*****/
#include<bits/stdc++.h>
typedef long long int ll;
#define pp pair<ll,ll>
#define dbg printf("in\n");
#define NL printf("\n");
#define Size 500
#define inf 1000000000000
#define max2(a,b) ((a<b)?b:a)
#define max3(a,b,c) max2(max2(a,b),c)
#define min2(a,b) ((a>b)?b:a)
#define min3(a,b,c) min2(min2(a,b),c)
using namespace std;
vector<ll> adj[Size];
bool vis[Size];
void dfs(ll s)
{
vis[s]=1;
for(int i=0; i<adj[s].size(); i++)
{
if(!vis[adj[s][i]])
dfs(adj[s][i]);
}
}
int main()
{
//freopen("in.txt","r",stdin);
ll i,j,k;
ll n,m;
ll u,v;
cin>>n>>m;
if(n==1)
{
cout<<"1";
return 0;
}
for(i=0; i<m; i++)
{
cin>>u>>v;
adj[u].push_back(v);
adj[v].push_back(u);
}
ll x=0;
memset(vis,0,sizeof(vis));
for(i=1; i<=n; i++)
{
if(!vis[i])
{
dfs(i);
x++;
}
}
cout<<(long long int)pow(2,n-x)<<endl;
return 0;
}