Pagini recente » Cod sursa (job #1468113) | Cod sursa (job #1082720) | Cod sursa (job #1424457) | Cod sursa (job #1027591) | Cod sursa (job #183374)
Cod sursa(job #183374)
#include <fstream.h>
long i,j,k,x,n,m,a[1000],b[1000],suma,pr;
long abs(long tz)
{
if(tz>0) return tz;
return -tz;
}
int main()
{
ifstream in("diamant.in");
in>>n>>m>>x;
in.close();
ofstream out("diamant.out");
if(abs(x)>44100)
{
out<<0<<"\n";
return 0;
}
a[0]=1;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
pr=i*j;
suma+=pr;
for(k=0;k<=suma;k++)
{
b[k]+=(a[k+pr])%10000;
b[k]+=a[k]%10000;
b[k]+=(a[abs(k-pr)])%10000;
}
memcpy(a,b,sizeof(b));
}
out<<b[abs(x)]<<"\n";
out.close();
return 0;
}