Cod sursa(job #109278)
Utilizator | Data | 25 noiembrie 2007 09:52:37 | |
---|---|---|---|
Problema | Teren | Scor | 30 |
Compilator | cpp | Status | done |
Runda | preONI 2008, Runda 1, Clasa a 9-a | Marime | 0.51 kb |
#include <fstream.h>
long b[302][302],n,m,k;
void citire(){
ifstream fin("teren.in");
fin>>n>>m>>k;
char c;
for (int i=1;i<=n;i++){
int nr=0;
for (int j=1;j<=m;j++){
fin>>c;
nr+=c-'0';
b[i][j]=b[i-1][j]+nr;}
}
fin.close();
}
long maxim(){
long max=0;
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++)
if (b[i][j]<=k)
if (i*j>max)
max=i*j;
return max;
}
int main(){
ofstream fout("teren.out");
citire();
fout<<maxim();
fout<<"\n";
fout.close();
return 0;
}