//杨辉三角
int main()
{
int a[7] = { 1, 2, 4, 6, 7, 9 };
int i, j, x, t;
scanf_s("%d", &x);
for (i = 0; i<6; i++)
if (x<a[i]) break;
for (j = 6; j>i; j--)
a[j] = a[j - 1];
a[j] = x;
for (i = 0; i<7; i++)
printf("%4d", a[i]);
printf("\n");
}
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
//求第n个斐波那契数
int fib(int n)
{
if (n <= 2) {
return 1;
}
return fib(n - 1) + fib(n - 2);
}
int main()
{
int n = 6;
printf("%d", fib(n));
system("pause");
}
