Huge Fn mod m - IGGI

Huge Fn mod m - IGGI

  • 1.4 MB

    Saiz Fail

  • Everyone

  • Android 1.6+

    Android OS

Mengenai 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.

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

Tunjukkan Lagi

What's new in the latest 1.6

Last updated on Jan 2, 2019
Minor bug fixes and improvements. Install or update to the newest version to check it out!
Tunjukkan Lagi

Video dan tangkapan skrin

  • Huge Fn mod m - IGGI penulis hantaran
  • Huge Fn mod m - IGGI syot layar 1
  • Huge Fn mod m - IGGI syot layar 2

Versi lama Huge Fn mod m - IGGI

APKPure ikon

Muat Turun Super Pantas dan Selamat melalui Apl APKPure

Satu klik untuk memasang fail XAPK/APK pada Android!

Muat Turun APKPure
thank icon
Kami gunakan kuki dan teknologi yang lain pada laman web ini untuk menambah baik pengalaman anda.
Dengan klik mana-mana pautan pada halaman ini, anda bersetuju dengan Dasar Privasi dan Dasar Kuki kami.
Baca Yang Selanjutnya