【题库】——手机 & 小果的键盘 & 单词覆盖还原

一、手机

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int s=0;
	string a;
	getline(cin,a);
    for(int i=0;i<a.size();i++)
    {
    if(a[i]=='a'||a[i]=='d'||a[i]=='g'||a[i]=='j'||a[i]=='m'||a[i]=='p'||a[i]=='t'||a[i]=='w'||a[i]==' '){
			s+=1;   
		}
		if(a[i]=='b'||a[i]=='e'||a[i]=='h'||a[i]=='k'||a[i]=='n'||a[i]=='q'||a[i]=='u'||a[i]=='x'){
			s+=2;
		}
		if(a[i]=='c'||a[i]=='f'||a[i]=='i'||a[i]=='l'||a[i]=='o'||a[i]=='r'||a[i]=='v'||a[i]=='y'){
			s+=3; 
		}
		if(a[i]=='s'||a[i]=='z'){
			s+=4;
		}
	}
	cout<<s<<endl;
	return 0;
}

二、小果的键盘

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,ans=0;
	string s;
	cin>>n>>s;
	for(int i=0;i<n-1;i++)
	{
      if (s[i]=='V' && s[i+1]=='K') 
	  {
	  ans++;
	  s[i]='a';
	  s[i+1]='b';
	  }
	}
    for(int j=0;j<n-1;j++)
    {
      if (s[j+1]==s[j]) 
	 {
	   ans++;
	   cout<<ans;
	   return 0;
	 }
	}
	cout<<ans;
	return 0;
}

三、单词覆盖还原

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int by=0,gl=0;
	string s;
	cin>>s;
	for(int i=0;i<s.size();i++)
	{
		if(s[i]=='b'||s[i+1]=='o'||s[i+2]=='y')
		{
			by++;
		}
		if(s[i]=='g'||s[i+1]=='i'||s[i+2]=='r'||s[i+3]=='l')
		{
			gl++;
		}
	}
	cout<<by<<"\n"<<gl;
    return 0;
}