1241.cpp

来自「ZOJ 动态规划算法题目入门与提高 源代码」· C++ 代码 · 共 37 行

#include<iostream>
#include<cmath>
#include<iomanip>
using namespace std;
int main()
{
    double a,b,c;
    int line=1;
    while(cin>>a>>b>>c&&a&&b&&c)
    {
        if(a==-1)
        {
             cout<<"Triangle #"<<line<<'\n';
             if(c>b)
                 cout<<"a = "<<fixed<<setprecision(3)<<sqrt(c*c-b*b)<<'\n';
             else
                 cout<<"Impossible.\n";   
        }
        else if(b==-1)
        {
             cout<<"Triangle #"<<line<<'\n';
             if(c>a)
                 cout<<"b = "<<fixed<<setprecision(3)<<sqrt(c*c-a*a)<<'\n';
             else
                 cout<<"Impossible.\n";  
        }
        else if(c==-1)
        {
             cout<<"Triangle #"<<line<<'\n';
             cout<<"c = "<<fixed<<setprecision(3)<<sqrt(a*a+b*b)<<'\n';
        }   
        cout<<'\n';
        line++;                         
    } 

}