Pagini recente » Cod sursa (job #998546) | Cod sursa (job #29890) | Cod sursa (job #1331306) | Cod sursa (job #1954258) | Cod sursa (job #1878166)
#include <iostream>
#include <fstream>
#define MOD 10000
using namespace std;
const int mij=50000,Nmax=23;
int sol[2*mij+10],aux[2*mij+10],v[Nmax*Nmax];
int m,n,val,vf;
ifstream f("diamant.in");
ofstream g("diamant.out");
int main()
{
f >> n >> m >> val;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++){
v[vf++]=j*i;
}
// sol[mij-1]=1;
sol[mij]=1;
//sol[mij+1]=1;
int sum=0;
cout << vf << "\n";
for(int i=0;i<vf;i++)
{
sum+=v[i];
for(int j=mij-sum;j<=mij+sum;j++)
{
aux[j]=(sol[j-v[i]]+sol[j]+sol[j+v[i]])%MOD;
}
for(int j=mij-sum;j<=mij+sum;j++)
sol[j]=aux[j];
}
g << sol[mij+val];
return 0;
}