每日一练蓝桥杯C语言:2020年真题题集（B组）

#include <iostream>
using namespace std;

int months[13] = {0,31,28,31,30,31,30,31,31,30,31,30,31};

//判断日期是否合法 
bool check(int date)
{
	int year = date/10000;
	int month = date/100%100;
	int day = date%100;
	
	if(!month || month>13 || !day)	return false;
	
	if(month != 2 && day > months[month])	return false;
	if(month == 2){
		bool leap = year%4==0 && year%100 || year%400==0;
		if(day > 28+leap)	return false;
	}	
	return true;
}

//判断日期是否为回文日期
bool Ishuiwen(int date)
{
	int temp = 0;
	while(date > temp){//求日期后四位的值
		temp = temp * 10 + date%10;
		date /= 10;
	}
	if(date == temp)	return true;
	
	return false;
} 

//判断日期是否为ABABBABA型日期 
bool IsABhuiwen(int date){
   
   
	int d,m;
	d = date%100;//日期后两位78位
	m = date/100%100;//日期后56位
	
	if(Ishuiwen(date) && d==m)	return true;//满足回文且56位=78时判断日期为ABABBABA型日期
	
	return false;
}

int main()
{

	int N;
	cin>>N;
	for(int i=N+1;i<=89991231;i++)
		if(check(i)&&Ishuiwen(i))
		{
			cout<<i<<endl;
			break;
		}
	for(int j=N+1;j<=89991231;j++)
		if(check(j)&&IsABhuiwen(j))
		{
			cout<<j<<endl;
			break;
		}
		return 0;

}

⛳ 8.子串分值和

#include<iostream>
#include<cstring>
#include<set>
#include<algorithm>
using namespace std;

string s;
int res;

int cal(string s){
	set<char> st; 
	for(int i = 0; i < s.size(); i++){
		st.insert(s[i]);
	}
	return st.size();
}

int main(){
	cin >> s;
	for(int i = 0; i < s.size(); i++){
		for(int j = i; j < s.size(); j++){
			string sub = s.substr(i, j - i + 1);
			res += cal(sub);
		}
	}
	
	cout << res;
	return 0;
}

#include<iostream>
#include<cstring>
#include<set>
using namespace std;
set<pair<double,double> > se;
const int N = 1005;
double A[N];
double B[N];
set<pair<double,double> > s;
set<pair<double,double> >::iterator it;
int main()
{
	int n,i,j,x,y;
	cin>>n;
	for(i=0;i<n;i++)
	{
		cin>>x>>y;
		s.insert(make_pair(x,y));
	}
	n = s.size();
	for(i=0,it=s.begin(),it++;it!=s.end();it++,i++)
	{
		A[i]=(*it).first;
		B[i]=(*it).second;
	}
	long long ans=2;
	for(i=1;i<n;i++)
	{
		set<pair<double,double> > se;
		for(j=i-1;j>=0;j--)
		{
			double x=(B[j]-B[i])/(A[i]-A[j]);
			double y=(A[j]*B[i]-A[i]*B[j])/(A[j]-A[i]);
			se.insert(make_pair(x,y));
		}
		int n2=se.size();
		ans+=(n2+1);
	}
	cout<<ans<<endl;
}

#include <bits/stdc++.h>
using namespace std;
const int N = 1e4 + 10;
char ans[N], res[N];
int n, len;
bool judge() 
{
	int i = len;
	while(ans[i] == res[i] && i) i--;
	return res[i] < ans[i];
}
void dfs(int now, int maxn, int m, int sum) {
	if(sum == n) 
	{
		if(m < len || (m == len && judge()))
		{
			len = m;
			for(int i = 1; i <= len; i++) 	ans[i] = res[i];
		}
		return;
	}
	if(now >= 26) return ;
	for(int i = 1; i <= maxn; i++) 
	{
		int temp = sum + m * i;
		if(temp > n) return ;
		res[m + i] = char(now + 'a');
		dfs(now + 1, i, m + i, temp);
	}
}

int main()
{
    len = 0x3f3f3f3f;
    scanf("%d", &n);
    dfs(0, 8, 0, 0);
    for(int i = len; i >= 1; i--)
		putchar(ans[i]);
	return 0;
}