Pagini recente » Cod sursa (job #2358237) | Cod sursa (job #3285822) | Cod sursa (job #589407) | Cod sursa (job #2769361) | Cod sursa (job #700989)
Cod sursa(job #700989)
#include<fstream>
using namespace std;
int main()
{
int a[301][301], i, j, m, n, x, max=-1;
ifstream f("teren.in");
ofstream g("teren.out");
f>>n>>m>>x;
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
f>>a[i][j];
for (i=2;i<=m;i++)
{
a[1][i]=a[1][i]+a[1][i-1];
if (a[1][i]<=x && i>max)
max=1*i;
}
for (i=2;i<=n;i++)
{
a[i][1]=a[i][1]+a[i-1][i];
if (a[i][1]<=x && i>max)
max=1*i;
}
for (i=2;i<=n;i++)
for (j=2;j<=m;j++)
{
a[i][j]=a[i][j]+a[i-1][j]+a[i][j-1]-a[i-1][j-1];
if (a[i][j]<=x && i*j>max)
max=i*j;
}
g<<max;
return 0;
}