Pagini recente » Cod sursa (job #2880667) | Cod sursa (job #2960058) | Cod sursa (job #2406792) | Cod sursa (job #1325692) | Cod sursa (job #812750)
Cod sursa(job #812750)
#include <fstream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
using namespace std;
#define MOD 10000
int main()
{
ifstream f("diamant.in");
ofstream g("diamant.out");
int n, m, x, i, j, k, sum=0, aux, a[100000], b[100000], mid = 50000;
//Read
f>>n>>m>>x;
//Compute
for(i=1; i<=n; i++)
for(j=1; j<=m; j++)
sum += i*j;
if(x > sum)
{
g<<0;
return 0;
}
a[mid] = 1;
for(i=1; i<=n; i++)
for(j=1; j<=m; j++)
{
aux = i*j;
for(k=-abs(sum); k<=abs(sum); k++)
b[mid+k] = ( a[mid+k]+a[mid+k+aux]+a[mid+k-aux] ) % MOD;
for(k=-abs(sum); k<=abs(sum); k++)
a[mid+k] = b[mid+k];
}
//Print
g<<a[mid+x];
//cout<<a[mid+x];
}