A number is said to be lucky, if it satisfies the following conditions: Condition1: Number itself must be a prime Number. Condition2: sum of all digits of given number must be a prime number. Write a program to print all lucky numbers between 1 and 100. Ans : 1 2 3 5 7 11 23 29 41 43 47 61 67 83 89

#include<stdio.h>
#include<conio.h>
main ()
{
  int i, j, prime = 0,sum=0;
  clrscr();
  printf("\n_____________________________\n");
  printf("\nDisplay all Prime numbers\n");
  printf("_____________________________\n");
  for (i = 1; i < 100; i++)
    {
      prime = 0;
      for (j = 2; j < (i / 2) + 1; j++)
    {
      if (i % j == 0)
        {
          prime = 1;
          break;
        }
    }
      if (prime == 0)
    {
      printf ("%d is prime number\n", i);
      sum=sum+i;
    }

    }
    printf("\n\n");
    printf("the sum of prime no is=> %d",sum);
    getch();
}

    OUTPUT
_____________________________

Display all Prime numbers
_____________________________
1 is prime number
2 is prime number
3 is prime number
5 is prime number
7 is prime number
11 is prime number
13 is prime number
17 is prime number
19 is prime number
23 is prime number
29 is prime number
31 is prime number
37 is prime number
41 is prime number
43 is prime number
47 is prime number
53 is prime number
59 is prime number
61 is prime number
67 is prime number
71 is prime number
73 is prime number
79 is prime number
83 is prime number
89 is prime number
97 is prime number


the sum of prime no is=> 1061