初识递归

#include<stdio.h>
int fun(int);
int main(void)
{
	printf("%d", fun(5));
	return 0;
}
int fun(int n) {
	int year;
	if (n == 1) {
		year = 10;
	}
	else
	year = 2+fun(n - 1);
	return year;
}
#include<stdio.h>
int f(int);
int main(void)
{
	int n;
	scanf_s("%d", &n);
	printf("%d", f(n));
	return 0;
}
int f(int n) {
	int m;
	if (n == 1) m = 1;
	else
	m = n * f(n - 1);
	return m;
}
#include<stdio.h>
int main(void)
{
	int n;
	int m;
	scanf_s("%d", &n);
	/*while (n != 1) {
		m = m * n;
		n--;
	}*/
	for (m = 1; n > 0; n--) {
		m = m * n;
	}
	printf("%d", m);
	return 0;
}
//利用递归实现逆序输出
#include<stdio.h>
void print();
int main(void)
{
	print();
	return 0;
}
void print() 
{
	char c;
	c = getchar();
	if (c != '#')
		print();
	if (c != '#')
		printf("%c", c);
}