Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <math.h>
- long long int is_prime(long long int n) {
- int i;
- if(n == 1) return 0;
- else if(n == 2) return 1;
- else if(n % 2 == 0) return 0;
- else {
- for(i = 3; i <= sqrt(n); i = i + 2) {
- if(n % i == 0) return 0;
- }
- }
- return 1;
- }
- main()
- {
- long long int p,q,i,T,t;
- scanf("%lld",&T);
- for(t = 1; t <= T; t++) {
- scanf("%lld %lld",&p,&q);
- for(i = p; i <= q; i++) {
- if(1 == is_prime(i))
- printf("%lld\n",i);
- }
- printf("\n");
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement