2566.cpp

HDOJ2501-2681acm解题报告

#include<iostream>
using namespace std;
int main()
{
	int n,m,i,j,k,n1,n2,n5,cnt,ca;
	while(scanf("%d",&ca)!=EOF)
	{
		while(ca--)
		{
			cnt=0;
			scanf("%d%d",&n,&m);
			for(n5=0;n5*5<=m;n5++)
				for(n2=0;n2*2+n5*5<=m;n2++)
				{
					n1 = m - n5*5 - n2*2;
					if(n1 +n2*2+n5*5 == m && n1 +n2+n5 ==n)
						cnt++;
				}
			printf("%d\n",cnt);
		}
	}
}