fork download
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3.  
  4. typedef long long int ll;
  5. #define IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  6.  
  7. typedef pair<int,int>pr;
  8. #define all(i) i.begin() , i.end()
  9. #define ft first
  10. #define sn second
  11. #define pb push_back
  12.  
  13.  
  14. #define en "\n"
  15. #define dbg cout<<"rony\n";
  16.  
  17. #define MAXN 100010
  18. #define inf 1e8
  19. const int mod = 1e9+7;
  20.  
  21. void solve()
  22. {
  23. ll n;
  24. cin >> n;
  25. ll lst = n;
  26. ll an = 0;
  27.  
  28. bool ok = false;
  29. ll i;
  30. vector<ll>v;
  31. ll mx = INT_MIN;
  32. ll mn = INT_MAX;
  33.  
  34. for( i = 1;i*i <= n;i++)
  35. {
  36. ll d1 = n/i;
  37. v.pb(d1);
  38. v.pb(i);
  39. if(i*i == n) ok = true;
  40. an += d1;
  41. ll x = lst - d1;
  42. if(x >= 0){
  43. an += (x * (i-1LL)) ;
  44. }
  45. lst = d1;
  46. mx = max(mx,(i-1));
  47. mn = min(mn,d1);
  48.  
  49. }
  50.  
  51. ll j = i;
  52.  
  53. for(auto i:v){
  54. if(i > mx && i < mn){
  55.  
  56. ll x = lst - (n/j);
  57. an += (x*(i));
  58. }
  59. }
  60.  
  61. cout<<an<<en;
  62.  
  63.  
  64. }
  65. int main()
  66. {
  67. IOS;
  68. int t;
  69. t = 1;
  70.  
  71. cin >> t;
  72. int c = 0;
  73. while ( t-- )
  74. {
  75. //cout<<"Case "<<++c<<": ";
  76. solve();
  77. }
  78. return 0;
  79. }
Success #stdin #stdout 0.17s 134608KB
stdin
Standard input is empty
stdout
703405988642673