Pagini recente » Cod sursa (job #2956857) | Cod sursa (job #87980) | Cod sursa (job #992070) | Cod sursa (job #2854803) | Cod sursa (job #2470890)
#include <bits/stdc++.h>
using namespace std;
const int MAXS = 800;
long long dp[MAXS];
int main()
{
ifstream fin("semisume.in");
ofstream fout("semisume.out");
int n;
fin >> n;
int sum = n * (n + 1) / 2;
if(sum % 2 == 1){
fout << 0;
return 0;
}
dp[0] = 1;
for(int i = 1; i <= n; ++i){
for(int j = sum / 2; j >= i; --j)
dp[j] += dp[j - i];
}
fout << dp[sum / 2] / 2;
return 0;
}