ZOJ 1037 && HDU 1046 Gridland (找规律) - c++编程基础

链接：click here

题意：给你一张图，问你从起点出发，最后回到起点的最短路程

思路：<??http://www.2cto.com/kf/ware/vc/" target="_blank" class="keylink">vcD4KPHA+ICAgICAgICAgtbFuLG3T0NK71d/E3Lm7zqrFvMr9yrGjrL3hufvKx24qbbfx1d+x2NPQ0rvM9cK30OjSqtCx18XX36OsveG5+86qbiptLTEmIzQzOzEuNDE8L3A+CjxwPrT6wuujujwvcD4KPHA+PHByZSBjbGFzcz0="brush:java;">#include #include #include #include #include #include #include #include #include #include #include using namespace std; int a[1000000]; int main() { int ncase,m,i,j=1; cin>>ncase; while(ncase--) { double n,m; cin>>n>>m; printf("Scenario #%d:\n",j++); if((int )n%2==0||(int ) m%2==0) printf("%.2lf\n",n*m); else printf("%.2lf\n",n*m-1+sqrt(2.0)); printf("\n"); } return 0; }