zoukankan      html  css  js  c++  java
  • Codeforces 424A (思维题)

    Time Limit: 1000MS   Memory Limit: 262144KB   64bit IO Format: %I64d & %I64u

     Status

    Description

    Pasha has many hamsters and he makes them work out. Today, n hamsters (n is even) came to work out. The hamsters lined up and each hamster either sat down or stood up.

    For another exercise, Pasha needs exactly  hamsters to stand up and the other hamsters to sit down. In one minute, Pasha can make some hamster ether sit down or stand up. How many minutes will he need to get what he wants if he acts optimally well?

    Input

    The first line contains integer n (2 ≤ n ≤ 200; n is even). The next line contains n characters without spaces. These characters describe the hamsters' position: the i-th character equals 'X', if the i-th hamster in the row is standing, and 'x', if he is sitting.

    Output

    In the first line, print a single integer — the minimum required number of minutes. In the second line, print a string that describes the hamsters' position after Pasha makes the required changes. If there are multiple optimal positions, print any of them.

    Sample Input

    Input
    4
    xxXx
    Output
    1
    XxXx
    Input
    2
    XX
    Output
    1
    xX
    Input
    6
    xXXxXx
    Output
    0
    xXXxXx

    Source

    题意:一个字符串有n个字符,每个字符不是x就是X,现要求让x和X的个数相等,输出最小的转换次数和转换后的字符串。
    题解:统计x和X的个数设为a,b,c=min(a,b),转换最小次数为n/2-a,随便转换几个x或者X然后输出就行了。
    #include <iostream>
    using namespace std;
    int main()
    {
        int i,n,m,a,b,tmp,ans;
        char c[205];
        while(cin>>n)
        {
            m=n/2;
            ans=0;
            tmp=0;
            a=0;
            b=0;
            for(i=0;i<n;i++)
            {
                cin>>c[i];
                if(c[i]=='x')
                a++;
                else
                b++;
            }
            //cout<<a<<" "<<b<<endl;
            if(a<n/2)
            {
                tmp=n/2-a;
                ans=tmp;
                for(i=0;i<n;i++)
                {
                    if(tmp==0)
                    break;
                    if(c[i]=='X')
                    {
                        c[i]='x';
                        tmp--;
                    }
                }
            }
            else
            {
                tmp=n/2-b;
                ans=tmp;
                for(i=0;i<n;i++)
                {
                    if(tmp==0)
                    break;
                    if(c[i]=='x')
                    {
                        c[i]='X';
                        tmp--;
                    }
                }
            }
            cout<<ans<<endl;
            for(i=0;i<n;i++)
            cout<<c[i];
            cout<<endl;
        }
    
    
    
    
        return 0;
    }
  • 相关阅读:
    Apache HTTPServer与JBoss/Tomcat的整合与请求分发
    ——随想——
    websphere安装和mvn dependency:copy-dependencies
    Struts2拦截器总结<转>
    db2索引创建和删除
    关于盒子模型的应用(制作三角形)
    创建文本框的步骤及一些常见的知识点
    HTML5与CSS3基础(五)
    HTML5与CSS3基础(四)
    HTML5与CSS3基础(三)
  • 原文地址:https://www.cnblogs.com/Ritchie/p/5425240.html
Copyright © 2011-2022 走看看