Submission #3605568

---

Source Code Expand

	#include <bits/stdc++.h>
	using namespace std;
	#define IOS ios::sync_with_stdio(false), cin.tie(0)
	#define REP(i, n) for (int i = 0; i < n; i++)
	#define FOR(i, a, b) for (int i = a; i < b; i++)
	#define ALL(x) (x).begin(), (x).end()
	#define dump(x) cout << (x) << endl
	#define LMAX 9223372036854775807LL
	#define LMIN -9223372036854775807LL

	using ll = long long;
	template<typename T>
	using vec = vector<T>;
	using P = pair<ll, ll>;

	template <typename A, size_t N, typename T>
	void Fill(A (&array)[N], const T &val){
		fill((T *)array, (T *)(array + N), val);
	}
	
	const ll INF = 1e16;
	const ll MOD = 1e9 + 7;

	//int dx[4] = {1,0,-1,0};
	//int dy[4] = {0,1,0,-1};
	//ll pas[51][52];

	signed main(){
		IOS;
		int n;
		cin >> n;
		vec<string> s(2);
		cin >> s[0] >> s[1];
		ll ans = 1;
		for(int i = 0;i < n;i++){
			if(s[0][i] == s[1][i]){
				if(i == 0){
					ans = 3;
				}
				else{
					if(s[0][i - 1] == s[1][i - 1])ans *= 2;					
					ans %= MOD;
				}
			}
			else{
				if(i == 0){
					ans = 6;
				}
				else {
					if(s[0][i - 1] == s[1][i - 1])ans *= 2;
					else ans *= 3;
					ans %= MOD;
				}
				i++;
			}
		}
		dump(ans);
	}

Submission Info

Judge Result