fork download
  1. //Lib
  2. #include<cstdio>
  3. #include<cstring>
  4. #include<cstdlib>
  5. #include<cmath>
  6. #include<ctime>
  7.  
  8. #include<iostream>
  9. #include<algorithm>
  10. #include<vector>
  11. #include<string>
  12. #include<queue>
  13. #include<set>
  14. #include<map>
  15. using namespace std;
  16. //Macro
  17. #define rep(i,a,b) for(int i=a,tt=b;i<=tt;++i)
  18. #define drep(i,a,b) for(int i=a,tt=b;i>=tt;--i)
  19. #define erep(i,e,x) for(int i=x;i;i=e[i].next)
  20. #define irep(i,x) for(__typeof(x.begin()) i=x.begin();i!=x.end();i++)
  21. #define read() (strtol(ipos,&ipos,10))
  22. #define sqr(x) ((x)*(x))
  23. #define pb push_back
  24. #define PS system("pause");
  25. typedef long long ll;
  26. typedef pair<int,int> pii;
  27. const int oo=~0U>>1;
  28. const double inf=1e100;
  29. const double eps=1e-6;
  30. string name="num", in=".in", out=".out";
  31. //Var
  32. ll s[22688],a1,a2,n,m,T;
  33. int D(int i){return (i-1)%9+1;}
  34. void Calc()
  35. {
  36. rep(i,1,22680)
  37. if(D(i)*i<=22680)
  38. s[D(i)*i]=1;
  39. }
  40. void Pre()
  41. {
  42. Calc();
  43. rep(i,1,22680)
  44. s[i]+=s[i-1];
  45. }
  46. void Work()
  47. {
  48. scanf("%d",&T);
  49. rep(i,1,T)
  50. {
  51. cin>>n>>m;n--;
  52. if(n!=-1)
  53. {
  54. a1=n/22680*s[22680];
  55. a1+=s[n%22680];
  56. }
  57. else a1=0;
  58. a2=m/22680*s[22680];
  59. a2+=s[m%22680];
  60. cout<<a2-a1<<endl;
  61. }
  62. }
  63. int main()
  64. {
  65. // freopen((name+in).c_str(),"r",stdin);
  66. // freopen((name+out).c_str(),"w",stdout);
  67. // Init();
  68. Pre();
  69. Work();
  70. return 0;
  71. }
Not running #stdin #stdout 0s 0KB
stdin
Standard input is empty
stdout
Standard output is empty