Problem 2797. modular arithmetic

• Created by rifat
• Appears in 3 groups

×

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

Introduction to MATLAB

• 23 Problems
• 8297 Finishers

M3 Challenge Problem Group

• 20 Problems
• 20 Finishers

Programování - Cody

• 12 Problems
• 461 Finishers

Like (3)

Difficulty:

(6718)

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

• Determine whether a vector is monotonically increasing

  21296 Solvers

• All your base are belong to us

  546 Solvers

• Doubling elements in a vector

  8975 Solvers

• What percentage?

  474 Solvers

• Height of a right-angled triangle

  1862 Solvers

More from this Author44

• Beauty of Parentheses

  35 Solvers

• Integer Sequence - 1

  66 Solvers

• Mongean Shuffle

  85 Solvers

• Graph Algorithms 3: Number of Connected Components

  24 Solvers

• self description 2.0

  14 Solvers