la 3078

#include <iostream>#include <algorithm>#include <cmath>#include <iomanip>#include <stdio.h>using namespace std;double d[100000],p[100000];int main(){    int n,m;    while(cin>>n>>m)    {        double k=10000;        double x=k/n,y=0;        int i;        for(i=1;i<n;i++)        {            y=y+x;            d[i]=y;        }        x=k/(m+n);y=0;        for(i=1;i<(m+n);i++)        {            y=y+x;            p[i]=y;        }        int j;        y=0.0;double l;        for(i=1;i<n;i++)        {            l=10000;            for(j=1;j<(m+n);j++)            {                double r;                r=fabs(d[i]-p[j]);                if(r<l) l=r;                else break;            }            y+=l;        }        printf("%.4lf\n",y);    }    return 0;}