Pagini recente » Cod sursa (job #2238697) | Monitorul de evaluare | Cod sursa (job #3325902) | Cod sursa (job #2701005) | Cod sursa (job #3328751)
#include <fstream>
using namespace std;
#define int long long
ifstream in("nunta.in");
ofstream out("nunta.out");
int n, ans;
int dp[1005][1005];
signed main()
{
in>>n;
dp[0][0] = 1;
for(int i = 1; i<=n; i++)
{
for(int j = 1; j<=n; j++)
{
for(int k = i - 1; k>=0; k -= 2)
{
dp[i][j] += dp[k][j - 1];
}
}
dp[i][0] = 1;
}
int ans = 0;
int start;
if(n % 2 == 0)
{
start = 0;
}
else
{
start = 1;
}
for(int i = start; i<=n; i += 2)
{
ans += dp[n][i];
}
out<<ans;
return 0;
}