21 蓝桥杯

cpp 复制代码
#include<iostream>
using namespace std;
#include<string>
string str;
int main()
{
	cin >> str;
	for (int i = 0;i < str.length();i++)
	{
		int x = (int)str[i];
		if (x >= 49 && x <= 57)
		{
			x -= 49;
			for (int j = 1;j <= x;j++)
			{
				cout << str[i - 1];
			}
		}
		else
		{
			cout << str[i];
		}
	}
	return 0;
}
cpp 复制代码
#include<iostream>
using namespace std;
#include<string>
string str;
int main()
{
	long long a, b, n;
	cin >> a >> b >> n;
	long long week = a * 5 + b * 2;
	long long ans = 0;
	ans = n / week;
	ans *= 7;
	n %= week;
	int flag = 0;
	while (n > 0)
	{
		flag++;
		ans++;
		if (flag <= 5)
		{
			n -= a;
		}
		else
		{
			n -= b;
		}
	}
	cout << ans << endl;
	return 0;
}
cpp 复制代码
#include<iostream>
using namespace std;
#include<cmath>
#include<algorithm>
int main()
{
	double n;

	cin >> n;
	int nn = n;
	int ans = 0;
	for (int i = 1;i < n;i++)
	{
		int x = i * i;
		x %= nn;
		if ( x< n / 2)
		{
			ans++;
		}
	}
	cout << ans << endl;
	return 0;
}
cpp 复制代码
#include<iostream>
using namespace std;
#include<cmath>
#include<algorithm>
int main()
{
	char ch1, ch2, ch3, ch4;
	int cnt = 0;
	for (int i = 1;i <= 5;i++)
	{
		cin >> ch1 >> ch2 >> ch3 >> ch4;
		if (ch1 == ch3 && (int)ch4 - (int)ch2 == 1)
		{
			cnt++;
		}
	}
	cout << cnt << endl;
	return 0;
}
cpp 复制代码
#include<iostream>
using namespace std;
#include<cmath>
#include<algorithm>
#include<iomanip>
int main()
{
	int n;
	cin >> n;
	double d = 0;
	double maxx = -1;
	double minn = 101;
	for (int i = 1;i <= n;i++)
	{
		double x;
		cin >> x;
		maxx = max(maxx, x);
		minn = min(minn,x);
		d += x;
	}
	cout << maxx << endl;
	cout << minn << endl;
	cout << fixed << setprecision(2) << d / n << endl;
	return 0;
}
cpp 复制代码
#include<iostream>
using namespace std;
#include<string>
int main()
{
	char c1, c2, c3, c4, c5;
	cin >> c1 >> c2 >> c3 >> c4 >> c5;
	string s;
	s.resize(3);
	s[0] = c1;
	s[1] = c2;
	s[2] = c3;
	if (s == "Jan")
	{
		cout << 1;
	}
	else if (s == "Feb")
	{
		cout << 2;
	}
	else if (s == "Mar")
	{
		cout << 3;
	}
	else if (s == "Apr")
	{
		cout << 4;
	}
	else if (s == "May")
	{
		cout << 5;
	}
	else if (s == "Jun")
	{
		cout << 6;
	}
	else if (s == "Jul")
	{
		cout << 7;
	}
	else if (s == "Aug")
	{
		cout << 8;
	}
	else if (s == "Sep")
	{
		cout << 9;
	}
	else if (s == "Oct")
	{
		cout << 10;
	}
	else if (s == "Nov")
	{
		cout << 11;
	}
	else if (s == "Dec")
	{
		cout << 12;
	}
	cout << " ";
	int x = 10 * ((int)(c4 - 48)) + (int)(c5 - 48);
	cout << x;
	return 0;
}
cpp 复制代码
#include<iostream>
using namespace std;
#include<string>
int main()
{
	string str;
	cin >> str;
	for (int i = 0;i < str.length();i++)
	{
		if ((int)(str[i] >= 97))
		{
			cout << char(str[i] - 32);
		}
		else
		{
			cout << str[i];
		}
	}
	return 0;
}
cpp 复制代码
#include<iostream>
using namespace std;
#include<string>
int main()
{
	long long n;
	cin >> n;
	while (n != 0)
	{
		cout << n << " ";
		n /= 2;
	}
	return 0;
}
相关推荐
金融小师妹3 小时前
应用BERT-GCN跨模态情绪分析:贸易缓和与金价波动的AI归因
大数据·人工智能·算法
广州智造3 小时前
OptiStruct实例:3D实体转子分析
数据库·人工智能·算法·机器学习·数学建模·3d·性能优化
Trent19855 小时前
影楼精修-肤色统一算法解析
图像处理·人工智能·算法·计算机视觉
feifeigo1236 小时前
高光谱遥感图像处理之数据分类的fcm算法
图像处理·算法·分类
a东方青6 小时前
蓝桥杯 2024 C++国 B最小字符串
c++·职场和发展·蓝桥杯
北上ing6 小时前
算法练习:19.JZ29 顺时针打印矩阵
算法·leetcode·矩阵
.格子衫.8 小时前
真题卷001——算法备赛
算法
XiaoyaoCarter8 小时前
每日一道leetcode
c++·算法·leetcode·职场和发展·二分查找·深度优先·前缀树
Hygge-star8 小时前
【数据结构】二分查找5.12
java·数据结构·程序人生·算法·学习方法
June`9 小时前
专题二:二叉树的深度搜索(二叉树剪枝)
c++·算法·深度优先·剪枝