问题2469--Less taolu

2469: Less taolu

时间限制: 5 Sec  内存限制: 128 MB
提交: 11  解决: 4
[提交] [状态] [讨论版] [命题人:]

题目描述

Less taolu, more sincerity.
This problem is very easy to solve.
You may be very tired during this contest. So we prepared a gift for you.
You just copy and paste this code and you will get AC!
Ctrl + C && Ctrl + V is a necessary skill for a programming ape.



#include<iostream>
using namespace std;
const long long mod = 1e9+7;
long long func(int x){
    if (x==1||x==0){
        return 1;
    }
    return (x*func(x-1)+(x-1)*func(x-2)) % mod;
}
int n;
int main(){
    cin>>n;
    cout<<func(n);
    return 0;
}






输入

Input only a single integer n.

输出

Please output the answer by this code.

样例输入

100

样例输出

372497045

提示

0<=N<=1e5


来源/分类


[提交] [状态]