#include <stdio.h>
void in_it (int arr[], int n, int max)
{
int i = 0;
for (i = 0; i < ((n<max)?n:max); i++)
{
arr[i] = i + 1;
}
}
void empty (int arr[], int n)
{
int i = 0;
for (i = 0; i < n; i++)
{
arr[i] = 0;
}
}
void reverse (int arr[], int n)
{
int i = 0;
while (i < n)
{
arr[i] = arr[i] ^ arr[n-1];
arr[n-1] = arr[i] ^ arr[n-1];
arr[i] = arr[i] ^ arr[n-1];
i++;
n--;
}
}
int main ()
{
int arr[10] = {0};
int i = 0;
in_it (arr, 10, 5);
reverse (arr, 10);
//empty (arr, 10);
for (i = 0; i < 10; i++)
{
printf("%d\n",arr[i]);
}
return 0;
}
实现一个函数,判断一个数是不是素数
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <math.h>
int is_prime (int num)
{
int i = 0;
for (i = 2; i <= sqrt (num); i++)
{
if(num % i == 0)
{
return 0;
}
}
return 1;
}
int main ()
{
int n = 0;
printf("请输入一个数:\n");
scanf("%d",&n);
if (is_prime (n))
{
printf("是素数!\n");
}
else
{
printf("不是素数!\n");
}
return 0;
}