Cod sursa(job #1650284)
Utilizator | Data | 11 martie 2016 17:34:26 | |
---|---|---|---|
Problema | 1-sir | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#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("1-sir.in");f>>n>>s;f.close();a[1][0]=1;
for(i=2;i<=n;i++)
for(j=1;j<(n-1)*n/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][s];
g.close();
return 0;
}