Submission #2180619

---

Source Code Expand

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int N;
int a[10];
int index(int n, int m) {
	int a = 1;
	for (int i = 0; i < n - 1; ++i) {
		a *= m;
	}
	return a;
}
int main() {
	cin >> N;
	int even = 0;
	for (int i = 0; i < N; ++i) {
		cin >> a[i];
		if (a[i] % 2 == 0) even++;
	}
	if (a[0] % 2 == 0) {
		cout << index(N , 3) * 3 - index(even, 2)*2 << endl;
	}
	else if (a[0] % 2 != 0) {
		cout << index(N , 3) * 3 - index(even, 2) << endl;
	}
	return 0;
}

Submission Info

Judge Result