Pagini recente » Cod sursa (job #2346064) | Cod sursa (job #529743) | Cod sursa (job #1540925) | Cod sursa (job #1208918) | Cod sursa (job #2360794)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("teren.in");
ofstream g("teren.out");
int a[301][301],i,j,n,m,k,maxi;
int main()
{
f>>n>>m>>k;
for(i=1;i<=n;i++)for(j=1;j<=m;j++)f>>a[i][j];
for(i=1;i<=n;i++)for(j=1;j<=m;j++)a[i][j]=a[i][j]+a[i][j-1]+a[i-1][j]-a[i-1][j-1];
for(i=1;i<=n;i++)for(j=1;j<=m;j++)if(a[i][j]<=k&&i*j>maxi)maxi=i*j;
g<<maxi;
return 0;
}