Just Do it

#include #include using namespace std; //1094 int main() { int x=2, y=2,i,j; int map[11][11]; for ( i = 1; i map[i][j] ; } } while (map[x][y]!=2) { map[x][y] = 9; if (map[x][y+1]!=1) { y++; } else if (map[x+1][y]!=1) { x++; } else { break; } } map[x][y] = 9; for (i = 1; i

#include #include using namespace std; //1094 int main() { int j, i,h,w,n,l,d ,x,y; int map[101][101] = {}; cin >>h>>w; cin >> n; for ( i = 1; i >l>>d>>x>>y ; //l길이 d방향 x 좌표 y좌표 if (d==0) //가로 { for ( j = 0; j < l; j++) { map[x][y+j] = 1; } } else //세로 { for ( j = 0; j

#include #include using namespace std; //1094 int main() { int n, i, j, x, y; int a[20][20] = {}; for (i = 1; i a[i][j]; cin>> n; //좌표 개수 입력받기 for (i = 1; i

int main() { int n, i, j,x, y; int a[20][20] = {}; cin >> n; for ( i = 1; i > x>>y; a[x][y] = 1; } for ( i = 1; i < 19; i++) { for (j = 1; j < 19; j++) { cout

#include #include using namespace std; //1094 int main() { int n, i; int a[100000]; int min = 100; cin >> n; for ( i = 1; i >a[i]; if (min >a[i]) { min = a[i]; } } cout

#include #include using namespace std; //1094 int main() { int n, i; int a[1000] = {}; cin >>n ; for ( i = 1; i >a[i] ; for ( i = n; i >= 1; i--) cout