Huge Fn mod m - IGGI

Advanced Problem: Huge Fibonacci Number modulo m

http://appinventor.mit.edu/explore/master-trainers.html#nguyen

This app is created using MIT App Inventor to demonstrate its ability in CS courses, especially Algorithms.

=================

Problem Introduction: The Fibonacci numbers are defined as follows: F0 = 0, F1 = 1, and Fi = Fi−1 + Fi−2 for i ≥ 2.

Task: Given two integers n and m, output Fn mod m (that is, the remainder of Fn when divided by m).

Input Format: The input consists of two integers n and m given on the same line (separated by a space).

Constraints: 1 ≤ n ≤ 1018, 2 ≤ m ≤ 105

Output Format: Output Fn mod m.

.==================