zoj1037-Gridland

这题根据特性可以显性计算

#include<iostream>
using namespace std;
int main()
{
	int n,m,icase,k=0;
	double *text;
	cin>>icase;
	k=icase;
	text=new double[icase];
	while(icase--)
	{
		cin>>m>>n;
		if(m%2!=0&&n%2!=0)
			text[icase]=m*n+0.41;
		else
			text[icase]=m*n;
	}
	for(int i=0;i<k;i++)
	{
		cout.setf(ios::fixed);
		cout.precision(2);
		cout<<"Scenario #"<<i+1<<':'<<endl<<text[k-i-1]<<endl<<endl;
	}
	return 0;
}