Skip to content

Instantly share code, notes, and snippets.

@pithesun
Created March 3, 2022 14:55
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save pithesun/eb7039ea2a3bbc3445c78b64bd229114 to your computer and use it in GitHub Desktop.
Save pithesun/eb7039ea2a3bbc3445c78b64bd229114 to your computer and use it in GitHub Desktop.
한자리수 숫자배열 받기
#include<bits/stdc++.h>
using namespace std;
const int max_n = 104;
int dy[4] = {-1, 0, 1, 0};
int dx[4] = {0, 1, 0, -1};
int n, m, a[max_n][max_n], visited[max_n][max_n], y, x;
int main(){
scanf("%d %d", &n, &m);
for(int i = 0; i < n; i++){
for(int j = 0; j < m; j++){
scanf("%1d", &a[i][j]);
}
}
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment