Skip to content

Instantly share code, notes, and snippets.

@jwon0615
jwon0615 / 1505.cpp
Created March 22, 2018 02:01
1505 : 2차원 배열 채우기 3(달팽이 배열)
#include <stdio.h>
int main(){
int i,j,n,diff,cnt=1;
int s=0; e=-1;
scanf("%d", &n);
diff=n;
while(cnt<=n*n){
for(i=1;i<-diff;i++) arr[s][++e]=cnt++;
diff--;
@jwon0615
jwon0615 / 1491.cpp
Created March 22, 2018 01:56
1491 : [기초-배열연습] 2차원 배열 달팽이 채우기 4-8
#include <stdio.h>
#define MAXN 1000;
#define MAXM 1000;
int n, m;
arr[MAXN][MAXM]
void escargo(int n,int m){
int x=n, y=1;
int cnt = n*m;