【POJ3299】Humidex（简单的数学推导）

公式题中已经给出，直接求解即可。

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <algorithm>
#include <numeric>
#include <sstream>
#include <map>
#include <iomanip>
using namespace std;

map<char, double> data;

int main () {
    ios :: sync_with_stdio (false);
    char C1, C2;
    double X1, X2;
    while (cin >> C1) {
        if (C1 == 'E') break;
        cin >> X1 >> C2 >> X2;
        data[C1] = X1; data[C2] = X2;
        if ( (C1 == 'T' && C2 == 'H') || (C1 == 'H' && C2 == 'T') ) {
            double h = data['H'] - data['T'];
            double e = h / 0.5555 + 10.0;
            double ln_ = log (e / 6.11);
            data['D'] = 1.0 / (1.0 / 273.16 - ln_ / 5417.7536) - 273.16;
        }
        else {

            double e = 6.11 * exp (5417.7530 * (1.0 / 273.16 - (1.0 / (data['D'] + 273.16))));
            //cout << "e = " << e << endl;
            double h = (0.5555) * (e - 10.0);
            //cout << "h = " << h << endl;
            if ((C1 == 'T' && C2 == 'D' ) || (C1 == 'D' && C2 == 'T')) {
                //cout << "T D -> H" << endl;
                data['H'] = data['T'] + h;
            }
            if ((C1 == 'H' && C2 == 'D' ) || (C1 == 'D' && C2 == 'H')) {
                //cout << "H D -> T" << endl;
                data['T'] = data['H'] - h;
            }
        }
        printf ("T %.1f D %.1f H %.1f
", data['T'], data['D'], data['H']);
    }
    return 0;
}