Codeforces Beta Round #46 (Div. 2) D. Game（枚举）

题意：给你一个长度为N的01字符串，他可以修改0为1，或者修改1为0，修改完之后两两之间的字符互不相同，问你最小的修改步数，如果不可能修改成功输出-1.

题解：这竟然是D题，这是我见过的最水的D题，看似博弈，其实是个水题，

只有两张情况，要么01010101***，要么10101010***。

然后暴力。。暂且给这篇文章放博弈论里，充个数~。

简单附代码：

#include <iostream>
#include <algorithm>
#include <cmath>
#define inf 0x3f3f3f3f
#define Pair pair<int,int>
#define int long long
#define fir first
#define sec second
namespace fastIO {
#define BUF_SIZE 100000
#define OUT_SIZE 100000
	//fread->read
	bool IOerror = 0;
	//inline char nc(){char ch=getchar();if(ch==-1)IOerror=1;return ch;}
	inline char nc() {
		static char buf[BUF_SIZE], * p1 = buf + BUF_SIZE, * pend = buf + BUF_SIZE;
		if (p1 == pend) {
			p1 = buf; pend = buf + fread(buf, 1, BUF_SIZE, stdin);
			if (pend == p1) { IOerror = 1; return -1; }
		}
		return *p1++;
	}
	inline bool blank(char ch) { return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t'; }
	template<class T> inline bool read(T& x) {
		bool sign = 0; char ch = nc(); x = 0;
		for (; blank(ch); ch = nc());
		if (IOerror)return false;
		if (ch == '-')sign = 1, ch = nc();
		for (; ch >= '0' && ch <= '9'; ch = nc())x = x * 10 + ch - '0';
		if (sign)x = -x;
		return true;
	}
	inline bool read(double& x) {
		bool sign = 0; char ch = nc(); x = 0;
		for (; blank(ch); ch = nc());
		if (IOerror)return false;
		if (ch == '-')sign = 1, ch = nc();
		for (; ch >= '0' && ch <= '9'; ch = nc())x = x * 10 + ch - '0';
		if (ch == '.') { double tmp = 1; ch = nc(); for (; ch >= '0' && ch <= '9'; ch = nc())tmp /= 10.0, x += tmp * (ch - '0'); }
		if (sign)x = -x; return true;
	}
	inline bool read(char* s) {
		char ch = nc();
		for (; blank(ch); ch = nc());
		if (IOerror)return false;
		for (; !blank(ch) && !IOerror; ch = nc())* s++ = ch;
		*s = 0;
		return true;
	}
	inline bool read(char& c) {
		for (c = nc(); blank(c); c = nc());
		if (IOerror) { c = -1; return false; }
		return true;
	}
	template<class T, class... U>bool read(T& h, U& ... t) { return read(h) && read(t...); }
#undef OUT_SIZE
#undef BUF_SIZE
}; using namespace fastIO; using namespace std;

const int N = 1e3 + 5;
const double eps = 1e-7;
const double pi = acos(-1.0);
const int mod = 998244353;

char str[N];
signed main() {
	int n; read(n);
	read(str + 1);

	/*0 1 0 1*/
	int z = 0, o = 0;
	for (int i = 1; i <= n; i++) {
		if (i % 2 && str[i] == '1')o++;
		if (i % 2 == 0 && str[i] == '0')z++;
	}
	int res = o + z;

	/*1 0 1 0*/
	z = 0; o = 0;
	for (int i = 1; i <= n; i++) {
		if (i % 2 && str[i] == '0')z++;
		if (i % 2 == 0 && str[i] == '1')o++;
	}
	res = min(res, o + z);

	printf("%lld\n", res);
	return 0;
}