hdu 3461 Code Lock

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<queue>
#include<algorithm>
#include<map>
#include<iomanip>
#include<climits>
#include<string.h>
#include<numeric>
#include<cmath>
#include<stdlib.h>
#include<vector>
#include<stack>
#include<set>
#define FOR(x, b, e)  for(int x=b;x<=(e);x++)
#define REP(x, n)     for(int x=0;x<(n);x++)
#define MAXN 100010
#define maxn 1000010
#define Mod 1000007
#define N 1010
using namespace std;
typedef long long LL;

int n, m;
int fa[10000010];
int cnt;

int findset(int x)
{
    return fa[x] = fa[x] == x? x:findset(fa[x]);
}

void merge(int a, int b)
{
    int x = findset(a);
    int y = findset(b);
    if (x != y) {
        fa[x] = y;
        cnt++;
    }
}

LL quick_pow(int n) 
{
    LL tmp = 26,sum = 1;
    while (n) {
        if (n & 1) sum = (sum * tmp) % 1000000007; 
        tmp = (tmp * tmp) % 1000000007;
        n >>= 1;
    }
    return sum % 1000000007;
}

int main()
{
    int l, r;
    while (cin >> n >> m) {    
        cnt = 0;
        FOR(i,0,n) fa[i] = i;
        FOR(i,1,m) {
            cin >> l >> r;
            merge(l-1,r);
        }
        cout << quick_pow(n - cnt) << endl;
    }
    return 0;
}