zoukankan      html  css  js  c++  java
  • Codeforces 559A(计算几何)

    A. Gerald's Hexagon
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Gerald got a very curious hexagon for his birthday. The boy found out that all the angles of the hexagon are equal to . Then he measured the length of its sides, and found that each of them is equal to an integer number of centimeters. There the properties of the hexagon ended and Gerald decided to draw on it.

    He painted a few lines, parallel to the sides of the hexagon. The lines split the hexagon into regular triangles with sides of 1 centimeter. Now Gerald wonders how many triangles he has got. But there were so many of them that Gerald lost the track of his counting. Help the boy count the triangles.

    Input

    The first and the single line of the input contains 6 space-separated integers a1, a2, a3, a4, a5 and a6 (1 ≤ ai ≤ 1000) — the lengths of the sides of the hexagons in centimeters in the clockwise order. It is guaranteed that the hexagon with the indicated properties and the exactly such sides exists.

    Output

    Print a single integer — the number of triangles with the sides of one 1 centimeter, into which the hexagon is split.

    Examples
    input
    1 1 1 1 1 1
    output
    6
    input
    1 2 1 2 1 2
    output
    13
    Note

    This is what Gerald's hexagon looks like in the first sample:

    And that's what it looks like in the second sample:

    题意:给定一个等角的六边形,用平行与边的线将它切成三角形,问最终切成几个三角形?

    做法:六边形的全部都被分为了小三角形,所以用六边形的面积/三角形的面积就是三角形的数量

    #include<iostream>
    #include<cstdio>
    #include<cmath>
    #include<cstdlib>
    #include<algorithm>
    #include<cstring>
    #include<string>
    #include<vector>
    #include<map>
    #include<set>
    #include<queue>
    using namespace std;
    double a1,a2,a3,a4,a5,a6;
    int main()
    {
        scanf("%lf%lf%lf%lf%lf%lf",&a1,&a2,&a3,&a4,&a5,&a6);
        printf("%d
    ",(int)((a1+a4)*(a2+a3)+a2*a3+a5*a6+0.5));
        return 0;
    }
  • 相关阅读:
    POJ 3259(SPFA判断负环)
    白盒交换机NOS列表(picos/SnapRoute/ONL)
    Wedge 100-32X 100GbE Data Center Switch
    白盒交换机
    cgroup
    内核Linux系统调用的列表zz
    linux系统调用zz
    Linux 内核 tasklet 机制和工作队列zz
    Linux 软中断机制分析zz
    线程的那些事儿zz
  • 原文地址:https://www.cnblogs.com/hnqw1214/p/6602372.html
Copyright © 2011-2022 走看看