Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int n=100000;
- vector <int> divisor[100005];
- void sieve()
- {
- int i,j;
- for(i=1;i<=n;i++)
- {
- for(j=i;j<=n;j+=i)
- {
- divisor[j].push_back(i);
- }
- }
- }
- int main()
- {
- ios_base::sync_with_stdio(0);
- cin.tie(0);
- cout.tie(0);
- sieve();
- int m,t,i,j;
- long long ans;
- int mod=1e9+7;
- cin>>t;
- while(t--)
- {
- cin>>m;
- ans=1;
- for(i=0;i<divisor[m].size();i++)
- {
- // cout<<divisor[n][i]<<" ";
- ans=(ans*(divisor[m].at(i)+1))%mod;
- }
- cout<<ans-1<<endl;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement