C. Ivan the Fool and the Probability Theory （思维题）

http://codeforces.com/contest/1248/problem/C

#include<bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f;
int MOD = 1e9 + 7;

const int N = 100005;
int add(int a, int b)
{

    if(a + b >= MOD)
    {

        return a + b - MOD;
    }
    return a + b;
}
int sub (int a, int b)
{

    if(a - b < 0)
    {
        return a - b + MOD;
    }
    return a - b;
}
int mul(int a, int b)
{
return 1ll * a * b % MOD;
}
int f[N];
void precale()
{

    f[0] = 1;
    f[1] = 1;
    for(int i = 2; i < N ; i++)
    {
     f[i] = add(f[i - 1], f[i - 2]);
    }
}
int main()
{
 int n , m;
 scanf("%d %d",&n,&m);
 precale();
 printf("%d\n",mul(2,sub(add(f[n],f[m]),1)));

return 0;
}