杭电ACM2011：多项式求和

#include <iostream>
using namespace std;
int main(){
    int m;
    int a[1000];
    cin >> m;
    for (int i = 0; i < m; i++) cin >> a[i];
    double s = 0, t;
    for (int i = 0; i < m; i++){
        for (int j = 1; j <= a[i]; j++){
            if (j % 2 == 1) t = (double)1 / j;  //类型转换，后面不能括；
            else  t = -(double)1 / j;
            s += t;
        }
        cout.precision(2);
        cout << fixed << s << endl;
        s = 0;
    }   
    return 0;
}

#include <iostream>
using namespace std;
int main(){
    int n, m;
    double s = 0, t;
    cin >> m;
    while (m){
        cin >> n;
        for (int i = 1; i <= n; i++){
            if (i % 2 == 1) t = (double)1 / i;
            else t = -(double)1 / i;
            s += t;
        }
        cout.precision(2);
        cout << fixed << s << endl;
        s = 0;
        m--;
    }
    return 0;
}