Codeforces Round #809 (Div. 2)
A. Another String Minimization Problem:
#include<cstdio>
#include<cstring>
#include<stdlib.h>
#include<algorithm>
#include<iostream>
#include<vector>
#include<set>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<math.h>
#define ll long long
using namespace std;
const int mod=1e9+7;
const int INF=0x3f3f3f3f;
inline int read()
{
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while(c>='0'&&c<='9'){x=x*10+c-'0',c=getchar();}
return x*f;
}
int a[100],ans[100];
void solve()
{
memset(ans,0,sizeof(ans));
int n=read(),m=read();
for(int i=1;i<=n;i++)a[i]=read();
for(int i=1;i<=n;i++)
{
if(a[i]<m+1-a[i])
{
if(ans[a[i]]==1)ans[m+1-a[i]]=1;
else ans[a[i]]=1;
}
else
{
if(ans[m+1-a[i]]==1)ans[a[i]]=1;
else ans[m+1-a[i]]=1;
}
}
for(int i=1;i<=m;i++)
{
if(ans[i])printf("A");
else printf("B");
}
printf("\n");
}
int main()
{
int T=read();
while(T--){solve();}
return 0;
}
B. Making Towers:
#include<cstdio>
#include<cstring>
#include<stdlib.h>
#include<algorithm>
#include<iostream>
#include<vector>
#include<set>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<math.h>
#define ll long long
using namespace std;
const int mod=1e9+7;
const int INF=0x3f3f3f3f;
inline int read()
{
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while(c>='0'&&c<='9'){