Cod sursa(job #1214374)
Utilizator | Data | 30 iulie 2014 10:52:43 | |
---|---|---|---|
Problema | 1-sir | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include<iostream>
#include<math.h>
#include<fstream>
using namespace std;
ifstream f("1-sir.in");
ofstream g("1-sir.out");
int t[2][33000],i,j,n,m,s;
int main()
{
f>>n>>s;
t[1][0]=1;
for(i=2;i<=n;i++)
{
m=i*(i-1)/2;
for(j=0;j<=m;j++)
t[i%2][j]=t[(i+1)%2][abs(j-i+1)]+t[(i+1)%2][j+i-1];
}
g<<t[n%2][abs(s)]%194767;
g.close();
return 0;
}