1.

Write a program that will print all prime numbers from a given range which consist of only odd digits. At the end to print the number of primes which satisfy the condition.

i can use only stdio.h not conio or anything else.

2.

Write a program for each of the numbers are printed after the number of transformations that the original number becomes single digits, and print thereceived transformed number. With each transformation of the original number, it is replaced by the sum of its digits.

Example: 721->10->1

3.

To write a program that print diamond asterisks (*). Diamond should have 2 * N - 1 queues, where N is read from the keyboard.

Example: For N = 3 print

--*

-***

*****

-***

--*