Problem 2797. modular arithmetic

• Created by rifat
• Appears in 2 groups

×

By solving this problem, you will make progress in the following group(s)

Sequences & Series I

• 14 Problems
• 87 Finishers

Basics - Fibonacci

• 8 Problems
• 353 Finishers

Like (3)

Difficulty:

(605)

Rate

• Solve Later   
• Add To GroupÂ

Given three integers a,b and c, find the remainder when a^b is divided by c. Here, a^b will be well beyond the largest 64 bit integer.

Example:

a = 1000
b = 1000
c = 3

Answer = 1

Solve

Solution Stats

21.81% Correct | 78.19% Incorrect

• 353 Solutions
• 69 Solvers

Last Solution submitted on Feb 26, 2025

Last 200 Solutions

Solution Comments

Problem Recent Solvers69

Suggested Problems

• Summing digits

  7723 Solvers

• Converting Decimal to Binary

  72 Solvers

• Check if number exists in vector

  12226 Solvers

• Return area of square

  15517 Solvers

• Enlarge array

  266 Solvers

More from this Author44

• Magnet and Iron

  119 Solvers

• longest common substring : Skipped character version

  30 Solvers

• Integer sequence - 2 : Kolakoski sequence

  168 Solvers

• Integer Sequence - 1

  66 Solvers

• Create Combination

  65 Solvers