1.求出一个整形数组的最大值:
#include <stdio.h>
int main()
{
int i, j, t, a[11];
printf("请输入10个数:\n");
for (i = 1; i < 11; i++)
scanf_s("%d", &a[i]);
for (i = 1; i < 10; i++)
for (j = 1; j < 11 - i; j++)
if (a[j] > a[j + 1])
{
t = a[j];
a[j] = a[j + 1];
a[j + 1] = t;
}//先冒泡排序。
printf("最大值是%d", a[10]);
return 0;
}
2.打印出 100~999 之间的所有水仙花数:
#include <stdio.h>
int main()
{
int num;
int a, b, c;
for (num = 100; num <= 999; num++)
{
a = num % 10;
b = (num / 10) % 10;
c = num / 100;
if (num == a * a * a + b * b * b + c * c * c)
printf("%d\n", num);
}
return 0;
}
3.输入一个数字n,打印出n行的杨辉三角序列:
#include <stdio.h>
int main()
{
int i, j, n = 0;
int a[100][100] = { 0 };
printf("请输入要打印的杨辉三角行数:");
scanf_s("%d", &n);
for (i = 0; i < n; i++)
a[i][0] = 1;
for (i = 1; i < n; i++)
for (j = 1; j <= i; j++)
a[i][j] = a[i - 1][j - 1] + a[i - 1][j];
for (i = 0; i < n; i++)
{
for (j = 0; j <= i; j++)
printf("%5d", a[i][j]);
printf("\n");
}
return 0;
}
5.创建一个含有10个元素的数组,乱序输入元素后升序输出:
#include <stdio.h>
int main()
{
int i, j, t;
int arr[10];
for(i=0;i<=9;i++)
{
scanf_s("%d", &arr [i]);
}
for (i = 0; i < 9; i++)
{
for (j = 0; j < 9 - i; j++)
{
if (arr [j] > arr[j + 1])
{
t = arr [j];
arr [j] = arr [j + 1];
arr [j+1] = t;
}
}
}
for (i = 0; i < 10; i++)
printf("%d ", arr[i]);
return 0;
}
6.输入任意十进制整数 输出该数的8进制:
#include <stdio.h>
#include <math.h>
int main()
{
int a,t,c;
int b = 0;
int n =0;
int num = 0;
scanf_s("%d", &num);
a = num;
while (num >=1)
{ num = num / 10;
n++;}
//求这个数为几位数,此时得到位数n。
for (c = a; c / 8 != 0; n--)
{
b = pow(8, n - 1);
if (b != 0);
t = c / b;
c = c % b;
printf("%d", t);
if ((c/ 8 )==0)
printf("%d", c);
}
return 0;
}
7.输入一串字符串倒序输出:
#include <stdio.h>
#include<string.h>
int main()
{ int len,i;
char str[100];
gets_s(str);
len=strlen(str);
for(i=len-1;i>=0;i--)
printf("%c",str[i]);
return 0;
}
8.输入含有9个元素的有序数组,在输入一个数x,将x插入有序列中:
int main()
{
int i, a[10], n;
for (i = 0; i < 9; i++)
scanf_s("%d", &a[i]);
scanf_s("%d", &n);
int i = 8;
while (i >= 0 && a[i] > n)
{
a[i + 1] = a[i];
i--;
}
i++;
a[i] = n;
for (i = 0; i < 10; i++)
printf("%d\n", a[i]);
return 0;
}