-
Notifications
You must be signed in to change notification settings - Fork 10
/
MCOINS.cpp
43 lines (35 loc) 路 977 Bytes
/
MCOINS.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef unsigned long long ull;
#define X first
#define Y second
#define pb push_back
#define mp make_pair
#define ep emplace_back
#define EL printf("\n")
#define sz(A) (int) A.size()
#define FOR(i,l,r) for (int i=l;i<=r;i++)
#define FOD(i,r,l) for (int i=r;i>=l;i--)
#define fillchar(a,x) memset(a, x, sizeof (a))
#define faster ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int n[100],m,k,l,f[1000001],maxn;
int main() {
// freopen("INP.TXT", "r", stdin);
// freopen("OUT.TXT", "w", stdout);
scanf("%d%d%d",&k,&l,&m);
for (int i=1; i<=m; i++) {
scanf("%d",&n[i]);
maxn = max(n[i],maxn);
}
for (int i=1; i<=maxn; i++) {
if (i-1 >= 0 and f[i-1] == 0) f[i] = 1;
if (i-k >= 0 and f[i-k] == 0) f[i] = 1;
if (i-l >= 0 and f[i-l] == 0) f[i] = 1;
}
for (int i=1; i<=m; i++)
if (f[n[i]] == 1) printf("A");
else printf("B");
return 0;
}