Pagini recente » Cod sursa (job #1188457) | Cod sursa (job #1944306) | Cod sursa (job #2810155) | Cod sursa (job #300857) | Cod sursa (job #721327)
Cod sursa(job #721327)
#include <fstream>
#define NMAx 180100
#define MOD 10000
#define Mid 90000
using namespace std;
int N,M,X,Total,A[NMAx],B[NMAx];
void Solve() {
int i,j,Val,k;
A[Mid]=1;
for(i=1;i<=N;i++)
for(j=1;j<=M;j++) {
Val=i*j;
for(k=-Total;k<=Total;k++)
B[Mid+k]=(A[Mid+k]+A[Mid+k-Val]+A[Mid+k+Val])%MOD;
for(k=-Total;k<=Total;k++)
A[Mid+k]=B[Mid+k];
}
}
int main() {
int i,j;
ifstream in("diamant.in");
ofstream out("diamant.out");
in>>N>>M>>X;
for(i=1;i<=N;i++)
for(j=1;j<=M;j++)
Total+=i*j;
if(-Total<=X&&X<=Total)
Solve();
out<<A[Mid+X]<<'\n';
in.close();
out.close();
return 0;
}