HDU - 2855 Fibonacci Check-up
2017-12-10 22:58
309 查看
Fibonacci Check-up
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1653 Accepted Submission(s): 935
Problem Description
Every ALPC has his own alpc-number just like alpc12, alpc55, alpc62 etc.
As more and more fresh man join us. How to number them? And how to avoid their alpc-number conflicted?
Of course, we can number them one by one, but that’s too bored! So ALPCs use another method called Fibonacci Check-up in spite of collision.
First you should multiply all digit of your studying number to get a number n (maybe huge).
Then use Fibonacci Check-up!
Fibonacci sequence is well-known to everyone. People define Fibonacci sequence as follows: F(0) = 0, F(1) = 1. F(n) = F(n-1) + F(n-2), n>=2. It’s easy for us to calculate F(n) mod m.
But in this method we make the problem has more challenge. We calculate the formula
, is the combination number. The answer mod m (the total number of
alpc team members) is just your alpc-number.
Input
First line is the testcase T.
Following T lines, each line is two integers n, m ( 0<= n <= 10^9, 1 <= m <= 30000 )
Output
Output the alpc-number.
Sample Input
2
1 30000
2 30000
Sample Output
1
3
相关文章推荐
- HDU2855 Fibonacci Check-up 矩阵的应用
- hdu 2855 Fibonacci Check-up
- HDU 2855 Fibonacci Check-up 矩阵
- hdu-2855 Fibonacci Check-up
- hdu 2855 Fibonacci Check-up 矩阵+斐波那契通项公式
- hdu 2855 Fibonacci Check-up
- hdu 2855 Fibonacci Check-up(犀利的推导公式)
- HDU 2855:Fibonacci Check-up_斐波拉契问题
- 【HDU 2855】 Fibonacci Check-up (矩阵乘法)
- hdu 2855 Fibonacci Check-up (矩阵)
- HDU 2855 Fibonacci Check-up 构造矩阵
- hdu 2855 Fibonacci Check-up【递推+矩阵快速幂】
- HDU - 2855 Fibonacci Check-up 斐波那契矩阵
- hdu 2855 Fibonacci Check-up(矩阵乘法)
- hdu 2855 Fibonacci Check-up
- HDU - 2855 Fibonacci Check-up 矩阵快速幂
- hdoj 2855 Fibonacci Check-up 【打表找规律 + 矩阵快速幂】
- HDOJ 题目2855 Fibonacci Check-up(矩阵快速幂)
- Fibonacci Check-up (HDU 谢庆皇)
- 杭电2855 Fibonacci Check-up