Statistics

Problem Statement for "OddDivisors"

Problem Statement

Let f(x) be the greatest odd divisor of x, where x is a positive integer. You are given a positive integer N. Return f(1)+f(2)+…+f(N).

Definition

Class:
OddDivisors
Method:
findSum
Parameters:
int
Returns:
long
Method signature:
long findSum(int N)
(be sure your method is public)

Constraints

  • N will be between 1 and 1000000000, inclusive.

Examples

  1. 7

    Returns: 21

    f(1)+f(2)+f(3)+f(4)+f(5)+f(6)+f(7)=1+1+3+1+5+3+7=21

  2. 1

    Returns: 1

  3. 777

    Returns: 201537

  4. 1000000000

    Returns: 333333333334181226

  5. 999999999

    Returns: 333333333332228101

  6. 328

    Returns: 35878

  7. 682

    Returns: 155194

  8. 790

    Returns: 208250

  9. 675

    Returns: 152223

  10. 394

    Returns: 51830

  11. 12571

    Returns: 52683771

  12. 95176

    Returns: 3019495236

  13. 32088

    Returns: 343215484

  14. 11859

    Returns: 46884881

  15. 77610

    Returns: 2007787872

  16. 42066

    Returns: 589857576

  17. 85768

    Returns: 2452053728

  18. 14176

    Returns: 66986582

  19. 45224

    Returns: 681739206

  20. 50542

    Returns: 851513538

  21. 939977424

    Returns: 294519185904320510

  22. 704387306

    Returns: 165387159111074046

  23. 914360241

    Returns: 278684883778351235

  24. 907119090

    Returns: 274288348002106490

  25. 368375588

    Returns: 45233524646880100

  26. 458647306

    Returns: 70119117196979106

  27. 266122812

    Returns: 23607117064139852

  28. 259408181

    Returns: 22430868239780363

  29. 227989863

    Returns: 17326459347169793

  30. 666671192

    Returns: 148150159459544002

  31. 535722582

    Returns: 95666228436645486

  32. 739788206

    Returns: 182428863472190212

  33. 206200429

    Returns: 14172872404581673

  34. 889914681

    Returns: 263982713516094237

  35. 567173363

    Returns: 107228541538022371

  36. 2

    Returns: 2

  37. 3

    Returns: 5

  38. 4

    Returns: 6

  39. 5

    Returns: 11

  40. 6

    Returns: 14

  41. 8

    Returns: 22

  42. 9

    Returns: 31

  43. 536870912

    Returns: 96076792050570582

  44. 536870911

    Returns: 96076792050570581

  45. 536870913

    Returns: 96076792587441495

  46. 999898469

    Returns: 333265649870347453

  47. 11000000

    Returns: 40333333422394

  48. 999586148

    Returns: 333057489191684940

  49. 999999989

    Returns: 333333326457228137

  50. 110000000

    Returns: 4033333333886606

  51. 99999999

    Returns: 3333333333080737

  52. 100000000

    Returns: 3333333333471362

  53. 999999997

    Returns: 333333331832228103

  54. 900000000

    Returns: 270000000001383796

  55. 987654321

    Returns: 325153686292870545

  56. 999688885

    Returns: 333125956048712835

  57. 999999998

    Returns: 333333332332228102

  58. 999999996

    Returns: 333333330832228106

  59. 2356725

    Returns: 1851385320119


This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2024, TopCoder, Inc. All rights reserved.
This problem was used for: