Advertisement
Guest User

Composite Numbers Having 7

a guest
Sep 19th, 2014
261
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 2.07 KB | None | 0 0
  1. //Bismillahir Rahmanir Rahim
  2. /******Harun Or Rashid******/
  3. /***********Template Starts Here***********/
  4. #include<iostream>
  5. #include<cstdio>
  6. #include<cstring>
  7. #include<cmath>
  8. #include<cctype>
  9. #include<cstdlib>
  10. #include<cassert>
  11. #include<string>
  12. #include<vector>
  13. #include<set>
  14. #include<stack>
  15. #include<queue>
  16. #include<map>
  17. #include<algorithm>
  18. using namespace std;
  19.  
  20. #define MEM(a,b) memset(a,b,sizeof(a))
  21. #define CLR(a) memset(a,0,sizeof(a))
  22. #define MAX(a,b) ((a)>(b)?(a):(b))
  23. #define MIN(a,b) ((a)>(b)?(b):(a))
  24. #define ABS(a) ((a)>0? (a):(-(a)))
  25. #define SQ(a) ((a)*(a))
  26. #define SZ(a) (int)a.size()
  27. #define FORN(i,n) for(i=1;i<=n;i++)
  28. #define FORAB(i,a,b) for(i=a;i<=b;i++)
  29. #define ALL(V) V.begin(),V.end()
  30. #define pb(a) push_back(a)
  31. #define pr(a) cout<<a<<endl
  32. #define SQR(a) ((a)*(a))
  33. #define pf printf
  34. #define sf scanf
  35. #define swap(a,b) (a ^= b, b ^= a, a ^= b)
  36. #define PI acos(-1)
  37. #define x first
  38. #define y second
  39. #define eps 1e-7
  40.  
  41. typedef int D;
  42. typedef long long int LLD;
  43. typedef unsigned long long int LLU;
  44. typedef vector<D> VI;
  45. typedef set<D> SI;
  46. typedef vector<D>::iterator Viti;
  47.  
  48. /***********Template Ends Here***********/
  49.  
  50. int main()
  51. {
  52.     int T,m,n,cnt;
  53.     cin>>T;
  54.     while(T--)
  55.     {
  56.         cin>>m>>n;
  57.         bool prime[n+1];
  58.         int i,j;
  59.         memset(prime,true,sizeof prime);
  60.         prime[0]=prime[1]=false;
  61.         for(i=4; i<=n; i+=2) prime[i]=false;
  62.         for(i=3; i*i<=n; i+=2)
  63.             if(prime[i])
  64.                 for(j=i*i; j<=n; j+=i+i)
  65.                     prime[j]=false;
  66.         cnt=0;
  67.         for(i=0; i<=n; i++)
  68.             if(prime[i]==false)
  69.                 if(i>=m)
  70.                 {
  71.                     int x=i;
  72.                     while(x)
  73.                     {
  74.                         if(x%10==7)
  75.                         {
  76.                             cnt++;
  77.                             break;
  78.                         }
  79.                         x/=10;
  80.                     }
  81.                 }
  82.         if(cnt)
  83.             cout<<cnt<<endl;
  84.         else cout<<"-1"<<endl;
  85.     }
  86.     return 0;
  87. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement