Cod sursa(job #1687346)
Utilizator | Roxi C. roxi22 | Data | 12 aprilie 2016 19:57:11 |
---|---|---|---|
Problema | 1-sir | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
#define modulo 194767
using namespace std;
ifstream fin("1-sir.in");
ofstream fout("1-sir.out");
int m[2][33000];
int main() {
int n,s;
fin>>n>>s;
m[0][0]=1;
for(int i=2;i<=n;i++) {
for(int j=0;j<=i*(i-1)/2;j++)
m[1][j]=(m[0][abs(j-(i-1))]+m[0][abs(j+(i-1))])%modulo;
for(int j=0;j<=i*(i-1)/2;j++)
m[0][j]=m[1][j];}
fout<<m[0][abs(s)];
return 0;
}