1975004_ac_0ms_24k.c

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

# include <stdio.h>

int min(int a, int b)
{
	return a>b?b:a;
}

int solve(int *a)
{
	int i, count;

	count = 0;
	for(i = 0; i < 20; i++)
	{
		if(a[i])
		{
			count++;
			if(i<18)
				a[i+2] = !a[i+2];
			if(i<19)
				a[i+1] = !a[i+1];
		}
	}
	return count;
}

int main()
{
	int i;
	int a[20], b[20];

	for(i = 0; i < 20; i++)
	{
		scanf("%d",&a[i]);
		b[19-i] = a[i];
	}
	printf("%d",min(solve(a),solve(b)));
	return 1;
}