2882587_wa.cpp

北大大牛代码 1240道题的原代码 超级权威

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

int max(int a,int b)
{
	return a < b ? b : a;
}

int s[1010001];

int main()
{
	int cas, num, m, no;
	int a, b, c, d, t, ans;

	scanf("%d",&cas);
	while(cas--)
	{
		scanf("%d%d%d%d",&a,&b,&c,&d);
		num = 0;
		memset(s,0,sizeof(s));
		s[0] = 1;
		m = max(max(a,b),max(c,d));
		no = 0;
		for(t = 1; t <= 1000000+m+1&&no < m; t++)
		{
			if(t<=m)
			{
				if(t==a||t==b||t==c||t==d)
					s[t] = 1;
				else
					s[t] = 0;
			}
			else
				s[t] = s[t-a]||s[t-b]||s[t-c]||s[t-d];
			if(s[t]==0)
			{
				no = 0;
				num++;
				ans = t;
				if(ans>1000000)
				{
					num--;
					break;
				}
			}
			else
				no++;
		}
		printf("%d\n",num);
		if(no>=m)
			printf("%d\n",ans);
		else
			printf("-1\n");
	}
	return 0;
}