1.斐波那契数列
#include<stdio.h>
int Fib(int x) {
if (x <3) {
printf("return 1!\n");
return(1);
}
else {
printf("Fib(%d) and Fib(%d)\n", x - 2, x - 1);
return(Fib(x - 2) + Fib(x - 1));
}
}
int main() {
int n, y;
printf("Please enter a number:");
scanf("%d", &n);
y = Fib(n);
printf("%d is the Fib number\n", y);
return 0;
}
形参传递不改变main函数中实参的值,用&x定义一个引用,同时对其进行初始化,使其指向一个已存在的对象,从而对其操作相当于对实参进行操作,改变实参的值。(swap函数)
2.函数重载
#include<stdio.h>
#include<cmath>
double max1(double x, double y) {
if (abs(x - y) <1e-10) //判断浮点数是否相等的常见处理方式
return x;
else if (x >= y)
return x;
else return y;
}
int max1(int x, int y) {
if (x == y)
return x;
else if (x > y)
return x;
else return y;
}
int max1(int x, int y, int z) {
return max1(max1(x, y), z);
}
double max1(double x, double y, double z) {
return max1(max1(x, y), z);
}
int main() {
int a, b, c;
double m, n, l;
printf("Enter int a:");
scanf("%d", &a);
printf("Enter int b:");
scanf("%d", &b);
printf("Enter int c:");
scanf("%d", &c);
printf("max of %d and %d is %d\n", a, b, max1(a, b));
printf("max of %d , %d and %d is %d\n", a, b, c, max1(a, b, c));
printf("Enter double m:");
scanf("%lf", &m);
printf("Enter double n:");
scanf("%lf", &n);
printf("Enter double l:");
scanf("%lf", &l);
printf("max of %lf and %lf is %lf\n", m, n, max1(m, n));
printf("max of %lf , %lf and %lf is %lf\n", m, n, l, max1(m, n, l));
return 0;
}
double类型数据输入为%lf,输出可以是%f或%lf。
3.回文数
#include<stdio.h>
bool symm(unsigned n) {
unsigned i = n;
unsigned m = 0;
while (i > 0) {
m = m * 10 + i % 10;
i /= 10;
}
return m == n;
}
int main() {
for (unsigned m = 11; m < 1000; m++) {
if (symm(m) && symm(m*m) && symm(m*m*m)) {
printf("%d\n", m);
printf("%d\n", m*m);
printf("%d\n", m*m*m);
}
return 0;
}
}
扫描二维码关注公众号,回复:
4808500 查看本文章