ABC339(A-C)

A

#include<bits/stdc++.h>
using namespace std;
int main()
{
    string s;
    cin>>s;
    int l=s.length();
    int end;
    for(int i=l-1;i>=0;i--){
        if(s[i]=='.'){
            end=i;
            break;
        }
    }
    for(int i=end+1;i<l;i++){
        cout<<s[i];
    }
    return 0;
}

B

#include<bits/stdc++.h>

using namespace std;


const int MAX_H = 1005;
const int MAX_W = 1005;
int H, W, N;
int grid[MAX_H][MAX_W];
int row = 1, col = 1, direction = 0; 

void move() {
    if (direction == 0) {
        row--;
        if (row == 0) row = H;
    } else if (direction == 1) {
        col++;
        if (col > W) col = 1;
    } else if (direction == 2) {
        row++;
        if (row > H) row = 1;
    } else {
        col--;
        if (col == 0) col = W;
    }
}


void changeColor() {
    if (grid[row][col] == 0) {
        grid[row][col] = 1;
        direction = (direction + 1) % 4;
    } else {
        grid[row][col] = 0;
        direction = (direction + 3) % 4;
    }
}

int main() {

    cin >> H >> W >> N;


    for (int i = 1; i <= H; ++i) {
        for (int j = 1; j <= W; ++j) {
            grid[i][j] = 0;
        }
    }


    for (int i = 0; i < N; ++i) {
        changeColor();
        move();
    }

    for (int i = 1; i <= H; ++i) {
        for (int j = 1; j <= W; ++j) {
            cout << (grid[i][j] == 0 ? "." : "#");
        }
        cout << endl;
    }

    return 0;
}

C

#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
    ll n;
    cin>>n;
    ll sum=0;
    ll ele;
    for(ll i=0;i<n;i++){
        cin>>ele;
        //cout<<ele<<" ";
        sum+=ele;
        if(sum<0){
            sum=0;
        }
    }
    //cout<<endl;
    cout<<sum<<endl;
    return 0;
}

原文地址：https://blog.csdn.net/pboaths/article/details/136046037

免责声明：本站文章内容转载自网络资源，如本站内容侵犯了原著者的合法权益，可联系本站删除。更多内容请关注自学内容网（zxcms.com）！