Statistics

Problem Statement for "ThePowers"

Problem Statement

John chooses positive integer X that is at most A and Brus chooses positive integer Y that is at most B. Then they calculate X to the power of Y, i.e., X^Y. Return the number of different results they can get.

Definition

Class:
ThePowers
Method:
find
Parameters:
int, int
Returns:
long
Method signature:
long find(int A, int B)
(be sure your method is public)

Constraints

  • A will be between 1 and 1,000,000,000, inclusive.
  • B will be between 1 and 1,000,000,000, inclusive.

Examples

  1. 7

    4

    Returns: 23

    There are 23 possible results: 1 = 1^1 = 1^2 = 1^3 = 1^4, 2 = 2^1, 3 = 3^1, 4 = 2^2 = 4^1, 5 = 5^1, 6 = 6^1, 7 = 7^1, 8 = 2^3, 9 = 3^2, 16 = 2^4 = 4^2, 25 = 5^2, 27 = 3^3, 36 = 6^2, 49 = 7^2, 64 = 4^3, 81 = 3^4, 125 = 5^3, 216 = 6^3, 256 = 4^4, 343 = 7^3, 625 = 5^4, 1296 = 6^4 and 2401 = 7^4.

  2. 1

    1

    Returns: 1

  3. 1000000000

    1000000000

    Returns: 999983644283653287

  4. 999999999

    5

    Returns: 4999934406

  5. 2

    2

    Returns: 3

  6. 62

    78

    Returns: 4404

  7. 97

    56

    Returns: 5054

  8. 1

    1000000000

    Returns: 1

  9. 1000000000

    1000000000

    Returns: 999983644283653287

  10. 57

    30

    Returns: 1544

  11. 723696

    643275

    Returns: 465227494558

  12. 38986

    199585

    Returns: 7757156683

  13. 393417

    248223

    Returns: 97566158576

  14. 104052

    788483

    Returns: 81893310701

  15. 727064

    370488

    Returns: 269190698216

  16. 765462

    862778

    Returns: 659998974987

  17. 497597

    691556

    Returns: 343839160164

  18. 222065

    240231

    Returns: 53281439812

  19. 529199

    85992

    Returns: 45471406505

  20. 339257

    189830

    Returns: 64337869979

  21. 6

    925643275

    Returns: 4165394739

  22. 6

    644199585

    Returns: 2898898134

  23. 7

    255248223

    Returns: 1403865228

  24. 2

    517788483

    Returns: 517788484

  25. 4

    610370488

    Returns: 1525926221

  26. 2

    643862778

    Returns: 643862779

  27. 7

    43691556

    Returns: 240303559

  28. 5

    229240231

    Returns: 802340810

  29. 9

    190085992

    Returns: 1235558949

  30. 7

    174189830

    Returns: 958044066

  31. 347723696

    925643275

    Returns: 321859112964048716

  32. 65038986

    644199585

    Returns: 41895345253964246

  33. 333393417

    255248223

    Returns: 85095649783014866

  34. 683104052

    517788483

    Returns: 353696395254640680

  35. 434727064

    610370488

    Returns: 265337953418936568

  36. 454765462

    643862778

    Returns: 292799416955848825

  37. 852497597

    43691556

    Returns: 37246286080478416

  38. 558222065

    229240231

    Returns: 127964143762175742

  39. 729529199

    190085992

    Returns: 138670621049996254

  40. 297339257

    174189830

    Returns: 51791908877257348

  41. 347723696

    5

    Returns: 1738579512

  42. 65038986

    5

    Returns: 325177823

  43. 333393417

    3

    Returns: 1000160632

  44. 683104052

    3

    Returns: 2049284289

  45. 1000000000

    2

    Returns: 1999968378

  46. 74

    47

    Returns: 3193

  47. 30

    1000000000

    Returns: 25916666667

  48. 934567210

    934567210

    Returns: 873401087585208208

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: