1,print all the prime numbers from 19 to 101.
#include<stdio.h>
int main()
{
int prime_number[83];
int i, j,k=0,l=0;
//i is to input the numbers from 19 to101
//j is divitor from 2 to i-1
//k is order number
for (i = 19; i <= 101;i++)
{
for (j = 2; j < i; j++)
{
if ((i % j) == 0)
break;
else
{
k++;
if (k == i - 2)
{
prime_number[l] = i;
l++;
}
continue;
}
}
k = 0;
}
for (i = 0; i < l; i++)
printf("%d,", prime_number[i]);
return 0;
}
2,print all the divitors of an integer .
#include<stdio.h>
int main()
{
int divisor[90];
int i, j,number, l = 0;
printf("please input a integer,or enter 0 to exit:\n");
for (i = 0; i <= 1024; i++)
{
scanf_s("%d", &number);
if (number == 0)
break;
else
{
for (j = 2; j < number; j++)
{
if ((number % j) == 0)
{
divisor[l] = j;
number = (number / j);
l++; j = 1;
}
else
{
continue;
}
}
if (number != 1)
{
divisor[l] = number;
}
printf("the divitor of the number is:\n");
for (i = 0; i < l; i++)
{
printf("%d*", divisor[i]);
}
printf("%d\n", divisor[i]);
}
}
return 0;
}