zoukankan      html  css  js  c++  java
  • Codeforces Round #313 (Div. 2)C. Gerald's Hexagon

    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
    Copy
    1 1 1 1 1 1
    
    output
    6
    
    input
    Copy
    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:

    十分水的c题。。算出六边形面积除以单个三角形面积即可

    /* ***********************************************
    Author        :ACagain
    Created Time  :2018/3/29 18:50:48
    File Name     :3_29.cpp
    ************************************************ */
    
    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    #include <string>
    #include <stack>
    #include <cmath>
    #include <cstdlib>
    #include <vector>
    #include <queue>
    #include <set>
    #include <map>
    using namespace std;
    
    #define lson o<<1,l,m
    #define rson o<<1|1,m+1,r
    #define pii pair<int,int>
    #define mp make_pair
    #define ll long long
    #define INF 0x3f3f3f3f
    const int maxn=1e3+5;
    int a[6];
    double cal(int t)
    {
    	return sqrt(3)/4*t*t;
    }
    int main()
    {
        std::ios::sync_with_stdio(false);
        std::cin.tie(0);
        //freopen("in.txt","r",stdin);
        //freopen("out.txt","w",stdout);
    	for(int i=0;i<6;i++)
    	  cin>>a[i];
    	cout<<int((cal(a[0]+a[1]+a[2])-cal(a[0])-cal(a[2])-cal(a[4]))/cal(1)+0.5)<<endl;
        return 0;
    }


  • 相关阅读:
    SVN:cannot map the project with svn provider解决办法
    项目管理工具_maven的配置
    servlet,过滤器,监听器,拦截器的区别
    索引
    事务的隔离级别和传播行为
    jbpm工作流
    Hibernate---进度1
    java——反射
    HttpClient
    TCP和UDP并实现socket的简单通信
  • 原文地址:https://www.cnblogs.com/acagain/p/9180716.html
Copyright © 2011-2022 走看看