【luogu P1306 斐波那契公约数】 题解

题目链接：https://www.luogu.org/problemnew/show/P1306#sub

gcd（f[m],f[n]） = f[gcd(m,n)]

 #include <iostream>
 #include <algorithm>
 #include <cstdio>
 using namespace std;
 const int maxn = ;
 long long n, m;
 long gcd(long long x, long long y)
 {
     if(x%y == ) return y;
     else return gcd(y,x%y);
 }
 long long f[maxn] = {,,};
 int main()
 {
     scanf("%lld%lld",&n,&m);
     long long mn = gcd(n,m);

     for(int i = ; i <= mn; i++)
     f[i] = (f[i-] + f[i-])%;

     printf("%lld",f[mn]);
 }