牛客周赛 Round36 题解

A

#include <iostream>
#include <cstring>
#include <algorithm>
#include <stdio.h>
using namespace std;
int main()
{
    string s;
    cin >> s;
    int len=s.size();
    cout << s.substr(0,len-3);
    return 0;
}

B

#include<iostream>
using namespace std;
#define int long long
int a[110][110];
signed main()
{
    int n,m,x,i,j,s=0,k,g=0,l=0;
    cin>>n>>m>>x;
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
        {
            cin>>a[i][j];
            s+=a[i][j];
        }
    if(s!=x) g=1;
    for(i=1;i<=n;i++)
        l^=a[i][1];
    for(i=1;i<=n;i++)
    {
        k=0;
        for(j=1;j<=m;j++)
            k^=a[i][j];
        if(k!=l) g=1;
    }
    for(j=1;j<=m;j++)
    {
        k=0;
        for(i=1;i<=n;i++)
            k^=a[i][j];
        if(k!=l) g=1;
    }
    if(g==1) cout<<"wrong answer\n";
    else cout<<"accepted\n";
    return 0;
}

C

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 2e5+10;
int vis[N];
int n, m;
int main()
{
    int ans=0;
    string s;
    cin>>s;
    int n=s.size();
    for(int i=1; i<n; ++i) {
        if(s[i]<'a'&&!vis[i-1]) {
            // cout << i<<endl;
            ans++;
            vis[i]=1;
        }
    }
    cout<<ans;
    return 0;
}

D

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 1100;
typedef pair<int, int> PII;
PII q[N*N],Prev[N][N];
char g[N][N];
int d[N][N];
int n, m;
int bfs()
{
    int hh = 0, tt = 0;
    q[0] = {0, 0};
    memset(d, -1, sizeof d);

    int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
    d[0][0] = 0;
    while(hh <= tt)
    {
        PII t = q[hh ++ ];
        for(int i = 0; i < 4; i ++ )
        {
            int x = dx[i] + t.first, y = t.second + dy[i];
            if(g[x][y]==g[t.first][t.second]) continue;
            if(x >= 0 && x < n && y >= 0 && y < m  && d[x][y] == -1)
            {
                d[x][y] = d[t.first][t.second] + 1;
                Prev[x][y] = t;
                q[++ tt] = {x, y};
            }
        }
    }
    return d[n-1][m-1];
}
int main()
{
    cin >> n >> m;
    for(int i = 0; i < n; i ++ ){
        // for(int j = 0; j < m;j ++){
            scanf("%s",g[i]);
        // }
    }
    printf("%d",bfs());

    return 0;
}

E

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e3+10;
char s[N][N];
signed main(){
    ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
    int n,m;
    cin>>n>>m;
    int idx=0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            s[i][j]='a'+idx;
            idx++;
            if(idx==26){
                idx=0;
            }
        }
    }
    s[1][2]=s[1][3];
    s[2][1]=s[1][1];
    s[3][2]=s[2][2];
    s[2][3]=s[2][2];
    
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cout<<s[i][j];
        }
        cout<<endl;
    }
    return 0;
}

F

后续补充