Submission #538444

#	Time	Username	Problem	Language	Result	Execution time	Memory
538444		Pichon5	Magneti (COCI21_magneti)	C++17	10 / 110	7 ms	4820 KiB

Main

#include <bits/stdc++.h>
#define vi vector<int>
#define pb push_back
#define ll long long
#define F first
#define S second
#define mp make_pair
#define ii pair<int,int>
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const ll MOD=1e9+7;
int n,l,x;
const int tam=10005;
ll dp[tam][50];
ll f(int pos , int cant){
    if(cant==0)return 1;
    if(pos>l)return 0;
    if(dp[pos][cant]!=-1)return dp[pos][cant];
    dp[pos][cant]=f(pos+1,cant)+f(pos+x,cant-1);
    dp[pos][cant]%=MOD;
    return dp[pos][cant];
}

ll fact(int n){
    ll res=1;
    for(int i=1;i<=n;i++){
        res*=i;
        res%=MOD;
    }
    return res;
}
int main(){
    memset(dp,-1,sizeof(dp));
    cin>>n>>l;
    for(int i=0;i<n;i++){
        cin>>x;
    }
    cout<<f(1,n)*fact(n)%MOD<<endl;

    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 30
• Subtask 4: 0 / 50