![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Google Code Jam
文章平均质量分 69
烫烫烫
这个作者很懒,什么都没留下…
展开
-
Round A APAC Test 2016 Problem A. Googol String
Round A APAC Test 2016 Problem A. Googol StringProblemA "0/1 string" is a string in which every character is either 0 or 1. There are two operations that can be performed on a 0/1 string:原创 2015-09-18 11:35:43 · 784 阅读 · 0 评论 -
Round A APAC Test 2016: Problem B. gCube
其实题目(见下)很简单,唯一的问题是边长最大可取10^9,计算的时候要小心溢出两种解决方法:1, 先开方在做乘法2. 取对数后计算我用的第二种, long double *a, t, sum = 0; unsigned int l, r; fin >> N >> M; a = new long double[N]; for (size_t i = 0;原创 2015-09-19 16:06:17 · 530 阅读 · 0 评论