PAT B1057

1057 Count zero one (20 branch )

The length of a given string does not exceed 105 String , This question requires you to put the serial numbers of all English letters in it （ Letter a-z Corresponding serial number 1-26, Case insensitive ） Add up , Get the whole number N, And then analyze N How many in the binary representation of 0、 How many? 1. For example, given a string PAT (Basic), The sum of the letters and serial numbers is ：16+1+20+2+1+19+9+3=71, and 71 The binary of is 1000111, That is to say 3 individual 0、4 individual 1.

Input format ：

The input is given on a line, and the length is no more than 105、 String ending with carriage return .

Output format ：

Output... Successively in one line 0 The number of and 1 The number of , Separated by spaces . Be careful ： If there are no letters in the string , It is regarded as N non-existent , There is no 0 and 1.

sample input ：

PAT (Basic)

sample output ：

3 4

#include <iostream>
#include <string>
#include <vector>
#include <cctype>
using namespace std;

int main()
{
    string str;
    getline(cin,str);
    int sum=0;
    for(auto a : str)
    {
        int ch=0;
        if(islower(a))
            ch=a-'a'+1;
        else if(isupper(a))
            ch=a-'A'+1;
        else
            ch=0;
        sum+=ch;
    }
    vector<int> ans;
    if(sum==0)
    {
        cout << "0 0\n";
        return 0;
    }
    while(sum!=0)
    {
        int x=sum%2;
        sum/=2;
        ans.push_back(x);
    }
    int count_0=0,count_1=0;
    for(auto a : ans)
    {
        if(a==0)
            ++count_0;
        else
            ++count_1;
    }
//    cout << count_0 << ends << count_1 << endl;       //windows Yes ends Flush the buffer and output spaces ,
     cout << count_0 << ' ' << count_1 << endl;         //Linux Flush buffer only , Don't output spaces 
    return 0;                                           // So use it with caution 
}