Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #define MOD 59999
- #define LL long long
- using namespace std;
- LL Exp(LL &n,LL d) /// Calculez exponentul divizorului d
- {
- LL exp=0;
- while(n%d==0)
- ++exp,n/=d;
- return exp;
- }
- int main()
- {
- LL n;
- cin>>n;
- LL nc=n,exp,nr_div=1; /// nc pastreaza valoarea lui n
- exp=Exp(n,2); /// Calculez exponentul lui 2
- nr_div=(nr_div*(exp*nc+1))%MOD; /// Calculez numarul de divizori
- for(LL d=3;d*d<=n;d+=2)
- if(n%d==0)
- exp=Exp(n,d),nr_div=(nr_div*(exp*nc+1))%MOD; /// Calculez exponentul lui d apoi numarul de divizori
- if(n>1) /// Daca mai exista un divizor al lui n
- nr_div=(nr_div*(nc+1))%MOD; /// Calculez numarul lor
- cout<<nr_div;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement