Submission #19723706

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll=long long;
using ld=long double;
using mint = modint1000000007;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
#define PI acos(-1)
#define oo 2e18
template<typename T1, typename T2>
bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
template<typename T1, typename T2>
bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
/*
100 
100/9 = 11 > 9だからみる価値なし？
100/10
100/11 = 9...1
100/12 = 

19
24
49
99
商が、1~root(N)まで？
1あまり1=99
2あまり2=98/2=49
*/
int main(){
  cin.tie(0);
  ios::sync_with_stdio(0);
  
  ll N;
  cin >> N;
  ll ans = 0;
  for(ll i=1; i*i<N; i++){ // あまりをひいている。
    ll n = N-i;
    if (n%i == 0){
      if (n/i == i) continue;
//      cout << n/i << endl;
      ans += n/i;
    }
  }
  cout << ans << endl;
}

Submission Info

Judge Result