Pagini recente » Cod sursa (job #1307586) | Cod sursa (job #1235020) | Cod sursa (job #2109474) | Cod sursa (job #1166772) | Cod sursa (job #1650308)
#include<iostream>
#include<fstream>
using namespace std;
int mod(int x)
{
if(x>0)return x;
return 0-x;
}
int a[257][32896],i,j,n,s;
int main()
{
ifstream f("1-sir.in");f>>n>>s;f.close();a[1][0]=1;
for(i=2;i<=n;i++)
for(j=1;j<=(i-1)*i/2;j++)a[i][j]=(a[i-1][i+j-1]+a[i-1][mod(i-j-1)])%194767;
ofstream g("1-sir.out");g<<a[n][mod(s)];
g.close();
return 0;
}