266A - Stones on the Table - CodeForces Solution

implementation *800

Please click on ads to support us..

Python Code: 

N = int(input())
col = input()

count =0
for i in range(0,len(col)-1):
    if col[i] == col[i+1]:
        count+=1
    else:
        continue
print(count)

C++ Code: 

#include <iostream>
#include <string>



using namespace std;






int main(){
	int n,c=0;
	string str;
	cin>>n>>str;

	for(int i=0;i<n-1;i++){
		if(str[i]==str[i+1]){
			c++;
		}
	}
	cout<<c;
	return 0;
}


Comments

Submit
0 Comments
More Questions

478A - Initial Bet
981A - Antipalindrome
365A - Good Number
1204B - Mislove Has Lost an Array
1409D - Decrease the Sum of Digits
1476E - Pattern Matching
1107A - Digits Sequence Dividing
1348A - Phoenix and Balance
1343B - Balanced Array
1186A - Vus the Cossack and a Contest
1494A - ABC String
1606A - AB Balance
1658C - Shinju and the Lost Permutation
1547C - Pair Programming
550A - Two Substrings
797B - Odd sum
1093A - Dice Rolling
1360B - Honest Coach
1399C - Boats Competition
1609C - Complex Market Analysis
1657E - Star MST
1143B - Nirvana
1285A - Mezo Playing Zoma
919B - Perfect Number
894A - QAQ
1551A - Polycarp and Coins
313A - Ilya and Bank Account
1469A - Regular Bracket Sequence
919C - Seat Arrangements
1634A - Reverse and Concatenate