bzoj2056 gift? 高精度？

最新推荐文章于 2018-11-21 10:53:00 发布

wanherun

最新推荐文章于 2018-11-21 10:53:00 发布

阅读量237

点赞数

分类专栏：刷题总结技巧

本文链接：https://blog.csdn.net/wanherun/article/details/78090054

版权

刷题总结同时被 2 个专栏收录

285 篇文章 0 订阅

订阅专栏

技巧

35 篇文章 0 订阅

订阅专栏

题目

高精度（滑稽

我们发现，只有极限数据爆unsigned long long ，特判一下即可。

#include<cstdio>
using namespace std;
int main()
{
     int T;
     scanf("%d",&T);
     while(T>0)
     {
          T--;
          unsigned long long a,b,c,d,e,f,g,h,i;
          unsigned long long lim=(unsigned long long)9223372036*(unsigned long long)1000000000+(unsigned long long)854775808;
          scanf("%llu%llu%llu%llu%llu%llu%llu%llu%llu",&a,&b,&c,&d,&e,&f,&g,&h,&i);
          if(a+b+c+d+e+f+g+h==60*8&&i==lim)
               printf("18446744073709551616\n");
          else
          {
               unsigned long long ans=i,t=1;
               for(i=1;i<=a;i++)
                    t*=(unsigned long long)2;
               ans+=t;
               t=1;
               for(i=1;i<=b;i++)
                    t*=(unsigned long long)2;
               ans+=t;
               t=1;
               for(i=1;i<=c;i++)
                    t*=(unsigned long long)2;
               ans+=t;
               t=1;
               for(i=1;i<=d;i++)
                    t*=(unsigned long long)2;
               ans+=t;
               t=1;
               for(i=1;i<=e;i++)
                    t*=(unsigned long long)2;
               ans+=t;
               t=1;
               for(i=1;i<=f;i++)
                    t*=(unsigned long long)2;
               ans+=t;
               t=1;
               for(i=1;i<=g;i++)
                    t*=(unsigned long long)2;
               ans+=t;
               t=1;
               for(i=1;i<=h;i++)
                    t*=(unsigned long long)2;
               ans+=t;
               printf("%llu\n",ans);
          }
     }
     return 0;
}