zoj 1037 最短路

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=37

找规律，水题

#include<iostream>
#include<cmath>
#include<iomanip>
using namespace std;

int main()
{
          int n;
          cin>>n;
          for(int i = 1;i<=n;i++)
          {
                    cout<<"Scenario #"<<i<<":
";
                    int m,n;
                    cin>>m>>n;
                    double d;
                    if(m%2==0 || n%2 == 0)
                              d = m*n;
                    else
                              d = m*n-1+sqrt(2);
                    cout<<fixed<<setprecision(2)<<d<<endl<<endl;
          }
}