eeennn0504的专栏

Round A APAC Test 2016 Problem A. Googol String Problem A "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:

其实题目（见下）很简单，唯一的问题是边长最大可取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;