Pagini recente » Cod sursa (job #1903288) | Cod sursa (job #219099) | Cod sursa (job #316675) | Cod sursa (job #506530) | Cod sursa (job #268599)
Cod sursa(job #268599)
# include <stdio.h>
const long int S=3210121;
long int mat[50][50],aux[50],n,s,m,nr_moduri[10002][31];
void fill()
{
long int sum,c;
for (c=1;c<=n;c++) nr_moduri[0][c]=1;
for (sum=1;sum<=s;sum++) nr_moduri[sum][0]=1;
for (sum=1;sum<=s;sum++)
for (c=1;c<=n;c++)
{
nr_moduri[sum][c]=nr_moduri[sum][c-1]+nr_moduri[sum-1][c];
nr_moduri[sum][c]%=S;
}
}
long int get_amount(long int *v, long int n)
{
long int i,sum=0;
for (i=1;i<=n;i++)
sum+=v[i];
if (sum<=s)
{
// printf("%ld\n",nr_moduri[s-sum][n]);
return nr_moduri[s-sum][n];
}
return 0;
}
void copy(long int *d, long int *s, long int n)
{
long int i;
for (i=1;i<=n;i++) d[i]=s[i];
}
void intersect(long int *d, long int *s, long int n)
{
long int i;
for (i=1;i<=n;i++)
if (s[i]>d[i]) d[i]=s[i];
}
void citire()
{
FILE *f=fopen("cowfood.in","r");
fscanf(f,"%ld%ld%ld",&n,&s,&m);
long int i,j;
for (i=1;i<=m;i++)
for (j=1;j<=n;j++) fscanf(f,"%ld",&mat[i][j]);
fclose(f);
}
long int calc()
{
long int qwd,qwds,j,nb,sol=0;
for (qwd=1;qwd<=((long int)1<<m)-1;qwd++)
{
//pe primul bit tre' sa pui primul vector
j=1;
qwds=qwd;
while (qwds%2==0)
{
qwds/=2;
j++;
}
nb=1;
copy(aux,mat[j],n);
do
{
qwds/=2;
j++;
if (qwds%2)
{
intersect(aux,mat[j],n);
nb++;
}
}
while (qwds);
//scrie_v(aux,n);
//adunam la solutie ce trebuie
if (nb%2==0) sol+=get_amount(aux,n);
else sol-=get_amount(aux,n);
//normalizam sol;
while (sol<0) sol+=S;
sol%=S;
}
return sol;
}
void scrie(long int sol)
{
FILE *g=fopen("cowfood.out","w");
fprintf(g,"%ld\n",sol);
fclose(g);
}
int main()
{
long int sol;
citire();
fill();
sol=calc();
long int total=nr_moduri[s][n]+sol-(1+s*n);
//total%=S;
//total-=sol;
while (total<0) total+=S; total%=S;
scrie(total);
//getchar();
return 0;
}