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
• 8300 Finishers

M3 Challenge Problem Group

• 20 Problems
• 20 Finishers

Programování - Cody

• 12 Problems
• 462 Finishers

Like (3)

Difficulty:

(6729)

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

• Return elements unique to either input

  777 Solvers

• Right Triangle Side Lengths (Inspired by Project Euler Problem 39)

  1886 Solvers

• Relative ratio of "1" in binary number

  1454 Solvers

• Alternately upper-lower case

  235 Solvers

• The Top 5 Primes

  321 Solvers

More from this Author44

• row-th maximum row elements

  38 Solvers

• Cat, Meowcat and Concatenation

  43 Solvers

• I want eval

  25 Solvers

• Neither minima nor maxima

  89 Solvers

• Signal Processing Basic - 1. Stretch a signal

  11 Solvers