fork(1) download
copy 
  1. #include <iostream>
  2. #include <map>
  3. using namespace std;
  4. int main ()
  5. {
  6.     long long n, sumOfDivisors = 1;
  7.     cin >> n;
  8.     map<long long, long long> primeDivInPow;
  9.     for(long long i = 2; i * i <= n; i++){
  10.         while(n % i == 0){
  11.             if(primeDivInPow.find(i) == primeDivInPow.end()){
  12.                 primeDivInPow[i] = 1;
  13.             }
  14.             primeDivInPow[i] *= i;
  15.             n /= i;
  16.         }
  17.     }
  18.     if(n != 1){
  19.         primeDivInPow[n] = n;
  20.     }
  21.     for(map<long long, long long>::iterator p = primeDivInPow.begin(); p != primeDivInPow.end(); p++){
  22.         sumOfDivisors *= (p -> second - 1) / (p -> first - 1) + p -> second;
  23.     }
  24.     cout << sumOfDivisors;
  25.     return 0;
  26. }
Success #stdin #stdout 0s 4536KB
comments (?)
stdin
copy 
9102837465
stdout
copy 
15799834440
https://ideone.com/GTuHqF
language:
C++14 (gcc 8.3)
created:
5 years ago
visibility:
public

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!