蓝桥杯——5

学习视频：06-快速提升代码能力题解_哔哩哔哩_bilibili

S：万能开头#include<bits/stdc++>

S:蓝桥杯的输入和输出是分开的，所以可以边读边输出

Q：斐波那契数列

int f(int n) {
	if (n == 1 || n == 2) return 1;
	return f(n - 1) + f(n - 2);
}
int main() {
	int n;
	cin >> n;
	int fn = f(n);
	int max = 1e9 + 7;
	cout << fn % max;
	return 0;
}

Q：矩阵旋转

int main() {
	int n, m;
	cin >> n >> m;
	int ma[100][100] = { 0 };
	int mb[100][100] = { 0 };
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cin >> ma[i][j];
			mb[i][j] = ma[i][j];
		}
	}
	cout << endl;
	for (int i = 0; i < m; i++) {
		for (int j = 0; j < n; j++) {
			cout << ma[n - j - 1][i]<<" ";
		}
		cout << '\n';
	}
	return 0;
}

今晚睡觉啦