Submission #2855917

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define SIZE(x) ((int)(x).size())
#define UQ(v) v.erase(unique(v,begin(),v,end()),v.end());
ll INF = 1LL <<61;
#define pb push_back 
int dxy4[5] = { 0,1,0,-1,0 };
int dxy8[9] = { 0,1,1,0,-1,1,-1,-1,0 };
int gcd(int a, int b) { return min(a,b) ? gcd(min(a,b), max(a,b)%min(a,b)) : max(a,b); }
ll mod7 = 1000000007;
ll mod9 = 1000000009;
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for(int i = 0; i < n; i++)
#define FOR(i,x,n) for(int i=x;i<n;++i)
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define YES cout<<"YES"<<endl
#define NO cout<<"NO"<<endl
#define print(x) cout<<x<<endl;
#define wait int xxxxxxx;cin>>xxxxxxx;
//vector< vector<int> > v (max1, vector<in t>(max2) );

int a[100];
int main(){
	int n,ans = 0;
	cin >> n;
	rep(i, n)cin >> a[i];
	rep(i, n) {
		if (i == 0)continue;
		if (a[i] == a[i - 1]) {
			a[i] = -1;
			ans++;
		}
	}
	print(ans);
	wait;
	return 0;
}

Submission Info

Judge Result