#include<stdio.h>
#include <math.h>
void prime(int x, int y){
int waa;
if ( x == 1 ) x++;
if(x <= y){
waa = isPrime(x,2); // second input parameter added
if(waa != 0){
}
prime(x+1,y);
}
}
int isPrime(int n, int i){
if(n%i==0 && n!=2 && n!=i){
return(0);
} else {
return( isPrime(n,i+1) );
} else
return 1;
}
}
int main(){
int num[2];
printf("Input 2 numbers: \n"); scanf("%d %d", &num
[0], &num
[1]); prime(num[0], num[1]);
return 0;
}
I2luY2x1ZGU8c3RkaW8uaD4KI2luY2x1ZGUgPG1hdGguaD4KCnZvaWQgcHJpbWUoaW50IHgsIGludCB5KXsKICAgIGludCB3YWE7CiAgICBpZiAoIHggPT0gMSApIHgrKzsKICAgIGlmKHggPD0geSl7CiAgICAgICAgd2FhID0gaXNQcmltZSh4LDIpOyAvLyBzZWNvbmQgaW5wdXQgcGFyYW1ldGVyIGFkZGVkCiAgICAgICAgaWYod2FhICE9IDApewogICAgICAgIAlwcmludGYoIiU1ZCIseCk7CiAgICAgICAgIH0KICAgICAgICBwcmltZSh4KzEseSk7CiAgICB9Cn0KCmludCBpc1ByaW1lKGludCBuLCBpbnQgaSl7CiAgICBpZihuJWk9PTAgJiYgbiE9MiAmJiBuIT1pKXsKICAgICAgcmV0dXJuKDApOwogICAgfSBlbHNlIHsKICAgICAgIGlmIChpIDwgc3FydChuKSkgewogICAgICAgICAgICByZXR1cm4oIGlzUHJpbWUobixpKzEpICk7CiAgICAgICAgfSBlbHNlCiAgICAgICAgIHJldHVybiAxOwogICAgfQp9CgppbnQgbWFpbigpewogICAgaW50IG51bVsyXTsKCiAgICBwcmludGYoIklucHV0IDIgbnVtYmVyczogXG4iKTsKICAgIHNjYW5mKCIlZCAlZCIsICZudW1bMF0sICZudW1bMV0pOwogICAgcHJpbWUobnVtWzBdLCBudW1bMV0pOwogICAgcmV0dXJuIDA7Cn0K