게시판

/*#include <stdio.h> int stack[80000],top=-1; void push(int h) { stack[++top]=h; } void pop() { if(top!=-1) stack[top--]=0; } int main() { int n,h,i,j; long long int sum=0; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&h); int c=0; for(j=top;j>=0;j--) { if(stack[j]<=h) pop(); else c++; } sum+=c; push(h); } printf("%lld",sum); return 0; } 스택 쌓는거 vs 큐 스택 큐 구조 후입선출(LIFO) 선입선출(FIFO) push top++; front++; pop top--; back++; 포인터 top(맨위데이터위치) back 마지막데이터위치 (=top) front 마지막나간데이터의위치 empty? top==-1 front==back */ #include <stdio.h> int queue[200]={},front=-1,back=-1; void push(int x) { queue[++back]=x; } void pop() { if(front!=back) front++; } void frontf() { if(front==back) printf("-1\n"); else printf("%d\n",queue[front+1]); } void backf() { if(back==front) printf("-1\n"); else printf("%d\n",queue[back]); } void size() { printf("%d\n",back-front); } void empty() { if(front==back) printf("true\n"); else printf("false\n"); } int main() { char stl[21]=""; int n,i,j; scanf("%d",&n); for(i=0;i<=n;i++) { gets(stl); if(stl[1]=='u') { int k=0; for(j=6;stl[j]!=32;j++) k=k*10+stl[j]-48; push(k); } else if(stl[1]=='o') pop(); else if(stl[0]=='f') frontf(); else if(stl[0]=='b') backf(); else if(stl[0]=='s') size(); else if(stl[0]=='e') empty(); } return 0; }

# n = int(input())## data = []# for i in range(n):# v = [0] * n# data.append(v)## data[1][0] = 10## for i in range(n):# for j in range(n):# print(data[i][j], end=' ')# print()# n = int(input())# a = []# for i in range(n):# x = [int(input())] * n# a.append(x)### for i in range(n-1):# for j in range(n-1):# a[i+1][j+1]=a[i+1][j]-a[i][j]## for i in range(n):# for j in range(i+1):# print(a[i][j], end= ' ')# print("")# a = []# c = 0# for i in range(10):# x = list(map(int,input().split()))# a.append(x)# y = list(map(int,input().split()))# for j in range(10):# if y[j]==1:# print(j+1,end= " ")# for i in range(10):# if a[9-i][j] == 0:# pass# elif a[9-i][j] < 0:# print("fall")# c = c + 1# break# elif a[9-i][j] > 0:# print("crash")# c = c + 1# break# if c == 0:# print("safe")# c = 0# n = int(input())# a = []# for i in range(n):# for j in range(n):# v = [0] * n# a.append(v)# x = 0# y = n//2# k = 1# a[x][y] = k# k += 1# for i in range(n*n-1):# if k % n != 1:# x -= 1# y += 1# if x < 0:# x = n-1# if y > n-1:# y = 0# else:# x += 1# a[x][y] = k# k += 1# for i in range(n):# for j in range(n):# print(a[i][j],end= " ")# print()n = int(input())x = 0y = 0k = 1a = []c = 2(n-1)for i in range(n):    for j in range(n):        v = [0] * n        a.append(v)b = n - 1for i in range(n**2):    if c <= 0:        x -= 1        c = 2(n-1)-2    else:        x += 1        c -= 1    if b <= 0:        a[y][x] = k        b = n -1    else:        b -= 1        a[x][y] = k    k += 1print(a)

/* //Q.1524 #include <stdio.h> int main() { int arr[11][11]={}; int i,j,r,c,n; for(i=1;i<=9;i++) { for(j=1;j<=9;j++) { scanf("%d",&arr[i][j]); } } scanf("%d %d",&r,&c); if(arr[r][c]==1) { printf("-1"); } else { n = arr[r-1][c-1] + arr[r-1][c] + arr[r-1][c+1]+ arr[r][c-1]+ arr[r][c+1]+arr[r+1][c-1]+arr[r+1][c]+arr[r+1][c+1]; printf("%d",n); } return 0; } */ /* //1098 #include<stdio.h> int main() { int arr[101][101]= {}; int i,j,k,c,h,w,n,l,d,x,y; scanf("%d %d",&h,&w); scanf("%d",&n); for(k=1; k<=n; k++) { scanf("%d %d %d %d",&l,&d,&x,&y); for(c=1; c<=l; c++) { arr[x][y]=1; if (d==1) { x++; } else { y++; } } } for(i=1; i<=h; i++) { for(j=1; j<=w; j++) { printf("%d ",arr[i][j]); } printf("\n"); } return 0; } */ #include<stdio.h> int main () { int arr[50][50]= {}; int i,j,k,n; //1. n 입력 scanf("%d",&n); //2. 마방진 채우기 i = 1; j = n/2+1; for(k=1; k<=n*n; k++) { arr[i][j] = k; printf("i = %d j = %d k = %d\n",i,j,k); i--; if(i==0) { i=n; } j++; if(j==n+1) { j=1; } if(k%n==0) { i++; } } // 3. 마방진 출력 for(i=1; i<=n; i++) { for(j=1; j<=n; j++) { printf("%d ",arr[i][j]); } printf("\n"); } return 0; }