zoukankan      html  css  js  c++  java
  • CodeForces

    题面

    time limit per test:1 second
    memory limit per test:256 megabytes
    input:standard input
    output:standard output

    Monocarp and Bicarp live in Berland, where every bus ticket consists of n digits (n is an even number). During the evening walk Monocarp and Bicarp found a ticket where some of the digits have been erased. The number of digits that have been erased is even.

    Monocarp and Bicarp have decided to play a game with this ticket. Monocarp hates happy tickets, while Bicarp collects them. A ticket is considered happy if the sum of the first (frac{n}{2}) digits of this ticket is equal to the sum of the last (frac{n}{2}) digits.

    Monocarp and Bicarp take turns (and Monocarp performs the first of them). During each turn, the current player must replace any erased digit with any digit from (0) to (9). The game ends when there are no erased digits in the ticket.

    If the ticket is happy after all erased digits are replaced with decimal digits, then Bicarp wins. Otherwise, Monocarp wins. You have to determine who will win if both players play optimally.

    **Input **

    The first line contains one even integer (n) ((2 le n le 2 cdot 10^{5}))— the number of digits in the ticket.

    The second line contains a string of (n) digits and "?" characters — the ticket which Monocarp and Bicarp have found. If the (i)-th character is "?", then the (i)-th digit is erased. Note that there may be leading zeroes. The number of "?" characters is even.

    Output

    If Monocarp wins, print "Monocarp" (without quotes). Otherwise print "Bicarp" (without quotes).

    Examples

    input

    4
    0523
    

    output

    Bicarp
    

    input

    2
    ??
    

    output

    Bicarp
    

    input

    8
    ?054??0?
    

    output

    Bicarp
    

    input

    6
    ???00?
    

    output

    Monocarp
    

    代码

    #include <bits/stdc++.h>
    
    using namespace std;
    
    
    int main() {
    
    #ifndef ONLINE_JUDGE
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
    #endif
        int n;
        char ch;
        int sum1 = 0, sum2 = 0, num1 = 0, num2 = 0;
        scanf("%d", &n);
        getchar();
        for (int i = 0; i < n; ++i) {
            scanf("%c", &ch);
            if (ch == '?') {
                if (i < n / 2) ++num1;
                else ++num2;
            } else {
                if (i < n / 2) sum1 += (ch - '0');
                else sum2 += (ch - '0');
            }
        }
    
    
        if(num1 == num2 && sum1 != sum2)
        {
            puts("Monocarp");
            return 0;
        }
        if(num1 == 0 && num2 == 0)
        {
            if(sum1 == sum2)puts("Bicarp");
            else puts("Monocarp");
            return 0;
        }
    
        if(sum1 == sum2){
            if(num1 == num2)puts("Bicarp");
            else puts("Monocarp");
        }else{
            if((num2 - num1)/2*9 == (sum1 - sum2)) puts("Bicarp");
            else puts("Monocarp");
        }
    }
    
  • 相关阅读:
    一个list<Map>里map其中的一个字段的值相同,如何判断这个字段相同,就把这个map的其他字段存入另一个map中
    ES6---箭头函数()=>{} 与function的区别
    VSCode代码格式化快捷键及保存时自动格式化
    NoClassDefFoundError: com/fasterxml/jackson/databind/exc/InvalidDefinitionException
    响应数据中文乱码
    tomcat将静态资源写入到浏览器乱码问题
    mark一款全局搜索工具,可以搜索文本内容
    mpvue 开发微信小程序搭建项目
    h5返回上一页ios页面不刷新
    微信小程序去除页面滚动条
  • 原文地址:https://www.cnblogs.com/YY666/p/11652382.html
Copyright © 2011-2022 走看看