Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- long long int divisor(long long int n)
- {
- long long int div=0,i;
- for(i=1; i*i<=n; i++)
- {
- if(n%i==0)
- {
- if(n/i==i)
- div++;
- else
- div+=2;
- }
- }
- return div;
- }
- int main()
- {
- long long int l,r,i,j,k,t,ans,mx=0,a,b,c;
- cin>>t;
- while(t--)
- {
- cin>>l>>r;
- mx=0;
- for(i=l; i<=r; i++)
- {
- a=divisor(i);
- if(a>mx)
- {
- mx=a;
- ans=i;
- }
- }
- cout<<"Between "<<l<<" and "<<r<<", "<<ans<<" has a maximum of "<<mx<<" divisors."<<endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement