Cod sursa(job #743820)

Utilizator GrimpowRadu Andrei Grimpow Data 6 mai 2012 13:14:12
Problema 1-sir Scor 30
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.51 kb
#include <cstdio>
#include <cstdlib>

const int NMAX = 270;
const int MOD = 194767;

int n, need, want;

int A[2][NMAX*NMAX/2];

int main() {
	freopen("1-sir.in", "r", stdin);
	freopen("1-sir.out", "w", stdout);
	
	scanf("%d %d", &n, &want);
	need = n * (n - 1)/2;
	
	int i, j, curr = 0;
	A[1-curr][0] = 1;
	
	for(i = 2; i <= n; ++ i, curr = 1 - curr)
		for(j = 0; j <= need; ++j) 
			A[curr][j] = A[1 - curr][abs(j - (i - 1))]%MOD + A[1 - curr][abs(j + (i - 1))]%MOD;
	printf("%d\n", A[1-curr][want]);
	
	return 0;
}