Codeforces Round #480 (Div. 2)

980A

题意：给出一个序列，代表字符串和珍珠相连的环，问能否通过移动珍珠和线，使得相邻两个珍珠间的线相同

题解：当珍珠或线为0时为NO，当珍珠比线多时为NO，当线为珍珠的倍数时为YES

#include<iostream>
#include<cstring>
using namespace std;

char s[110];

int main(){
    int lnum = 0, pnum = 0;
    cin>>s;
    int len = strlen(s);
    for(int i = 0; i<len; i++){
        if(s[i] == '-') lnum++;
        if(s[i] == 'o') pnum++;
    }
    if(pnum == 0 || lnum == 0){
        cout<<"YES"<<endl;
    }
    else if(pnum>lnum){
        cout<<"NO"<<endl;
    }
    else if(lnum%pnum!=0){
        cout<<"NO"<<endl;
    }
    else cout<<"YES"<<endl;
    return 0;
}

980B（构造）

题意：给一个4*n的矩阵，n为奇数，在其中放k个障碍物，使得从左上角到右下角与从左下角到右上角的最短路条数相同

题解：构造对称性，k为奇数时可看成从右上角到左下角

#include<iostream>
#include<cstring>
using namespace std;

int main(){
    int n, k;
    cin>>n>>k;
    if(k%2 == 0){
        if(k>2*(n-2)){
            cout<<"NO"<<endl;
        }
        else{
            cout<<"YES"<<endl;
            for(int i = 1; i<=n; i++){
                cout<<".";
            }
            cout<<endl;
            cout<<".";
            for(int i = 1; i<=(k/2); i++){
                cout<<"#";
            }
            for(int i = 1; i<=(n-1-k/2); i++){
                cout<<".";
            }
            cout<<endl;
             cout<<".";
            for(int i = 1; i<=(k/2); i++){
                cout<<"#";
            }
            for(int i = 1; i<=(n-1-k/2); i++){
                cout<<".";
            }
            cout<<endl;
            for(int i = 1; i<=n; i++){
                cout<<".";
            }
            cout<<endl;

        }
    }

    else{
        if(k>2*(n-2)){
            cout<<"NO"<<endl;
        }
        else{
            cout<<"YES"<<endl;
            for(int i = 1; i<=n; i++){
                cout<<".";
            }
            cout<<endl;

            if(k<=(n-2)){
                int temp = (k-1)/2;
                int le = (n-1)/2;
                for(int i = 1; i<=le-temp; i++){
                    cout<<".";
                }
                for(int i = 1; i<=2*temp+1; i++){
                    cout<<"#";
                }
                for(int i = 1; i<=le-temp; i++){
                    cout<<".";
                }
                cout<<endl;
                for(int i = 1; i<=n; i++){
                    cout<<".";
                }
                cout<<endl;
                for(int i = 1; i<=n; i++){
                    cout<<".";
                }
                cout<<endl;
            }

            else{
                k -= (n-2);
                cout<<".";
                for(int i = 1; i<=n-2; i++){
                    cout<<"#";
                }
                cout<<"."<<endl;
                cout<<".";
                for(int i = 1; i<=k/2; i++){
                    cout<<"#";
                }
                for(int i = 1; i<=(n-2-k); i++){
                    cout<<".";
                }
                for(int i = 1; i<=k/2; i++){
                    cout<<"#";
                }
                cout<<"."<<endl;;

                for(int i = 1; i<=n; i++){
                    cout<<".";
                }
                cout<<endl;
            }
        }

    }

    return 0;
}