Cod sursa(job #3220721)
Utilizator | Razvan Cazacu Cazacu2006Razvan | Data | 4 aprilie 2024 18:11:06 |
---|---|---|---|
Problema | 1-sir | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <fstream>
#include <cmath>
#include <cstring>
#define mod 194767
using namespace std;
ifstream fin("1-sir.in");
ofstream fout("1-sir.out");
long long n,s,d[2][50000];
int main()
{
fin>>n>>s;
s=abs(s);
if((n-1)*n<s)
{
fout<<0;
return 0;
}
d[0][0]=1;
int ind=1;
for(int i=2;i<=n;i++,ind=1-ind)
{
memset(d[ind],0,sizeof(d[ind]));
for(int k=0;k<=50000;k++)
{
d[ind][k]=(d[ind][k]+d[1-ind][abs(k-i+1)]+d[1-ind][abs(k+i-1)])%mod;
}
}
fout<<d[1-ind][s]<<" ";
return 0;
}