当前位置：网站首页>The fifth day of the third question of Luogu daily

P1321 Word overlay restore
Title Description
A length of ll 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 .
I/o sample
Input #1 Copy
......boyogirlyy......girl.......
Output #1 Copy
4
2
explain / Tips
Data assurance ,3\le l\le2553≤l≤255, The string contains only the following characters ：\texttt{.bgilory}.bgilory.

# include <bits/stdc++.h>
using namespace std;
int main()
{
	string s;
	cin>>s;
	int blp=-1;
	int count0=0;
	int count1=0;
	for(int i=0;i<s.length();i++)
	{
		if (s[i]=='b'||s[i+1]=='o'||s[i+2]=='y')
		{
			count0++;
		}
		if (s[i]=='g'||s[i+1]=='i'||s[i+2]=='r'||s[i+3]=='l')
		{
			count1++;
		}
	}
	
cout<<count0<<endl<<count1;
	
	
}

P1271 【 Deep base 9. example 1】 Election of Student Union
Title Description
The school is electing members of the student union , Yes n(n\le 999)n(n≤999) Nominee , Each candidate is numbered from 1 To nn, Now I have collected m(m<=2000000)m(m<=2000000) votes , Each ballot is marked with a candidate number . Now I want to sort these mountains of votes according to the number of votes from small to large .
Input format
Input nn and mm as well as mm A number on a ballot .
Output format
Find the sorted ballot number .
I/o sample
Input #1 Copy
5 10
2 5 2 2 5 2 2 2 1 2
Output #1 Copy
1 2 2 2 2 2 2 2 5 5

# include <bits/stdc++.h>
using namespace std;
int main()
{
	int n,m;
	cin>>n>>m;
	int a[m];
	for(int i=0;i<m;i++)
	{
		cin>>a[i];
	}
	sort(a,a+m);
	for(int i=0;i<m;i++)
	{
		cout<<a[i]<<" ";
	}
 }

P1059 [NOIP2006 Popularization group ] A clear random number
Title Description
I want to invite some students to do a questionnaire survey at school , For the objectivity of the experiment , He first generated... By computer NN individual 11 To 10001000 Random integer between (N\leq100)(N≤100), For the repeated numbers , Keep only one , Take out the rest of the same number , Different numbers correspond to different student numbers . And then sort the numbers from small to large , According to the order of arrangement to find students to do research . Please help Mingming finish “ duplicate removal ” And “ Sort ” The job of .
Input format
There are two lines of input , The first 11 Behavior 11 A positive integer , Represents the number of generated random numbers NN.
The first 22 Yes NN Positive integers separated by spaces , For the resulting random number .
Output format
Output is also two lines , The first 11 Behavior 11 A positive integer MM, The number of different random numbers .
The first 22 Behavior MM Positive integers separated by spaces , Different random numbers in order from small to large .
I/o sample
Input #1 Copy
10
20 40 32 67 40 20 89 300 400 15
Output #1 Copy
8
15 20 32 40 67 89 300 400
explain / Tips
NOIP 2006 Popularization group The first question is

# include <stdio.h>
# include <stdlib.h>
//int cmp(int *x, int *y) {
//    return *x - *y;
//}
int comp(const void *a,const void *b)
{
return *(int *)a-*(int *)b;
}
int main()
{
	int n;scanf("%d",&n);
	int a[n];
	for(int i=0;i<n;i++)
	{
	scanf("%d",&a[i]);
//		a[i]=rand()%1000+1;
	//	printf("%d ",a[i]);
	}
	
	//int count=0;
   qsort(a,n,sizeof(int),comp); 
//   for(int i=0;i<n;i++)
//   {
//   	printf("%d ",a[i]);
//   }
int b[n];
int j=0;
   for(int i=1;i<n;i++)
	{
		if(a[i]==a[i-1])
		{
			continue;
		}
		b[j]=a[i-1];
		j++;
	}
	if(a[n-1]!=a[n-2])
	{
		b[j]=a[n-1];
		j++;
	}
	printf("%d\n",j);
	for(int i=0;i<j;i++)
	{
		printf("%d ",b[i]);	
	}
	return 0;
 }

原网站

版权声明
本文为[Xiao Tang (๑ & gt; ؂＆ lt; ๑）]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/200/202207170100293121.html