Solutions: word coverage restoration, longest serial number, Xiaoyu buys stationery, Xiaoyu's electricity bill

Word overlay restore

Title Description

A length of $l(3\le l\le 255)$ Is repeatedly pasted with boy and girl Two words , The post pasted words may cover the pasted words （ What is not covered is represented by a period ）, Eventually, at least one character per word is not covered . How many are there boy How many? girl？

Input format

A line is repeatedly pasted with boy and girl Two word string .

Output format

Two lines , Two integers . First act boy The number of , Second behavior girl The number of .

Examples #1

The sample input #1

......boyogirlyy......girl.......

Sample output #1

4
2

Answer key

// Author:PanDaoxi
#include <iostream>
using namespace std;
int main(){
    
	//  Count 
	int boy=0,girl=0;
	string a;
	cin>>a;
	int len=a.size();
	for(int i=0;i<len-2;i++){
    
		boy+=(a[i]=='b'||a[i+1]=='o'||a[i+2]=='y'?1:0);
		if(i<len-3) girl+=(a[i]=='g'||a[i+1]=='i'||a[i+2]=='r'||a[i+3]=='l'?1:0);
	}
	cout<<boy<<endl<<girl;
	return 0;
}

Longest hyphen

Title Description

The input length is $n$ A sequence of positive integers , The length of the longest serial number in the output sequence is required .

A hyphen means in a sequence , Continuous natural number from small to large .

Input format

first line , An integer $n$.

The second line ,$n$ It's an integer $a_i$, Space between .

Output format

a number , The number of longest hyphens .

Examples #1

The sample input #1

10
1 5 6 2 3 4 5 6 8 9

Sample output #1

5

Tips

Data scale and agreement

about $100\%$ The data of , Guarantee $1\le n\le 10^4$,$1\le a_i\le 10^9$.

Answer key

// Author:PanDaoxi
#include <iostream>
using namespace std;
int main(){
    
	int n,a,b=1,c=0,d;
	cin>>n>>a;
	for(int i=1;i<n;i++){
    
		cin>>d;
		if(a<d&&d-a==1) b++;
		else b=1; //  A number is also a hyphen 
		if(b>c) c=b;
		a=d;
	}
	cout<<c;
	return 0;
}

Xiaoyu buys stationery

Title Description

The head teacher gave Xiaoyu a task , Go to the stationery store and buy as many signing pens as possible . It is known that the price of a signing pen is $1$ element $9$ horn , And the money given to Xiaoyu by the head teacher is $a$ element $b$ horn , Xiaoyu wants to know , How many signing pens can she buy at most .

Input format

Enter only one line of two integers , respectively $a$ and $b$.

Output format

Output a line of integers , It means how many signing pens Xiaoyu can buy at most .

Examples #1

The sample input #1

10 3

Sample output #1

5

Tips

Data scale and agreement

For all test points , Guarantee $0\le a\le 10^4$,$0\le b\le 9$.

Answer key

Nothing to say , It's relatively simple .

// Author:PanDaoxi
#include <iostream>
using namespace std;
int main(){
    
    int a,b;
    cin>>a>>b;
    cout<<(10*a+b)/19;
	return 0;
}

The electricity charge of Xiaoyu family

Title Description

Summer is coming , The electricity consumption of each household has increased a lot , The corresponding electricity bill also paid more . Xiaoyu's family received a notice of electricity charge today . Xiaoyu saw that it said ： According to the price of electricity in Fujian [2006]27 Regulation No , The monthly electricity consumption is 150 Kilowatt hours and below per kilowatt hour 0.4463 Yuan Executive , The monthly electricity consumption is 151~400 The part of kWh is per kWh 0.4663 Yuan Executive , The monthly electricity consumption is 401 Kilowatt hours and above per kilowatt hour 0.5663 Yuan Executive ; Xiaoyu wants to verify , Is the number of electricity bills due on the electricity bill correct . Please write a program , Total known electricity consumption , According to the tariff , Figure out how much electricity should be paid .

Input format

Enter an integer , Indicates the total electricity consumption （ In kilowatt hours ）, No more than 10000.

Output format

Output a number , Keep it after the decimal point 1 position （ The unit is in yuan , Keep it after the decimal point 1 position ）.

Examples #1

The sample input #1

267

Sample output #1

121.5

Answer key

Split billing , Write well if That's all right. .

#include <iostream>
#include <iomanip>
using namespace std;
int main(){
    
    double s;
    int n;
    cin>>n;
    if(n>400) s=150*0.4463+250*0.4663+(n-400)*0.5663;
    else if(n>150) s=150*0.4463+(n-150)*0.4663;
    else s=n*0.4463;
    cout<<fixed<<setprecision(1)<<s;
    return 0;
}