A

# include <bits/stdc++.h>

using namespace std;
int n,x;
long long ans=1;
int main() {
	cin >> x >> n;
	for (int i=1; i<=n; ++i) ans += ans*x; 
	cout << ans;
} 

B

# include <bits/stdc++.h>

using namespace std;

int T,n,m,f[110][110],x;

int main() {
	cin >> T;
	while (T--) {
		cin >> n >> m;
		for (int i=1; i<=n; ++i)
			for (int j=1; j<=m; ++j){
				cin >> x;
				f[i][j] = x;
				if (i > 1) f[i][j] = max(f[i][j], f[i-1][j]+x);
				if (j > 1) f[i][j] = max(f[i][j], f[i][j-1]+x);
			}
		cout << f[n][m] << "\n";
	}
} 

C

# include <bits/stdc++.h>

using namespace std;

int n,f[10010];
bool v[10010];

int main() {
	cin >> n;
	f[1] = f[2] = 1;
	v[1] = 1;
	for (int i=3;; ++i) {
		f[i] = f[i-1]+f[i-2];
		if (f[i] > n) break;
		v[f[i]] = 1;
	}
	for (int i=1; i<=n; ++i) if (v[i]) cout <<"Y";
	else cout << "N";
} 

D

# include <bits/stdc++.h>
# define mod 21474836
using namespace std;

int n,a[110];
long long ans;
int main() {
	cin >> n;
	for (int i=1; i<=n; ++i) {
		cin >> a[i];
		ans += 1ll*i*(a[i]-1);
	} 
	cout << ans+n;
} 

E

# include <bits/stdc++.h>
# define mod 21474836
using namespace std;

int n,f[200],ans;

int main() {
	cin >> n;
	f[0] = 1;
	for (int i=1; i<=n; ++i) {
		(f[i] += f[i-3]*2%mod) %= mod;
		(f[i] += f[i-4]*2%mod) %= mod;
	}
	for (int i=n; i>=n-3; --i) {
		if (i >= 0) (ans += f[i]) %= mod;
	}
	cout << ans;
}