-
Notifications
You must be signed in to change notification settings - Fork 3
/
day034.c
71 lines (62 loc) · 1.66 KB
/
day034.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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
#include <stdio.h>
int isPrime(int in_num){
int i, prime_flag = 0;
for(i=2; i<= in_num/2; i++){
if(in_num%i == 0){
prime_flag = 1;
}
}
if(in_num != 1){
if(prime_flag == 0){
return 1;
}
}
return 0;
}
int main(void) {
int array_in[50], array_in_size, odd_prime_sum = 0, even_prime_sum = 0, odd_prime_flag = 0, even_prime_flag = 0;
printf("Enter the size of the array\n");
scanf("%d", &array_in_size);
printf("Input %d integer numbers\n", array_in_size);
for(int i=0; i<array_in_size; i++)
scanf("%d", &array_in[i]);
// check odd prime is available !!!
for(int i=1; i<array_in_size; i = i+2){
if(isPrime(array_in[i])){
odd_prime_flag = 1;
}
}
// check even prime is available !!!
for(int i=0; i<array_in_size; i = i+2){
if(isPrime(array_in[i])){
even_prime_flag = 1;
}
}
// perform prime Summation for odd
if(odd_prime_flag){
printf("Odd positioned prime numbers are\n");
for(int i=1; i<array_in_size; i = i+2){
if(isPrime(array_in[i])){
printf("%d\n", array_in[i]);
odd_prime_sum = odd_prime_sum + array_in[i];
}
}
printf("Summation is %d\n", odd_prime_sum);
}else{
printf("No odd positioned prime numbers\n");
}
// perform prime Summation for Even
if(even_prime_flag){
printf("Even positioned prime numbers are\n");
for(int i=0; i<array_in_size; i = i+2){
if(isPrime(array_in[i])){
printf("%d\n", array_in[i]);
even_prime_sum = even_prime_sum + array_in[i];
}
}
printf("Summation is %d\n", even_prime_sum);
}else{
printf("No even positioned prime numbers\n");
}
return 0;
}