Introduction - If you have any usage issues, please Google them yourself
Definition: f0 = f1 = 1, fn = fn-1+ Fn-2 (n> = 2). (fi) known as the Fibonacci series. Enter n, for fn mod q. In which 1 <= q <= 30000. Input format: the first line of a few T (1 <= T <= 10000). The following T lines, each line number 2, n, q (n <= 109, 1 <= q <= 30000), Output format: file contains the T line, each line corresponds to an answer.
Packet : 13898381fib.rar filelist
fib.pas