제출 #527165

#제출 시각아이디문제언어결과실행 시간메모리
527165beepbeepsheepCalvinball championship (CEOI15_teams)C++17
0 / 100
270 ms512 KiB
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ii pair<ll,ll>
#define endl '\n'
const ll inf=1e15;
const ll mod=1e9+7;
const ll maxn=10005;
ll arr[maxn];
ll nxt[maxn];
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll n;
    cin>>n;
    arr[1]=1;
    for (int i=1;i<=n-1;i++){
        for (int j=1;j<=i;j++){
            nxt[j]+=arr[j]*j;
            nxt[j+1]+=arr[j];
            nxt[j]%=mod;
            nxt[j+1]%=mod;
        }
        swap(arr,nxt);
        memset(nxt,0,sizeof(nxt));
    }
    ll ans=0;
    for (int i=1;i<=n;i++){
        ans+=arr[i];
        ans%=mod;
    }
    cout<<ans;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...