Pagini recente » Cod sursa (job #2300104) | Cod sursa (job #1809728) | Cod sursa (job #2357812) | Cod sursa (job #2506953) | Cod sursa (job #25370)
Cod sursa(job #25370)
#include <stdio.h>
int N, K;
long long P;
long long a[50];
int main()
{
int i, j;
freopen("expresii2.in", "r", stdin);
freopen("expresii2.out", "w", stdout);
scanf("%d %d %lld", &N, &K, &P);
a[1] = K;
for (i = 2; i <= N; i++) {
a[i] = a[i-1];
for (j = 1; j < i - 1; j++)
a[i] += 2 * a[j] * a[i - 1 - j];
}
printf("%lld\n", a[N]);
if (N & 1) {
for (i = 1; i <= N / 2 + 1; i++) printf("A");
for (i = 1; i <= N / 2; i++) printf("+");
printf("\n");
} else {
for (i = 1; i <= N / 2; i++) printf("A");
for (i = 1; i < N / 2; i++) printf("+");
printf("!\n");
}
fclose(stdin);
fclose(stdout);
return 0;
}