Pagini recente » Cod sursa (job #398753) | Cod sursa (job #797534) | Cod sursa (job #901137) | Cod sursa (job #2055018) | Cod sursa (job #1429870)
#include<fstream>
using namespace std;
ifstream in("1-sir.in");
ofstream out("1-sir.out");
const int N = 256, mod = 194767;
int d[2][2*N*N+1], n, sum, m;
int main(){
in>>n>>sum;
m = n * (n - 1) / 2;
sum = m - sum;
d[0][0] = 1;
d[1][0] = 1;
for(int i = 1; i<n; i++)
{
for(int j = 0; j<=sum; j++)
{
d[1][j + i * 2] += d[0][j];
if(d[1][j+i*2]>mod)
d[1][j+i*2]-=mod;
}
for(int j = 0; j<=sum; j++)
{
d[0][j]=d[1][j];
if(d[0][j]>=mod)
d[0][j]-=mod;
}
}
out<<d[0][sum]<<'\n';
return 0;
}