Pagini recente » Cod sursa (job #2508979) | Cod sursa (job #191580) | Cod sursa (job #778039) | Cod sursa (job #1887139) | Cod sursa (job #2180800)
#include <bits/stdc++.h>
#define MOD 3210121
#define MAX_N 20
#define MAX_K 30
#define MAX_S 10000
#define MAX_COMB 50
using namespace std;
typedef long long lint;
FILE *f, *g;
int k, s, n;
int total;
int comb[MAX_S + MAX_K + 1][MAX_K + 1];
int stars[MAX_S + 1];
int a[MAX_N + 1][MAX_K + 1];
void readFile()
{
f = fopen("cowfood.in", "r");
fscanf(f, "%d%d%d", &k, &s, &n);
int i, j;
for(i = 1; i <= n; i ++)
{
for(j = 1; j <= k; j ++)
fscanf(f, "%d", &a[i][j]);
}
fclose(f);
}
void getComb()
{
int i, j;
comb[0][0] = 1;
for(i = 1; i <= s + k; i ++)
{
comb[i][0] = 1;
for(j = 1; j <= min(i, k); j ++)
{
comb[i][j] = comb[i - 1][j] + comb[i - 1][j - 1];
if(comb[i][j] >= MOD)
comb[i][j] -= MOD;
}
}
}
void getStars()
{
int i;
stars[0] = 1;
for(i = 1; i <= s; i ++)
{
stars[i] = stars[i - 1] + comb[i + k - 1][k - 1];
if(stars[i] >= MOD)
stars[i] -= MOD;
}
total = stars[s] - (s * k + 1) % MOD;
if(total < 0)
total += MOD;
}
int rez;
int mn[MAX_K + 1];
void getPinex()
{
int i, j, h;
for(i = 1; i < (1 << n); i ++)
{
for(j = 1; j <= k; j ++)
mn[j] = -1;
int sign = 0;
for(j = 0; j < n; j ++)
{
if(((1 << j) & i) != 0)
{
sign ++;
for(h = 1; h <= k; h ++)
mn[h] = max(mn[h], a[j + 1][h]);
}
}
int sum = s;
for(j = 1; j <= k; j ++)
sum -= mn[j];
if(sum >= 0)
{
if(sign & 1)
rez += stars[sum];
else
rez -= stars[sum];
if(rez < 0)
rez += MOD;
if(rez >= MOD)
rez -= MOD;
}
}
rez = total - rez;
if(rez < 0)
rez += MOD;
}
void solve()
{
getComb();
getStars();
getPinex();
}
void printFile()
{
g = fopen("cowfood.out", "w");
fprintf(g, "%d\n", rez);
fclose(g);
}
int main()
{
readFile();
solve();
printFile();
return 0;
}