学习笔记 （暴力枚举）洛谷P2241

思路1

//P2241
#include<cstdio>
#include<algorithm>
using namespace std;
long long ans;
int main()
{
	long long n,m,squ=0,rec=0;
	scanf("%lld%lld",&n,&m);
	for(long long i=0;i<=n;++i)
		for(long long j=0;j<=m;++j)
		{
			long long tmp=min(i,j)+min(n-i,j)+min(i,m-j)+min(n-i,m-j);
			squ+=tmp;
			rec+=n*m-tmp;
		}
	printf("%lld %lld\n",squ/4,rec/4);
	return 0;
 } 

思路2

//P2241-2
#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
	long long n,m,squ=0,rec=0;
	scanf("%lld%lld",&n,&m);
	for(long long i=0;i<=n;++i)
		for(long long j=0;j<=m;++j)
			{
				long long tmp=min(i,j);
				squ+=tmp;
				rec+=i*j-tmp;
			}
	printf("%lld %lld",squ,rec);
	return 0;
}