第十四届蓝桥杯模拟赛第一期（C/C++）

6、英文转换

#include <iostream>
using namespace std;
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
#define M 30
#define N 60
char sg[31][61];
int main(int argc, char** argv) {
	
	string s;
	cin>>s;
	for(int i=0;s[i]!='\0';i++){
		if(s[i]=='a')
		s[i]='A';
		else if(s[i]=='e')
		s[i]='E';
		else if(s[i]=='i')
		s[i]='I';
		else if(s[i]=='o')
		s[i]='O';
		else if(s[i]=='u')
		s[i]='U';
		
	}
	cout<<s;
	return 0;
	
	
}

8. 充电器

#include <iostream>
using namespace std;
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
#define M 30
#define N 101

int main(int argc, char** argv) {
	int n;
	int timeh[N],timem[N],times[N];
	int v[N],I[N];
	long long time,sum=0;
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>timeh[i],cin.ignore(),cin>>timem[i],cin.ignore(),cin>>times[i];
		cin>>v[i];
		cin>>I[i];
	}
	for(int i=0;i<n-1;i++){
		if(times[i+1]<times[i])
		{
		    times[i]+=60;
		    timem[i]-=1;
		}
		if(timem[i+1]<timem[i]){
			timem[i]+=60;
			timeh[i]-=1;
		}
		time=(timeh[i+1]-timeh[i])*3600+(timem[i+1]-timem[i])*60+times[i+1]-times[i];
		sum+=time*v[i]*I[i];
	}
	cout<<sum;
	return 0;
}

9. 全相等三角形 

#include <iostream>
using namespace std;
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
#define M 101
#define N 101

int main(int argc, char** argv) {
	char s[M][N];
	int m,n;
	int l=0,r=0,t=0,b=0;
	int sum=0,flag=0;
	int i,j,e,u,k;
	cin>>m>>n;
	for(int i=0;i<m;i++)
	{
		for(int j=0;j<n;j++)
		cin>>s[i][j];
	}
	for(i=0;i<m;i++)
	{
		for(j=0;j<n;j++)
		{
			l=0,r=0,t=0,b=0;
			while(s[i][j]==s[i][j+r]&j+r<n)
			r++;
			while(s[i][j]==s[i][j-l]&j-l>=0)
			l++;
			while(s[i][j]==s[i+b][j]&i+b<m)
			b++;
			while(s[i][j]==s[i-t][j]&i-t>=0)
			t++;
			for(k=1;k<min(r,b);k++)
			{
				flag=0;
				for(e=i,u=j+k;e<=i+k&&u>=j;e++,u--)
				{
					if(s[i][j]!=s[e][u])
					{
				 		flag=1;	
				 		break;
					}					
				}
				if(flag==0)
				sum++;
			}
			for(k=1;k<min(r,t);k++)
			{
				flag=0;
				for(e=i,u=j+k;e>=i-k&&u>=j;e--,u--)
				{
					if(s[i][j]!=s[e][u])
					{
				 		flag=1;	
				 		break;
					}	
				}
				if(flag==0)
				sum++;
			}
			for(k=1;k<min(l,b);k++)
			{
				flag=0;
				for(e=i,u=j-k;e<=i+k&&u<=j;e++,u++)
				{
					if(s[i][j]!=s[e][u])
					{
				 		flag=1;	
				 		break;
					}	
				}
				if(flag==0)
				sum++;
			}
			for(k=1;k<min(l,t);k++)
			{
				flag=0;
				for(e=i,u=j-k;e>=i-k&&u<=j;e--,u++)
				{
					if(s[i][j]!=s[e][u])
					{
				 		flag=1;	
				 		break;
					}	
				}
				if(flag==0)
				sum++;
			}
		} 
	}
	cout<<sum;
	return 0;
}

10、最小下标

#include<iostream>
#include<map> 
using namespace std;

int main() {
    string s; 
	cin>>s;
	char minc='Z';
	map<int,int> mp;
	int n = s.length();
	for(int i=0;i<n;i++)
	{
		if(s[i]<minc)
		{
			minc=s[i];
			mp.clear();
		}
		if(s[i]==minc)
		{
			mp[i]=i;
		}
	} 
	for(int i=0;mp.size()>1&&mp.size()!=s.length()&&i<s.length();i++){
		minc='Z';
		for(map<int,int>::iterator it=mp.begin();it!=mp.end();it++)
		{
			int &m = it->second;
			m = (m+s[m]-'A'+1)%n;
			if(s[m]<minc)
			{
				for(map<int,int>::iterator its=mp.begin();its!=it;)
				{
					mp.erase(its++);
				}
				minc = s[m];
			}
			else if(s[m]>minc)
			mp.erase(it--);
		}
	} 
	cout <<mp.begin()->first;
	return 0;
}