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 = ;i<=n;i++)
           {
                     cout<<"Scenario #"<<i<<":\n";
                     int m,n;
                     cin>>m>>n;
                     double d;
                     if(m%== || n% == )
                               d = m*n;
                     else
                               d = m*n-+sqrt();
                     cout<<fixed<<setprecision()<<d<<endl<<endl;
           }
 }