#define _CRT_SECURE_NO_WARNINGS 1
#include "test.h"
//打印乘法口诀表
int MtTable(int n)
{
int i = 0;
for (i = 0; i <= n; i++)
{
int j = 0;
for (j = 0; j <= i; j++)
{
printf("%d*%d=%-2d ", i, j, i*j);
}
printf("\n");
}
}
//两个数的交换
int Exchangenum(int* x, int* y)
{
int temp = 0;
temp = *x;
*x = *y;
*y = temp;
return 0;
}
//判断year是不是润年
int IsLeepYear(int year)
{
if (year % 4 == 0 && year % 100 != 0 || (year % 400 == 0))
{
printf("%d是闰年\n",year);
}
else
{
printf("%d不是闰年\n", year);
}
}
//判断一个数是不是素数
int IsPrime(int num)
{
int i = 0;
for (i = 2; i <=sqrt((double)num); i++)
{
if (0 == num%i)
{
printf("%d不是素数\n", num);
break;
}
}
if (i > sqrt((double)num))
{
printf("%d是素数\n", num);
}
}
//输出数组
int Output(int arr[],int len)
{
int i = 0;
for (i = 0; i < len; i++)
{
printf("%d ", arr[i]);
}
printf("\n");
}
//初始化数组
int Init(int arr[],int len)
{
int i = 0;
for (i = 0; i < len; i++)
{
scanf("%d", &arr[i]);
}
}
//清空数组
int Empty(int arr[],int len)
{
int i = 0;
for (i = 0; i < len; i++)
{
arr[i] =0;
}
}
//数组元素逆置
int Reverse(int arr[], int len)
{
int i = 0;
int j = len-1;
int tmp = 0;
for (i = 0; i < j / 2; i++)
{
tmp = arr[i];
arr[i] = arr[j-i];
arr[j-i] = tmp;
}
/*while (i < j)
{
tmp = arr[i];
arr[i] = arr[j];
arr[j] = tmp;
i++;
j--;
}*/
}
函数的使用 main.c
//打印乘法口诀表
#include "test.h"
int main()
{
int n = 0;
scanf("%d", &n);
MtTable(n);
system("pause");
return 0;
}
//两个数的交换
#include "test.h"
int main()
{
int a = 67;
int b = 33;
printf("a=%d,b=%d\n", a, b);
Exchangenum(&a, &b);
printf("a=%d,b=%d\n", a, b);
system("pause");
return 0;
}
//判断一个数是不是素数
#include "test.h"
int main()
{
int num = 0;
scanf("%d", &num);
IsPrime(num);
system("pause");
return 0;
}
//判断year是不是润年
#include "test.h"
int main()
{
int year = 0;
scanf("%d", &year);
IsLeepYear(year);
system("pause");
return 0;
}
//数组
#include "test.h"
int main()
{
int arr[10] = {1,2,3,4,5,6,7,8,8,8};
int len = sizeof(arr) / sizeof(arr[0]);
Init(arr,len);//初始化数组
Output(arr, len);//输出数组
Reverse(arr, len);//数组元素逆置
Output(arr, len);//输出数组
Empty(arr, len);//清空数组
Output(arr, len);//输出数组
system("pause");
return 0;
}