交大1102

#include<cstdio>
#include<cstring>
#include<string>
using namespace std;
int n,m,k;
int nums[101][101];
int flag,minsum;

int main(){
memset(nums,0,sizeof(nums));
while(scanf("%d%d%d",&n,&m,&k)!=EOF){
flag = 0;
minsum = 0;
for(int i = 0;i<n;i++)
for(int j = 0;j<m;j++)
scanf("%d",&nums[i][j]);

for(int i = 0;i<n;i++){
for(int j = 0;j<m;j++){
for(int x = i;x<n;x++){
for(int y = j;y<m;y++){
if(flag&&(x-i+1)*(y-j+1)>=minsum)//当所得面积大于最小面积时，丢弃,但为了防止i=0,j=0时是解，所以用flag最为标记
break;
int tempsum = 0;
for(int p = i;p<=x;p++)
for(int q = j;q<=y;q++)
tempsum+=nums[p][q];
if(tempsum>=k){
flag = 1;
minsum = (x-i+1)*(y-j+1);//找到最小的面积
}
}
}
}
}
if(flag==0)
printf("-1\n");
else
printf("%d\n",minsum);
}
}