HDU Multi-School League 5363 Key Set

HDU Multi-School League 5363 Key Set

Title: http://acm.hdu.edu.cn/showproblem.php?pid=5363

According to the example given above, we get the formula FN = 2^ (n-1)-1, the data quantity is large, and the actual power is obtained.

Can be solved by divide-and-conquer method, Complexity O (NLOGN)

Divide and conquer the method of fast power # include <bits/stdc++.h>using namespace std;typedef unsigned long long ull;const int MOD = 1000000007;ull Getans (ull A, int n) {    if (n==0)        return 1;    if (n==1)        return A;    else    {        a%= MOD;        ull res = a*a;        Res%= MOD;        if (n%2 = = 0)        {            return Getans (res, N/2)%mod;        }        else        {            return (Getans (res, N/2) *a)%mod;        }    }} int main (void) {    //freopen ("In.txt", "R", stdin);    int t = 0;    scanf ("%d", &t);    Ull a = 2;    while (t--)    {        int n = 0;        scanf ("%d", &n);        printf ("%lld\n", Getans (A, n-1)-1);     2^ (n-1)-1    }    return 0;}

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced. Http://blog.csdn.net/core__code

HDU Multi-School League 5363 Key Set