import java.util.Scanner;
public class Fibonacci{
public static void main(String[] args) {
Scanner scan=new Scanner(System.in);
int n=scan.nextInt();
int m=scan.nextInt();
int p=scan.nextInt();
long sum=0;
for(int i=1;i<=n;i++){
sum+=f(i);
}
int firstY=(int) (sum%f(m));
int lastY=firstY%p;
System.out.println(lastY);
}
public static int f(int n){
if(n==1||n==2){
return 1;
}
return f(n-1)+f(n-2);
}
}
斐波那契
最新推荐文章于 2022-12-02 15:12:14 发布