Advertisement
Saleh127

UVA 1730

May 13th, 2021
116
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.42 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define ll long long
  4. #define maX 20000002
  5. ll ans[maX],di[maX];
  6. int main()
  7. {
  8.  
  9.  
  10. ll i,j,k,l;
  11.  
  12. for(i=1; i<=maX; i++)
  13. {
  14. for(j=i; j<=maX; j+=i)
  15. {
  16. di[j]+=i;
  17. }
  18. }
  19.  
  20. for(i=2; i<=maX; i++)
  21. {
  22. ans[i]=di[i]+ans[i-1];
  23. }
  24.  
  25. while(cin>>k && k)
  26. {
  27. cout<<ans[k]<<endl;
  28. }
  29.  
  30. return 0;
  31. }
  32.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement