Round A APAC Test 2016: Problem B. gCube
来源:互联网 发布:织梦cms加千牛云教程 编辑:程序博客网 时间:2024/05/21 13:42
其实题目(见下)很简单,唯一的问题是边长最大可取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; i < N; i++){fin >> t;a[i] = log(t);}for (size_t i = 0; i < M; i++){fin >> l >> r;sum = 0;for (size_t j = l; j <= r; j++){sum += a[j];}fout << setiosflags(ios::fixed) << setprecision(7) << expl(sum / (r - l + 1)) << endl;}
附题目:
Problem B. gCube
Googlers are very interested in cubes, but they are bored with normal three-dimensional cubes and also want to think about other kinds of cubes! A "D-dimensional cube" has D dimensions, all of equal length. (D may be any positive integer; for example, a 1-dimensional cube is a line segment, and a 2-dimensional cube is a square, and a 4-dimensional cube is a hypercube.) A "D-dimensional cuboid" has D dimensions, but they might not all have the same lengths.
Suppose we have an N-dimensional cuboid. The N dimensions are numbered in order (0, 1, 2, ..., N - 1), and each dimension has a certain length. We want to solve many subproblems of this type:
1. Take all consecutive dimensions between the Li-th dimension and Ri-th dimension, inclusive.
2. Use those dimensions to form a D-dimensional cuboid, where D = Ri - Li + 1. (For example, if Li = 3 and Ri = 6, we would form a 4-dimensional cuboid using the 3rd, 4th, 5th, and 6th dimensions of our N-dimensional cuboid.)
3. Reshape it into a D-dimensional cube that has exactly the same volume as that D-dimensional cuboid, and find the edge length of that cube.
Each test case will have M subproblems like this, all of which use the same original N-dimensional cuboid.
Input
The first line of the input gives the number of test cases, T. T test cases follow.
Each test case begins with two integers N and M; N is the number of dimensions and M is the number of queries. Then there is one line with N positive integers ai, which are the lengths of the dimensions, in order. Then, M lines follow. In the ith line, there are two integers Li and Ri, which give the range of dimensions to use for the ith subproblem.
Output
For each test case, output one line containing "Case #x:", where x is the test case number (starting from 1). After that, output M lines, where the ith line has the edge length for the ith subproblem. An edge length will be considered correct if it is within an absolute error of 10-6 of the correct answer. See the FAQ for an explanation of what that means, and what formats of real numbers we accept.
Limits
1 ≤ T ≤ 100.
1 ≤ ai ≤ 109.
0 ≤ Li ≤ Ri < N.
Small dataset
1 ≤ N ≤ 10.
1 ≤ M ≤ 10.
Large dataset
1 ≤ N ≤ 1000.
1 ≤ M ≤ 100.
Sample
- Round A APAC Test 2016 Problem B. gCube
- Round A APAC Test 2016: Problem B. gCube
- Problem B. gCube Google APAC 2016 University Test Round A
- Problem A. Travel Google APAC 2016 University Test Round B
- Google APAC test 2015 Round B Problem A - Password Attacker
- Round B APAC Test 2017 Problem A. Sherlock and Parentheses
- Problem B. Rain Google APAC 2017 University Test Round A
- Round A APAC Test 2017 Problem B.Rain
- Problem B. gWheels Google APAC 2016 University Test Round B
- Round A APAC Test 2016 Problem A. Googol String
- Round A APAC Test 2016 Problem A. Googol String
- Problem B. gFiles Google APAC 2016 University Test Round C
- Problem B. gBalloon Google APAC 2016 University Test Round D
- Problem C. gNumbers Google APAC 2016 University Test Round B
- Round B APAC Test 2016
- Round A APAC Test 2016 Problem C. gCampus 最短路
- Problem A. gRanks Google APAC 2016 University Test Round C
- Problem C. gCampus Google APAC 2016 University Test Round A
- 自定义ViewGroup
- 顺序表的基本运算2
- NYIST OJ 1000 又见Fibonacci数列
- Guava(四):集合基础总结之Map
- Struts2:命名空间的使用
- Round A APAC Test 2016: Problem B. gCube
- 递归和非递归实现链表反转
- 点评系统 Modoer v3.6 旗舰版手机WEB端加微信公众平台接口
- 有关博客的一些断想
- MySQL中查看自带的SQL模式
- java学习之异常
- Java接口(interface)
- Java单例类进阶
- 脏话过滤器