-
Notifications
You must be signed in to change notification settings - Fork 0
/
prime-composite-special.c
47 lines (37 loc) · 1.27 KB
/
prime-composite-special.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
/*
Write a C program to read numbers from the user until -1 is encountered. Count the number of prime number and composite numbers entered by the user and display the result.
*/
#include <stdio.h>
int main() {
int num;
int primeCount = 0, compositeCount = 0;
printf("Enter numbers separated by spaces (enter -1 to stop):\n");
while (1) {
scanf("%d", &num);
if (num == -1) {
break; // Exit the loop if -1 is encountered
}
// Check if the number is prime
int isPrimeNum = 1; // Assume the number is prime
if (num < 2) {
isPrimeNum = 0; // Numbers less than 2 are not prime
} else {
for (int i = 2; i * i <= num; ++i) {
if (num % i == 0) {
isPrimeNum = 0; // Not a prime number
break;
}
}
}
// Update counts based on whether the number is prime or composite
if (isPrimeNum) {
primeCount++;
} else {
compositeCount++;
}
}
printf("\nResult:\n");
printf("Number of prime numbers: %d\n", primeCount);
printf("Number of composite numbers: %d\n", compositeCount);
return 0;
}