fork(1) download
copy 
  1. #include<stdio.h>
  2. #include <math.h>
  3.  
  4. void prime(int x, int y){
  5.     int waa;
  6.     if ( x == 1 ) x++;
  7.     if(x <= y){
  8.         waa = isPrime(x,2); // second input parameter added
  9.         if(waa != 0){
  10.         	printf("%5d",x);
  11.          }
  12.         prime(x+1,y);
  13.     }
  14. }
  15.  
  16. int isPrime(int n, int i){
  17.     if(n%i==0 && n!=2 && n!=i){
  18.       return(0);
  19.     } else {
  20.        if (i < sqrt(n)) {
  21.             return( isPrime(n,i+1) );
  22.         } else
  23.          return 1;
  24.     }
  25. }
  26.  
  27. int main(){
  28.     int num[2];
  29.  
  30.     printf("Input 2 numbers: \n");
  31.     scanf("%d %d", &num[0], &num[1]);
  32.     prime(num[0], num[1]);
  33.     return 0;
  34. }
  35.  
Success #stdin #stdout 0s 2296KB
comments (?)
stdin
copy 
1
10
stdout
copy 
Input 2 numbers: 
    2    3    5    7
https://ideone.com/gyW7ED
language:
C (gcc 8.3)
created:
12 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!