Sicily 1012. Stacking Cylinders

Source: Internet
Author: User


Time Limit: 1sec memory limit: 32 MB description

Cylinders (e.g. oil drums) (of radius 1 foot) are stacked in a rectangular bin. each cylinder on an upper row rests on two cylinders in the row below. the cylinders in the bottom row rest on the floor. each row has one less cylinder than the row below.


This problem is to write a program to compute the location of the center of the top cylinder from the centers of the cylinders on the bottom row. Computations of intermediate values shocould use double precision.


Inputeach data set will appear in one line of the input. an input line consists of the number, n, of cylinders on the bottom row followed by N floating point values giving the X coordinates of the centers of the cylinders (the Y coordinates are all 1.0 since the cylinders are resting on the floor (y = 0.0 )). the value of N will be between 1 and 10 (aggressive ). the end of input is signaled by a value of N = 0. the distance between adjacent centers will be at least 2.0 (so the cylinders do not overlap) but no more than 3.4 (cylinders at level K will never touch cylinders at level K-2 ). outputthe output for each data set is a line containing the X coordinate of the topmost cylinder rounded to 4 decimal places, a space and the Y coordinate of the topmost cylinder to 4 decimal places. note: To help you check your work, the X-coordinate of the center of the top cylinder shocould be the average of the X-coordinates of the leftmost and rightmost bottom cylinders. sample input copy sample input to clipboard
4 1.0 4.4 7.8 11.21 1.06 1.0 3.0 5.0 7.0 9.0 11.010 1.0 3.0 5.0 7.0 9.0 11.0 13.0 15.0 17.0 20.45 1.0 4.4 7.8 14.6 11.20
Sample output
6.1000 4.16071.0000 1.00006.0000 9.660310.7000 15.91007.8000 5.2143


1. 首先,根据题意,程序的输入就是最底层的球,然后在其上面每层都比下一层少一个球,2. 可以证明,在底层的球每一个和其底层第一个球的横坐标的中点不为都有一个其上面球的横坐标,最后一个球对应最上面一个球, 也就是利用等腰三角形来求解。





#include <iostream>#include <vector>#include <algorithm>#include <cstring>#include <cmath>#include <cstdio>using namespace std;#define RADIUS 2.0int main(int argc, char const *argv[]){    vector<double> xValue;    int pointNum;    double x, y;    while (cin >> pointNum && pointNum != 0) {        xValue.resize(pointNum);        y = RADIUS / 2;        for (int i = 0; i != pointNum; ++i) {            cin >> xValue[i];        }        sort(xValue.begin(), xValue.end());        x = xValue[0];        for (int i = 1; i != pointNum; ++i) {            double preX = x;            x = (xValue[i] - xValue[0]) / 2 + xValue[0]; // 上一层的最左边球的横坐标,注意这个上一层是递增的            preX = x - preX;            y = sqrt(pow(RADIUS, 2) - pow(preX, 2)) + y;  // 上一层的最左边球的纵坐标,注意这个上一层是递增的,利用勾股定理        }        printf("%.4lf %.4lf\n", x, y);    }    return 0;}


Sicily 1012. Stacking Cylinders

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.