HDU1046 找规律

#include <iostream>
#include <cstdio>
#include <map>
#include <queue>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
#define long long
#define INF 0x3f3f3f
using namespace std;
int main()
{
	int T;
	cin >> T;
	int cnt=1;
	while(T--)
	{
		int m,n;
		cin >> m >> n;
		printf("Scenario #%d:\n",cnt);
		cnt++;
		if(m*n & 1)
			printf("%.2lf\n\n",0.41+(double)m*n);
		else 
			printf("%.2lf\n\n",(double)m*n);
	}	
	return 0;
}