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

题目链接

A题：

找B的中心。。。直接写

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<list>
#include<map>
#include<set>
#include<vector>

typedef long long int ll;
const int  maxn =100+20;
const int  mod =998244353;
const int INF=0x3f3f3f3f;
using namespace std;
ll pw(ll a,ll b){
    ll ret=1;
    while(b){
        if(b&1)
            ret=ret*a%mod;
        a=a*a%mod;
        b>>=1;
    }
    return ret;
}
int father[maxn];
bool vis[maxn];
int main()
{
    int n,m;scanf("%d%d",&n,&m);
    char a[maxn][maxn];
    for(int i=0;i<n;i++)
            scanf("%s",&a[i]);
    int x1=0,x2=0,y1=0,y2=0;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<m;j++)
        {
            if(a[i][j]=='B')
            {
                if(x1==0)x1=i,y1=j;
                x2=i,y2=j;
            }
        }
    }
    cout<<((x1+x2)/2)+1<<" "<<((y1+y2)/2+1);
    return 0;
}

B题：

构造。。

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<list>
#include<map>
#include<set>
#include<vector>

typedef long long int ll;
const int  maxn =100+20;
const int  mod =998244353;
const int INF=0x3f3f3f3f;
using namespace std;
ll pw(ll a,ll b){
    ll ret=1;
    while(b){
        if(b&1)
            ret=ret*a%mod;
        a=a*a%mod;
        b>>=1;
    }
    return ret;
}
int father[maxn];
bool vis[maxn];
int main()
{
    int n,m;scanf("%d%d",&n,&m);
    for(int i=1;i<=2000;i++) cout<<8;
    cout<<endl;
    for(int i=1;i<=1999;i++)cout<<1;
    cout<<2<<endl;
    return 0;
}