Pagini recente » Cod sursa (job #1333013) | Cod sursa (job #1851132) | Cod sursa (job #52683) | Cod sursa (job #918847) | Cod sursa (job #1997476)
#include<fstream>
#include<string.h>
#include<map>
using namespace std;
ifstream fi("diamant.in");
ofstream fo("diamant.out");
map<int,int> A,B;
int n,m,x,i,j,k,maxim;
int main()
{
fi>>n>>m>>x;
A[0]=1;
maxim=0;
for(i=1; i<=n; i++)
for(j=1; j<=m; j++)
{
B=A;
maxim=maxim+i*j;
for(k=maxim; k>=-maxim; k--)
{
A[k]=B[k-i*j]+B[k]+B[k+i*j];
A[k]%=10000;
}
}
fo<<A[x]<<"\n";
fi.close();
fo.close();
return 0;
}