算法之路三：HDU OJ:2009

#include<stdio.h>#include<math.h>#define maxn 1005int main(){    int m,n;    double a[maxn];    while(scanf("%d%d",&n,&m)!=EOF)    {        a[0]=double(n);        double ans=a[0];        for(int i=1;i<m;i++)        {            a[i]=sqrt(a[i-1]);            ans+=a[i];        }        printf("%.2lf\n",ans);    }    return 0;}