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:

(6717)

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

• Given a window, how many subsets of a vector sum positive

  856 Solvers

• Unique values without using UNIQUE function

  371 Solvers

• What percentage?

  474 Solvers

• The Top 5 Primes

  321 Solvers

• Verify Law of Large Numbers

  11079 Solvers

More from this Author44

• weekday and month

  51 Solvers

• row-th maximum row elements

  38 Solvers

• Graph Algorithms 3: Number of Connected Components

  24 Solvers

• BLOCK x3 (Version 2)

  5 Solvers

• Magnet and Iron

  119 Solvers