1319.txt

北大ACM题目例程 详细的解答过程 程序实现 算法分析

#include"stdio.h"
#include"math.h"

const double l = sqrt(3)/2;
int calc( double x, double y )
{
	int a[2], s, i;
	double h;
	if( x < 1 )
		return 0;
	a[0] = (int)x;
	a[1] = (int)(x-0.5);
	for( i=0, h=1, s=0; h<=y; h+=l, i++ )
		s += a[i%2];
	return s;
}
int main( )
{
	int s1, s2, t;	
	double x, y;
	while( scanf( "%lf %lf", &x, &y ) == 2 )
	{
		s1 = (int)x * (int)y;
		s2 = calc( x, y );
		if( ( t = calc( y, x ) ) > s2 )
			s2 = t;

		if( s1 >= s2 )
			printf( "%d grid\n", s1 );
		else
			printf( "%d skew\n", s2 );
	}
	return 0;
}