Pagini recente » Cod sursa (job #2575529) | Cod sursa (job #2280668) | Cod sursa (job #2024606) | Cod sursa (job #1700631) | Cod sursa (job #1444120)
#include <iostream>
#include <fstream>
#define NMax 90100
#define MOD 10000
#define diamant 45000
using namespace std;
int a[NMax],b[90010],N,M,X;
int main()
{
ifstream g("diamant.in");
g>>N>>M>>X;
a[diamant]=1;
b[diamant]=1;
for(int i=1;i<=N;i++)
{
for(int j=1;j<=M;j++)
{
int cost=i*j;
for(int k=1;k<=90000;k++)
{
if(a[k])
{
b[k+cost]=(b[k+cost]+a[k])%MOD;
b[k-cost]=(b[k-cost]+a[k])%MOD;
}
}
for(int k=1;k<=90000;k++)
a[k]=b[k];
}
}
ofstream f("diamant.out");
f<<a[X+diamant];
}