Pagini recente » Cod sursa (job #2874729) | Cod sursa (job #662363) | Cod sursa (job #446803) | Cod sursa (job #1295213) | Cod sursa (job #1930036)
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("diamant.in");
ofstream fout("diamant.out");
int sol[45000],s1[45000],n,m,s,i,j;
int main()
{ fin>>n>>m>>s;
s1[0]=1;
s=abs(s);
int maxi=0,k;
for(i=1;i<=n;++i)
{
for(j=1;j<=m;++j)
{ maxi+=i*j;
for(k=0;k<=maxi;++k)
sol[k]=(s1[int(abs(k-i*j))] +s1[k]+ s1[k+i*j] )%10000;
for(k=0;k<=maxi;++k)
s1[k]=sol[k];
}
}
if(s<=maxi)
fout<<sol[s];
else fout<<0;
return 0;
}