Pagini recente » Cod sursa (job #1841746) | Cod sursa (job #2330033) | Cod sursa (job #2686761) | Cod sursa (job #3264046) | Cod sursa (job #948736)
Cod sursa(job #948736)
#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[5][V];
int n,s,c;
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{
c=0;
a[c][0]=1;
for(k=2;k<=n;k++){
for(i=0;i<=MA;++i){
a[!c][i]=a[c][i+k-1]+a[c][absol(i-k+1)];
a[!c][i]%=MOD;
}
c=!c;
}
out<<a[c][s];
}
return 0;
}