Submission #2388406

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<string>
#include<cstring>
using namespace std;

int main()
{
	int i, j, k, l, m, X, N, M,flag;
	char S1[53],S2[53];
	cin >> N;
	cin >> S1>>S2;
	k = l = 0;
	i = 0;
	flag = 0;
	long long int sum = 1;
	if (N == 1) {
		cout << "2" << endl;
	}
	else if (S1[0] == S2[1]) {
		sum *= 3;
		i = 2;
	while (i < N-1) {
		if (S1[i] = S1[i + 1]) {
			i += 2;
			if (flag == 0) {
				sum *= 2;
			}
			else
				sum *= 3;
			if (sum > 1000000007)
				sum %= 1000000007;
			flag = 1;
		}
		else {
			i += 1;
			if (flag == 0)
				sum *= 2;
			else
				sum *= 1;
			if (sum > 1000000007)
				sum %= 1000000007;
			flag = 0;
		}

		}
	cout << sum << endl;
	}
	else {
		sum *= 3;
		i = 1;
		while (i < N ) {
			if (S1[i] = S1[i + 1]) {
				i += 2;
				if (flag == 0)
					sum *= 2;
				else
					sum *= 3;
				if (sum > 1000000007)
					sum %= 1000000007;
				flag = 1;
			}
			else {
				i += 1;
				if (flag == 0)
					sum *= 2;
				else
					sum *= 1;
				if (sum > 1000000007)
					sum %= 1000000007;
				flag = 0;
			}

		}
		cout << sum << endl;
	}
	

    return 0;
}

Submission Info

Judge Result