文章
2
粉丝
0
获赞
3
访问
231
// 利用二维前缀和解决
#include<stdio.h>
#include<string.h>
#include<math.h>
#include <stdlib.h>
int main()
{
int t = 1;
// scanf("%d",&t);
while(t --) {
int n,m,k;
scanf("%d%d%d%",&n,&m,&k);
int a[n+1][m+1];
for (int i = 0; i<= n; i ++) {
for (int j = 0; j <= m; ++ j) {
a[i][j] = 0;
}
}
for (int i = 1; i<= n; i ++) {
for (int j = 1; j <= m; ++ j) {
scanf("%d", &a[i][j]);
if(a[i][j] >= k) {
printf("1");
return 0;
}
a[i][j] += a[i-1][j] + a[i][j-1] - a[i-1][j-1];
}
}
int count = 2;
while(count <= n * m) {
for (int i = 1; i <= n; ++i) {
if(count % i == 0) {
int x = i, y = count / i;
...
登录后发布评论
暂无评论,来抢沙发