Pagini recente » Cod sursa (job #2781094) | Cod sursa (job #2647236) | Cod sursa (job #580563) | Cod sursa (job #775475) | Cod sursa (job #994641)
Cod sursa(job #994641)
#include <iostream>
#include <fstream>
#define vmax 45000
#define smax 46000
#define mod 10000
using namespace std;
int n, m, x;
short cur[2*smax], pre[2*smax];
#define cur (cur+smax)
#define pre (pre+smax)
int main() {
ifstream f("diamant.in");
ofstream g("diamant.out");
f>>n>>m;
f>>x;
if(x > vmax) {
g<<"-1\n";
return 0;
}
for(int i=1; i<=n; i++) {
for(int j=1; j<=m; j++) {
for(int val=-vmax; val<=vmax; val++)
cur[val] = (pre[val] + pre[val-i*j] + pre[val+i*j])%mod;
cur[i*j]++;
cur[-i*j]++;
for(int val=-vmax; val<=vmax; val++) pre[val] = cur[val];
}
}
//for(int i=1; i<=x; i++) cout<<cur[i]<<" "; cout<<"\n\n";
//cout<<cur[x]<<"\n";
g<<cur[x]<<"\n";
return 0;
}