2 solutions
-
0
#include<bits/stdc++.h> using namespace std; const int N=510; char g[N][N]; int main() { int n,m; cin>>n>>m; int maxc=0,maxr=0,minc=1000,minr=1000; for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) { cin>>g[i][j]; if(g[i][j]=='#') { maxr=max(maxr,i); minr=min(minr,i); maxc=max(maxc,j); minc=min(minc,j); } } } for(int i=minr;i<=maxr;i++) { for(int j=minc;j<=maxc;j++) { if(g[i][j]=='.') { cout<<i<<" "<<j; return 0; } } } return 0; }
- 1
Information
- ID
- 2469
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 3
- Tags
- # Submissions
- 6
- Accepted
- 6
- Uploaded By