fork download
copy 
  1. /*
  2.  
  3. AUTHOR : Chandan Agrawal
  4. College : Poornima College of Engg. jaipur, Raj
  5. Mail : chandanagrawal23@gmail.com
  6.  
  7.  
  8.   ___  _   _    __    _  _  ____    __    _  _
  9.  / __)( )_( )  /__\  ( \( )(  _ \  /__\  ( \( )
  10. ( (__  ) _ (  /(__)\  )  (  )(_) )/(__)\  )  (
  11.  \___)(_) (_)(__)(__)(_)\_)(____/(__)(__)(_)\_)
  12.  
  13.  
  14.  
  15.  
  16. */
  17. #include<bits/stdc++.h>
  18. #define fastIO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
  19. #include<cstdio>
  20. #define MAX 10000001
  21. #include<stdio.h>
  22. #include<vector>
  23. #include<set>
  24. #include<map>
  25. #include<queue>
  26. #include<stack>
  27. #include<string>
  28. #include<algorithm>
  29. #include<functional>
  30. #include<iomanip>
  31. #include<cstdio>
  32. #include<cmath>
  33. #include<cstring>
  34. #include<cstdlib>
  35. #include<cassert>
  36. #include<unordered_map>
  37. #define ll long long
  38. #define ld long double
  39. #define lli long long int
  40. #define pb push_back
  41. #define INF 1000000000
  42. #define mod 1000000007
  43. #define MOD 1000000007
  44. //#define mp make_pair
  45. #define loop(i,n) for (lli i = 0; i < n; i++)
  46. #define FOR(i,a,b) for (lli i = a; i < b; i+=1)
  47. #define loop_rev(i,n) for (lli i = n-1; i >= 0; i--)
  48. #define FOR_REV(i,a,b) for (lli i = a; i >= b; i--)
  49. #define all(v) v.begin(),v.end()
  50. #define pii pair<int,int>
  51. #define F first
  52. #define S second
  53. #define mii map<lli,lli>
  54. #define vi vector<lli>
  55. #define vvi vector<lli>
  56. #define itr :: iterator it
  57. #define print(x) printf("%lli\n",x);
  58. #define print2(x,y) printf("%lli %lli\n",x,y);
  59. #define print3(x,y,z) printf("%lli %lli %lli\n",x,y,z);
  60. #define scan(x) scanf("%lli",&x);
  61. #define scan2(x,y) scanf("%lli %lli",&x,&y);
  62. #define scan3(x,y,z) scanf("%lli %lli %lli",&x,&y,&z);
  63. #define printarr(a,n) for(lli i=0;i<n;i++)   cout<<a[i]<<" ";    cout<<"\n";
  64. #define scanarr(a,n) for(lli i=0;i<n;i++)    scan(a[i]);
  65. // cout<<fixed<<setprecision(6)<<value;
  66. //#define deb(x) cout<<#x<<" "<<x<<endl;
  67. using namespace std;
  68.  
  69.  
  70.  
  71. lli cntodd(lli n){
  72. 	lli res = 1;
  73. 	while (n % 2 == 0)
  74. 		n = n / 2;
  75.  
  76. 	for (lli i = 3; i <= sqrt(n); i++)
  77. 	{
  78. 		lli cnt = 0;
  79. 		while (n % i == 0) {
  80. 			cnt++;
  81. 			n = n / i;
  82. 		}
  83. 		res *= cnt+1;
  84. 	}
  85. 	if (n >= 2)
  86. 		res *= (2);
  87. 	return res;
  88. }
  89.  
  90. lli cnteven(lli n){
  91. 	lli res = 1;
  92. 	lli cnttw =0;
  93. 	while (n % 2 == 0){
  94. 		n = n / 2;
  95. 		cnttw++;
  96. 	}
  97. 	if(n==1) return cnttw;
  98.  
  99. 	for (lli i = 3; i <= sqrt(n); i++)
  100. 	{
  101. 		lli cnt = 0;
  102. 		while (n % i == 0) {
  103. 			cnt++;
  104. 			n = n / i;
  105. 		}
  106. 		res = res*(cnt+1);
  107. 	}
  108. 	if (n >= 2)
  109. 		res = res*(2);
  110. 	return res*cnttw;
  111.  
  112. return res;
  113. }
  114.  
  115.  
  116.  
  117.  
  118.  
  119.  
  120. void solve(){
  121. lli l,r,bob,alice,cnt=0;
  122. cin>>l>>r;
  123. for(lli i=l;i<=r;i++){
  124.     if(i%2==0){
  125.         bob=cnteven(i);
  126.         alice = cntodd(i);
  127. 		//cout<<"\n";
  128. 		//cout<<bob<<" "<<alice;
  129.         if (abs(bob-alice) <=2) cnt++;
  130.     }
  131.     else{
  132. 			bob = 0;
  133.             alice = cntodd(i);
  134. 		//cout<<"\n";
  135. 		//cout<<bob<<" "<<alice;
  136.             if(alice<=2)
  137.                 cnt++;
  138.     }
  139. }
  140. cout<<cnt;
  141. }
  142.  
  143. int main(){
  144. fastIO
  145. lli t;
  146. cin>>t;
  147. loop(i,t){
  148. cout<<"Case #"<<i+1<<": ";
  149. solve();
  150. cout<<endl;
  151. }
  152.  
  153. }
Success #stdin #stdout 0s 4412KB
comments (?)
stdin
copy 
2
5 10
102 102
stdout
copy 
Case #1: 5
Case #2: 1
https://ideone.com/CBxHy1
language:
C++14 (gcc 8.3)
created:
4 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!