Pagini recente » Cod sursa (job #1904697) | Monitorul de evaluare | Borderou de evaluare (job #1103118) | Cod sursa (job #3353085) | Cod sursa (job #3328752)
#include <fstream>
using namespace std;
#define int long long
ifstream in("nunta.in");
ofstream out("nunta.out");
int n, ans;
int fact[1005];
int comb(int n, int k)
{
int ans = (fact[n] / fact[k]);
ans /= fact[n - k];
return ans;
}
int starsandbars(int cutii, int obiecte)
{
return comb(cutii + obiecte - 1, cutii - 1);
}
signed main()
{
in>>n;
fact[0] = 1;
for(int i = 1; i<=n; i++)
{
fact[i] = (fact[i - 1] * i);
}
int start;
if(n % 2 == 0)
{
start = 0;
}
else
{
start = 1;
}
for(int i = start; i<=n; i += 2)
{
int cutii = i + 1;
int obiecte = (n - i) / 2;
ans += starsandbars(cutii, obiecte);
// out<<cutii<<" "<<obiecte<<'\n';
}
out<<ans;
return 0;
}