$\color{green}80$分求助！！！
- 板块P3654 First Step (ファーストステップ)
- 楼主justinjia
- 当前回复23
- 已保存回复23
- 发布时间2021/1/31 08:57
- 上次更新2023/11/5 04:06:49
查看原帖
被骇客银狼阻止的越权访问保存失败
$\color{green}80$分求助！！！
\#1&\#2&\#3&\#4&\#5&\#6&\#7&\#8&\#9&\#10\\
\colorbox{green}{\color{white}AC}&\colorbox{green}{\color{white}AC}&\colorbox{green}{\color{white}AC}&\colorbox{red}{\color{white}WA}&\colorbox{red}{\color{white}WA}&\colorbox{green}{\color{white}AC}&\colorbox{green}{\color{white}AC}&\colorbox{green}{\color{white}AC}&\colorbox{green}{\color{white}AC}&\colorbox{green}{\color{white}AC}
\end{matrix}$$
```cpp
#include"stdio.h"
int main(void){
int r,c,k,ans=0;
scanf("%d%d%d",&r,&c,&k);
char field[100][100];
for(int i=0;i<r;i++)
scanf("%s",field[i]);
for(int i=0;i<r;i++)
for(int j=0;j<c-k+1;j++){
for(int l=0;l<k;l++)
if(field[i][l+j]=='#')
goto out1;
ans++;
out1:;
}
for(int i=0;i<c;i++)
for(int j=0;j<r-k+1;j++){
for(int l=0;l<k;l++)
if(field[l+j][i]=='#')
goto out2;
ans++;
out2:;
}
printf("%d",ans);
return 0;
}
```
2021/1/31 08:57加载中...