Submission #530995

#	Time	Username	Problem	Language	Result	Execution time	Memory
530995		Slavita	Kućice (COCI21_kucice)	C++14	0 / 110	1 ms	204 KiB

Main

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define ve vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pi pair<int,int>
#define all(v) v.begin(),v.end()
#define si(v) (int)v.size()
#define en '\n'
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ordered_muiltiset tree<int, null_type,less_equal<>, rb_tree_tag,tree_order_statistics_node_update>
//#define int long long
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;

const int N = 2e3 + 228;
const int big = 1e9 + 228;
const ll llbig = 1e18 + 228;
const ll md = 1e9 + 7;
//ordered_set os; // os.order_of_key(4), (*os.find_by_order(5))
ll fact[N];

//#undef int
int main(){
    //#define int long long
    iostream::sync_with_stdio(false); cin.tie(0); ios_base::sync_with_stdio(false); cout.tie(0);
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    ll n;
    cin >> n;
    fact[0] = 1;
    for (int i = 1; i <= n + 1; i++){
        fact[i] = fact[i - 1] * i;
        fact[i] %= md;
    }

    ll ans = 2ll;
    for (int i = 1; i <= n - 1; i++){
        ll cur = fact[n] / fact[i] / fact[n - i];
        ans += cur;
        ans %= md;
    }
    cout << ans;
    return 0;
}
/*
*/

• Subtask 1: 0 / 10
• Subtask 2: 0 / 30
• Subtask 3: 0 / 10
• Subtask 4: 0 / 30
• Subtask 5: 0 / 30