汉诺塔

#include<bits/stdc++.h>
using namespace std;

int n;
char x, y, z;

void hanoi(int n, char a, char b, char c)
{
	if (n == 1) cout << a << "->" << n << "->" << b << endl;
	else
	{
		hanoi(n - 1, a, c, b);
		cout << a << "->" << n << "->" << b << endl;
		hanoi(n - 1, c, b, a);
	}
}

int main()
{
	cin >> n >> x >> y >> z;
	hanoi(n, x, y, z);
	
	return 0;
}

斐波那契数列

#include<bits/stdc++.h>
using namespace std;

const int N = 1e6 + 10;

int a[N] = {0, 1, 1};
int n, x;

int main()
{
	for (int i = 3; i < N; i ++ )
		a[i] = (a[i - 1] + a[i - 2]) % 1000;
	
	cin >> n;
	while (n -- )
	{
		cin >> x;
		cout << a[x] << endl;
	}
	
	return 0;
}