1.走台阶问题

设一个函数fit(n)是求n阶台阶有几种走法
第一步迈1个台阶    那有fit(n-1)种走法
第一步迈连个台阶    有fit(n-2)种走法
所以n阶台阶一共有fit(n-1)+fit(n-2)种走法
斐波那契数列int fit(int n)
{if (n <= 2)return n;elsereturn fit(n - 1) + fit(n - 2);
}
int main()
{int n = 0;scanf("%d",&n);int m = fit(n);printf("%d",m);return 0;
}

2.序列中删除指定数字

int main()
{int n = 0;int i = 0;scanf("%d",&n);int arr[50] = {0};for (i = 0; i < n; i++){scanf("%d",&arr[i]);}int del = 0;scanf("%d",&del);int j = 0;for (i = 0; i < n; i++){if (arr[i] != del){arr[j++] = arr[i];//先用后加加}}for (i = 0; i < j; i++){printf("%d",arr[i]);}return 0;
}

3.最高分最低分之差
 

int main()
{int n = 0;scanf("%d",&n);int arr[50] = { 0 };int i = 0;for (i = 0; i < n; i++){scanf("%d",&arr[i]);}int max = arr[0];int min = arr[0];for (i = 1; i < n; i++){if (arr[i] > max){max = arr[i];}}for (i = 1; i < n; i++){if (arr[i] < min){min = arr[i];}}int a = max - min;printf("%d",a);return 0;
}

4.字母大小写转换

int main()
{char ch = 0;//scanf读取成功返回读取数据的个数，读取失败返回EOFwhile (scanf("%c", &ch)==1){if (ch >= 'a' && ch <= "z"){printf("%c\n", ch - 32);}elseprintf("%c\n", ch + 32);getchar();//把\n去掉}return 0;
}

5.判断是不是字母

int main()
{char ch = 0;//%c前面加一个空格，跳过下一个字符之前的所有空白字符while (scanf(" %c", &ch) == 1){if (ch >= 'A' && ch <= 'Z' || ch >= 'a' && ch <= 'z'){printf("%c 是\n",ch);}elseprintf("%c bushi\n",ch);getchar();}return 0;
}

6.判断最高分

//判断最高分
int main()
{int n = 0;int max = 0;int i = 0;for (i = 1; i < 4; i++){scanf("%d",n);if (n > max)max = n;}printf("%d",max);return 0;
}

7.变种水仙花

把任意数字从中间拆分拆分后的乘积之和等于自身，则是一个水仙花

例如：655=6*55+65*5

int main()
{int i = 0;for (i = 10000; i <= 99999; i++){int sum = 0;int j = 0;for (j = 1; j <= 4; j++){int k = (int)pow(10, j);//求次方sum += i / k + i % k;}if (sum == i)printf("%d",i);}return 0;
}