AIM Tech Round 5 (rated, Div. 1 + Div. 2)

A

大模拟。

#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(int i = j;i <= k;++i)
#define repp(i,j,k) for(int i = j;i >= k;--i)
#define rept(i,x) for(int i = linkk[x];i;i = e[i].n)
#define P pair<int,int>
#define Pil pair<int,ll>
#define Pli pair<ll,int>
#define Pll pair<ll,ll>
#define pb push_back 
#define pc putchar
#define mp make_pair
#define file(k) memset(k,0,sizeof(k))
#define ll long long
int n , m;
char a[200][200];
int read()
{
    int sum = 0;char c = getchar();bool flag = true;
    while(c < '0' || c > '9') {if(c == '-') flag = false;c = getchar();}
    while(c >= '0' && c <= '9') sum = sum * 10 + c - 48,c = getchar();
    if(flag) return sum;
    else return -sum;
}
int main()
{
    n = read();m = read();
    rep(i,1,n) rep(j,1,m)
    {
        char c = getchar();
        while(c != 'W' && c != 'B') c = getchar();
        a[i][j] = c;
    }
    int x1 = 0 , y1 = 0;
    rep(i,1,n){ 
        rep(j,1,m) 
        if(a[i][j] == 'B'){ x1 = i , y1 = j;break;}
        if(x1 != 0) break;
    }
    int x2 = 0, y2 = 0;
    rep(j,y1,m) if(a[x1][j] != 'B'){y2 = j-1;break;}
    rep(i,x1,n) if(a[i][y1] != 'B'){x2 = i-1;break;}
    if(x2 == 0) x2 = n;
    if(y2 == 0) y2 = m;
    printf("%d %d\n",(x1+x2)/2,(y1+y2)/2);
    return 0;
}

B

瞎**贪

#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(int i = j;i <= k;++i)
#define repp(i,j,k) for(int i = j;i >= k;--i)
#define rept(i,x) for(int i = linkk[x];i;i = e[i].n)
#define P pair<int,int>
#define Pil pair<int,ll>
#define Pli pair<ll,int>
#define Pll pair<ll,ll>
#define pb push_back 
#define pc putchar
#define mp make_pair
#define file(k) memset(k,0,sizeof(k))
#define ll long long
int n , m;
char a[200][200];
int read()
{
    int sum = 0;char c = getchar();bool flag = true;
    while(c < '0' || c > '9') {if(c == '-') flag = false;c = getchar();}
    while(c >= '0' && c <= '9') sum = sum * 10 + c - 48,c = getchar();
    if(flag) return sum;
    else return -sum;
}
int main()
{
    n = read();m = read();
    int k = n / 4;
    k++;
    rep(i,1,k) printf("5");printf("\n");
    rep(i,1,k-1) printf("4");printf("5\n");
    return 0;
}

C

https://blog.csdn.net/a1035719430/article/details/82228342

D

https://blog.csdn.net/a1035719430/article/details/82250470

E

https://blog.csdn.net/a1035719430/article/details/82250794

F

G

H