Pagini recente » Cod sursa (job #2150242) | Cod sursa (job #1366201) | Cod sursa (job #2434030) | Cod sursa (job #1845677) | Cod sursa (job #42158)
Cod sursa(job #42158)
#include <stdio.h>
int E[40][40], N, S, K, V[40], Sol;
int q(){
int i, j, num = 0;
for (i = 1; i <= N; i++) { num = 0;
for (j = 1; j <= K; j++)
if (V[i] >= E[i][j]) num++;
if (num == K) return 0; }
return 1;
}
void back(int nv, int sum)
{
int i;
if (nv == K+1)
{
Sol += q();
return;
}
for (i = 1; i <= N; i++) {
if (sum+i > S) return;
V[nv] = i; back(nv+1, sum+i); }
}
int main()
{
int i, j;
freopen("cowfood.in", "r", stdin);
scanf("%d %d %d", &K, &S, &N);
for (i = 1; i <= N; i++)
for (j = 1; j <= K; j++) scanf("%d", E[i]+j);
back(1,0);
freopen("cowfood.out", "w", stdout);
printf("%d\n", Sol);
return 0;
}