Advertisement
Saleh127

UVA 10830

Jan 13th, 2021
116
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.51 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define ll long long
  4. ll csod(ll n)
  5. {
  6. ll i,j,k,l,ans=0;
  7. for(i=2;i<=sqrt(n);i++)
  8. {
  9. j=n/i;
  10. ans+=((j+i)*(j-i+1))/2;
  11. ans+=(i*(j-i));
  12. }
  13. return ans;
  14. }
  15.  
  16. int main()
  17. {
  18. ios_base::sync_with_stdio(0);
  19. cin.tie(0);cout.tie(0);
  20.  
  21.  
  22. ll cs=1,a;
  23. while(cin>>a && a!=0)
  24. {
  25.  
  26. cout<<"Case "<<cs++<<": "<<csod(a)<<endl;
  27.  
  28. }
  29.  
  30. return 0;
  31. }
  32. ///if 1 and n consider then answer is ans+=(n*(n+1))/2 + n-1;
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement