fork(2) download 
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3.  
  4. int sprawdz_pierwsze(int m, int n){
  5.  
  6. int p[100000];
  7. int y,x;
  8.  
  9. for(x=0;x<n-m+1;x++){
  10.  
  11. 	p[x]=m+x;
  12.  
  13. 	if(p[x]==2){
  14. 		printf("%d",p[x]);
  15. 		printf("\n");
  16. 	}
  17.  
  18. 	else{
  19. 		for(y=2;y<p[x];y++){
  20. 			if(p[x]%y==0){
  21. 			break;
  22. 			}
  23.  
  24. 			if(y==p[x]-1){
  25. 			printf("%d",p[x]);
  26. 			printf("\n");
  27. 			}
  28. 		}
  29. 	}
  30.  
  31. }
  32.  
  33. }
  34.  
  35.  
  36. int main(int argc, char *argv[]) {
  37. int m[10],n[10],y,t;
  38.  
  39. 	scanf("%d",&t);
  40. for(y=0;y<t;y++){
  41. 	scanf("%d %d",&m[y],&n[y]);
  42. }
  43.  
  44. for(y=0;y<t;y++){
  45. 	sprawdz_pierwsze(m[y],n[y]);
  46. 	printf("\n");
  47. }
  48.  
  49.  
  50.  
  51. return 0;
  52. }
Success #stdin #stdout 0s 2164KB
comments (?)
stdin 
2
1 10
3 5
stdout 
2
3
5
7

3
5
https://ideone.com/gbrcky
problem PRIME1, based on SPOJ submission 16077866 (C), 2016-01-13 21:40:46
language:
C (gcc 8.3)
created:
9 years ago
visibility:
public

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!