Pagini recente » Cod sursa (job #2022306) | Borderou de evaluare (job #1036006) | Cod sursa (job #2017219) | Cod sursa (job #2521540) | Cod sursa (job #423079)
Cod sursa(job #423079)
#include<stdio.h>
FILE *f,*g;
int n,m,v[460],p[460],x,contor=0;
void back(int k, int val)
{
if(k==n*m)
{
if(val==x)
contor++;
contor=contor%10000;
}
else
{
back(k+1,val-p[k+1]);
back(k+1,val);
back(k+1,val+p[k+1]);
}
}
int main() {
int q,i,j;
f=fopen("diamant.in","r");
fscanf(f,"%d%d%d",&n,&m,&x);
fclose(f);
q=0;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
q++;
p[q]=i*j;
}
back(0,0);
g=fopen("diamant.out","w");
fprintf(g,"%d\n",contor);
fclose(g);
return 0;}