[2016-04-14][codeforces][630][B][Moore's Law]

• 时间:2016-04-14 18:38:28 星期四

• 题目编号:[2016-04-14][codeforces][630][B][Moore’s Law]

• 题目大意:求[Math Processing Error]$n\ast {1.000000011}^p$

• 分析:p特别大,用快速幂算法

#include<cstdio>
using namespace std;
double base = 1.000000011;
double mpow(double a,int p){
        double ans = 1;
        while(p > 0 ){
                if(p & 1){
                        ans = ans * a;
                }
                p >>= 1;
                a = a * a;
        }
        return ans;
}
int main(){
        int n,p;
        scanf("%d%d",&n,&p);
        printf("%.7f\n",n * mpow(base,p));
        return 0;
}

来自为知笔记(Wiz)