its just my second week on a course and only 5th class .and i tried with incrementing the counter but it didn't work. and thanks for showing me from where my college knew it how to write the...
Type: Posts; User: CnikolaC
its just my second week on a course and only 5th class .and i tried with incrementing the counter but it didn't work. and thanks for showing me from where my college knew it how to write the...
it must be a simple thing to do it but i don't know how. the first operation is entering the number second and third are the calculations but i don't know how to write it to show me that.
I need to modify the program so that will show the number of transformation that are made.
Example:
if i enter 712 it gave me the transformed number witch is 1, but i want to show me the number...
i only know the algorithm for the first one
int i,j,r1,r2,c=0
for i=r1;i<=r2;i++
for j=2;j<=i/2;j++
i am beginner in this so i don't know much.
for the second and third programs i have no die...
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...