Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- #define optimizar ios_base::sync_with_stdio(0); cin.tie(0)
- #define lld long long int
- #define MAXN 52
- using namespace std;
- lld resp = 1;
- int n, m;
- int x, y;
- int fa[MAXN];
- vector < int > lista[MAXN];
- int busca(int x) {
- while (x != fa[x])
- x = fa[x];
- return x;
- }
- int main()
- {
- optimizar;
- cin >> n >> m;
- for (int i = 1; i <= n; i++)
- fa[i] = i;
- while (m--) {
- cin >> x >> y;
- int fa_x = busca(x);
- int fa_y = busca(y);
- fa[fa_x] = fa_y;
- }
- lld resp = (1LL << n);
- for (int i = 1; i <= n; i++) {
- if (busca(i) == i)
- resp >>= 1;
- }
- cout << resp << "\n";
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement