Pagini recente » Cod sursa (job #1802464) | Cod sursa (job #510772) | Cod sursa (job #30661) | Cod sursa (job #2760363) | Cod sursa (job #948699)
Cod sursa(job #948699)
#include<fstream>
using namespace std;
ifstream in("1-sir.in");
ofstream out("1-sir.out");
const int N = 256;
const int V = 66000;
const int MOD = 194767;
int a[V],b[V];
int n,s;
int absol(int x){
if(x<0) return -x;
return x;
}
int main(){
int i,k;
in>>n>>s;
if(s<0) s=-s;
const int MA = n*(n+1)/2;
if(s>MA) out<<0;
else{
a[0]=1;
for(k=2;k<=n;k++){
for(i=0;i<=MA;++i){
b[i]=a[i+k-1]+a[absol(i-k+1)];
b[i]%=MOD;
}
for(i=0;i<=MA;++i){
a[i]=b[i];
b[i]=0;
//out<<a[i]<<' ';
}
//out<<'\n';
}
out<<a[s];
}
return 0;
}