[백준/BOJ/C++] 16018번 Occupy parking

[문제]

You supervise a small parking lot which has N parking spaces.

Yesterday, you recorded which parking spaces were occupied by cars and which were empty.

Today, you recorded the same information.

How many of the parking spaces were occupied both yesterday and today?

[입력]

The first line of input contains the integer N (1 ≤ N ≤ 100). The second and third lines of input contain N characters each. The second line of input records the information about yesterday’s parking spaces, and the third line of input records the information about today’s parking spaces. Each of these 2N characters will either be C to indicate an occupied space or . to indicate it was an empty parking space.

[출력]

Output the number of parking spaces which were occupied yesterday and today.

[Source Code]

#include <stdio.h>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;


int main() {
	string yesterday, today;
	int num;
	cin >> num >> yesterday >> today;
	int count = 0;

	for(int i = 0; i < num; i++){
		if(yesterday[i] == 'C' && today[i] == 'C')
			count++;
	}

	cout << count;
}

[결과 화면]