zoukankan      html  css  js  c++  java
  • zoj 1241 Geometry Made Simple

    Geometry Made Simple

    Time Limit: 2 Seconds      Memory Limit: 65536 KB

    Mathematics can be so easy when you have a computer. Consider the following example. You probably know that in a right-angled triangle, the length of the three sides a, b, c (where c is the longest side, called the hypotenuse) satisfy the relation a*a+b*b=c*c. This is called Pythagora's Law.

    Here we consider the problem of computing the length of the third side, if two are given.

    Input

    The input contains the descriptions of several triangles. Each description consists of a line containing three integers a, b and c, giving the lengths of the respective sides of a right-angled triangle. Exactly one of the three numbers is equal to -1 (the 'unknown' side), the others are positive (the 'given' sides).

    A description having a=b=c=0 terminates the input.


    Output

    For each triangle description in the input, first output the number of the triangle, as shown in the sample output. Then print "Impossible." if there is no right-angled triangle, that has the 'given' side lengths. Otherwise output the length of the 'unknown' side in the format "s = l", where s is the name of the unknown side (a, b or c), and l is its length. l must be printed exact to three digits to the right of the decimal point.

    Print a blank line after each test case.


    Sample Input

    3 4 -1
    -1 2 7
    5 -1 3
    0 0 0


    Sample Output

    Triangle #1
    c = 5.000

    Triangle #2
    a = 6.708

    Triangle #3
    Impossible.

    勾股定理计算

     1 #include <iostream>
     2 #include <cmath>
     3 #include <cstdio>
     4 using namespace std;
     5 int main(){
     6     double a, b, c;
     7     int t = 1;
     8     cout.precision(3);//有效数字三位 
     9     while(cin >> a >> b >> c){
    10         if((a == 0) && (b == 0) && (c == 0))
    11             break;
    12         cout << "Triangle #" << t++ << endl;
    13         if(a == -1){
    14             if(b > c){
    15                 cout << "Impossible." << endl;
    16             } else {
    17                 a = sqrt(c * c - b * b);
    18                 cout << "a = " << fixed << a << endl;
    19                 //printf("a = %.3lf
    ", a);
    20             }
    21         }
    22         if(b == -1){
    23             if(a > c){
    24                 cout << "Impossible." << endl;
    25             } else {
    26                 b = sqrt(c * c - a * a);
    27                 cout << "b = " << fixed << b << endl;
    28             }
    29         }
    30         if(c == -1){
    31             c = sqrt(a * a + b * b);
    32             cout << "c = " << fixed << c << endl;
    33         }
    34         cout << endl;
    35     }
    36     //system("pause");
    37     return 0;
    38 }
  • 相关阅读:
    百度面试题
    分治法--二分查找、乘方、斐波那契数
    01-11李宁老师学Python视频课程(1):初识Python返回课程
    邮件发送的两种实现方法。
    Docker(一):Docker入门教程
    安装docker及在docker中安装python环境学
    vim编辑器的使用和CentOS有很多不同
    大一编程基础培训]==02-03-04-05课==类型
    大一编程基础培训]==08课==条件判断]==07课==Python的LIST与TUPLE数据类型
    Beautiful Soup 4.2.0 文档¶ BeautifulSoup对象内任何第一个标签入口,使用find()方法。
  • 原文地址:https://www.cnblogs.com/qinduanyinghua/p/6522879.html
Copyright © 2011-2022 走看看