/* #include<stdio.h> #include<time.h> int main() { srand(time(NULL)); int arr[10] = {0,1,2,3,4,5,6,7,8,9}; int ans[3] = {0}; for(int i=0; i<10000; i++) { int x = rand()%10; int y = rand()%10; int t = arr[x]; arr[x] = arr[y]; arr[y] = t; } for(int i=0; i<3; i++) { printf("%d ", arr[i]); } for(int i=0; i<3; i++) { scanf("%d", &ans[i]); } printf("input data is "); for(int i=0; i<3; i++) { printf("%d ", ans[i]); } int strike = 0; int ball = 0; for(int i=0; i<3; i++) { if(arr[i] == ans[i]) { strike++; } } for(int i=0; i<3; i++) { for(int j=0; j<3; j++) { if(i!=j) { if(arr[i] == ans[j]) { ball++; } } } } printf("%d strike %d ball", strike, ball); } */ #include<stdio.h> #include<math.h> #include<time.h> #include<windows.h> int numbers[10] = {0,1,2,3,4,5,6,7,8,9}; void gotoxy(int x,int y) { COORD pos= {x,y}; SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), pos); } void drawInit() { // gotoxy(가로, 세로); for(int i=0; i<24; i+=8) { gotoxy(2+i, 2); printf("┏"); gotoxy(4+i, 2); printf("━"); gotoxy(6+i, 2); printf("┓"); gotoxy(2+i, 3); printf("┃"); gotoxy(6+i, 3); // numbering: 4,3 12,3, 20,3 printf("┃"); gotoxy(2+i, 4); printf("┗"); gotoxy(4+i, 4); printf("━"); gotoxy(6+i, 4); printf("┛"); } } void swapNumbers() { for(int i=0; i<10000; i++) { int x = rand()%10; int y = rand()%10; int t = numbers[x]; numbers[x] = numbers[y]; numbers[y] = t; } } int main() { int num[10]= {}; int i, j, n, r, x, y, a, b, c; int p[10]= {}; int strike=0; int ball=0; int ball2=0; int input[3] = {0}; int answer[3] = {0}; int ans[3] = {0}; int arr[10] = {0,1,2,3,4,5,6,7,8,9}; srand(time(NULL)); drawInit(); // Init map // numbering: 4,3 12,3, 20,3 for(;;) { swapNumbers(); for(int i=0; i<3; i++) { input[i] = numbers[i]; } gotoxy(4,3); printf("%2d",input[0]); gotoxy(12,3); printf("%2d",input[1]); gotoxy(20,3); printf("%2d",input[2]); //Sleep(1000); gotoxy(5, 5); scanf("%d %d %d", &a, &b, &c); } }

#include<stdio.h> #include<math.h> #include<time.h> #include<windows.h> int numbers[10] = {0,1,2,3,4,5,6,7,8,9}; void gotoxy(int x,int y) { COORD pos= {x,y}; SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), pos); } void drawInit() { // gotoxy(가로, 세로); for(int i=0; i<24; i+=8) { gotoxy(2+i, 2); printf("┏"); gotoxy(4+i, 2); printf("━"); gotoxy(6+i, 2); printf("┓"); gotoxy(2+i, 3); printf("┃"); gotoxy(6+i, 3); // numbering: 4,3 12,3, 20,3 printf("┃"); gotoxy(2+i, 4); printf("┗"); gotoxy(4+i, 4); printf("━"); gotoxy(6+i, 4); printf("┛"); } } void swapNumbers() { for(int i=0; i<10000; i++) { int x = rand()%10; int y = rand()%10; int t = numbers[x]; numbers[x] = numbers[y]; numbers[y] = t; } } int main() { int num[10]= {}; int i, j, n, r, x, y, a, b, c; int p[10]= {}; int strike=0; int ball=0; int input[3] = {0}; int answer1, answer2, answer3; srand(time(NULL)); drawInit(); // Init map // numbering: 4,3 12,3, 20,3 for(;;) { swapNumbers(); for(int i=0; i<3; i++) { input[i] = numbers[i]; } gotoxy(4,3); printf("%2d",input[0]); gotoxy(12,3); printf("%2d",input[1]); gotoxy(20,3); printf("%2d",input[2]); //Sleep(1000); gotoxy(5, 5); scanf("%d %d %d", &a, &b, &c); for(i=0;i<=3;i++) { if(input[i]==1) { input[i]++; printf("strike:%d",strike); printf("\nball:%d",ball); } } } }

#include<stdio.h> #include<math.h> #include<time.h> #include<windows.h> void gotoxy(int x,int y) { COORD pos= {x,y}; SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), pos); } void drawInit() { // gotoxy(가로, 세로); for(int i=0; i<24; i+=8) { gotoxy(2+i, 2); printf("┏"); gotoxy(4+i, 2); printf("━"); gotoxy(6+i, 2); printf("┓"); gotoxy(2+i, 3); printf("┃"); gotoxy(6+i, 3); // numbering: 4,3 12,3, 20,3 printf("┃"); gotoxy(2+i, 4); printf("┗"); gotoxy(4+i, 4); printf("━"); gotoxy(6+i, 4); printf("┛"); } } int main() { int num[10]= {}; int i, n, r, x, y; int p[10]= {}; int strike=0; int ball=0; int input[3] = {0}; int answer1, answer2, answer3; srand(time(NULL)); drawInit(); // Init map // numbering: 4,3 12,3, 20,3 for(;;) { gotoxy(4,3); printf("%2d",input[0]); gotoxy(12,3); printf("%2d",input[1]); gotoxy(20,3); printf("%2d",input[2]); Sleep(100); } }

#include<stdio.h> #include<math.h> #include<time.h> #include<windows.h> void gotoxy(int x,int y) { COORD pos= {x,y}; SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), pos); } /* int main() { int x, y; int px=15, py=15; int c = 0; for(;;) { x = 0; y = 0; gotoxy(x, y); printf("*"); Sleep(100); gotoxy(px, py); printf("Dash Count is %d", c++); gotoxy(x, y); printf(" "); } } */ char words[4][10][20] = {{"apple", "kiwi", "melon", "banana", "mandarin", "orange"},{"bus","taxi","bmw"},{"teacher","firefighter"},{"beef","pork"}}; char words2[10][20]= {"fruit", "car", "job", "meat"}; char p[4][10]= {}; char ans[20] = {0}; char inp; int r, x, y, a, b, c=0, i,j, g=0, t=0, l=0; int k=0; int px=15, py=15; void game(int sub) { srand(time(NULL)); gotoxy(0, 0); printf("Dash Count is %d\n", c++); for(;;) { //r이 중복해서 나왔다면? r = rand()%6; if(p[sub][r]==0) { p[sub][r]=1; break; } } printf("answer is %s\n", words[sub][r]); for(;;) { gotoxy(0, 5); scanf(" %c", &inp); gotoxy(0, 0); printf("Dash Count is %d\n", c++); gotoxy(3, 3); t=0; for(i=0; i<strlen(words[r]); i++) { if(inp==words[sub][r][i]) { ans[i]=1; } t += ans[i]; } if(t == strlen(words[sub][r])) { printf("문제를 맞췄습니다!!!\n\n"); break; } for(i=0; i<strlen(words[sub][r]); i++) { if(ans[i]==0) printf("_"); else printf("%c", words[sub][r][i]); } printf("\n"); } } int main() { for(;;) { c=0; printf("chose!: \n"); for(i=0; i<4; i++) printf("%d. %s ",i+1,words2[i]); scanf("%d", &l); system("cls"); game(l-1); c=0; for(i=0;i<6;i++) c+=p[l][i]; if(c==6) {printf("준비된 게임이 다 끝났습니다."); return 0;} printf("다시 시작하고 싶으면1, 끝내고 싶으면 2: "); scanf("%d", &g); if(g == 1) { for(i=0; i<20; i++) ans[i] = 0; system("cls"); } else if(g == 2) return 0; else { printf("하, 숫자 1, 2만 입력하라고 했는데 허허허허허ㅓ "); return 0; } } } /* for(i=0; i<4; i++) { printf("%d. %s\n",i+1,words2[i]); } if(l==1) { printf("%s", words[i][r]); system("cls"); } */

#include<stdio.h> #include<math.h> #include<time.h> #include<windows.h> void gotoxy(int x,int y) { COORD pos= {x,y}; SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), pos); } /* int main() { int x, y; int px=15, py=15; int c = 0; for(;;) { x = 0; y = 0; gotoxy(x, y); printf("*"); Sleep(100); gotoxy(px, py); printf("Dash Count is %d", c++); gotoxy(x, y); printf(" "); } } */ int main() { char words[10][20] = {"apple", "kiwi", "melon", "banana", "mandarin", "orange"}; char p[10]= {}; char ans[20] = {0}; char inp; int r, x, y, a, b, c=0, i,j, g=0, t=0; int k=0; int px=15, py=15; srand(time(NULL)); for(;;) { gotoxy(x, y); printf("Dash Count is %d\n", c++); Sleep(100); for(;;) { //r이 중복해서 나왔다면? r = rand()%6; if(p[r]==0) { p[r]=1; break; } } printf("answer is %s\n", words[r]); for(;;) { scanf(" %c", &inp); t=0; for(i=0; i<strlen(words[r]); i++) { if(inp==words[r][i]) { ans[i]=1; } t += ans[i]; } if(t == strlen(words[r])) { printf("문제를 맞췄습니다!!!\n"); break; } for(i=0; i<strlen(words[r]); i++) { if(ans[i]==0) { printf("_"); } else { printf("%c", words[r][i]); } } printf("\n"); } printf("다시 시작하고 싶으면1, 끝내고 싶으면 2: "); scanf("%d", &g); if(g == 1) { for(i=0; i<20; i++) { ans[i] = 0; } system("cls"); } else if(g == 2) { return 0; } else { printf("하, 숫자 1, 2만 입력하라고 했는데 허허허허허ㅓ "); return 0; } } } //횟수세기 최우선

#include<stdio.h> #include<math.h> #include<time.h> #include<windows.h> void gotoxy(int x,int y) { COORD pos= {x,y}; SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), pos); } //1.과일 2.자동차 3... int main() { char words[10][20] = {"apple", "kiwi", "melon", "banana", "mandarin", "orange"}; char p[10]= {}; char ans[20] = {0}; char inp; int r, x=0, y, a, b, c=0, i,j, g=0, t=0; srand(time(NULL)); for(;;) { printf("시도횟수: %d\n", x); x++; if(strlen(words[r][i])==x) { } for(;;) { /*r이 중복해서 나왔다면?*/ r = rand()%6; if(p[r]==0) { p[r]=1; break; } } printf("answer is %s\n", words[r]); for(;;) { scanf(" %c", &inp); t=0; for(i=0; i<strlen(words[r]); i++) { if(inp==words[r][i]) { ans[i]=1; } t += ans[i]; } if(t == strlen(words[r])) { printf("문제를 맞췄습니다!!!\n"); break; } for(i=0; i<strlen(words[r]); i++) { if(ans[i]==0) { printf("_"); } else { printf("%c", words[r][i]); } } printf("\n"); } printf("다시 시작하고 싶으면1, 끝내고 싶으면 2: "); scanf("%d", &g); if(g == 1) { for(i=0; i<20; i++) { ans[i] = 0; } system("cls"); } else if(g == 2) { return 0; } else { printf("하, 숫자 1, 2만 입력하라고 했는데 허허허허허ㅓ "); return 0; } } } //큰 항목 만들기

#include<stdio.h> #include<math.h> #include<time.h> #include<windows.h> void gotoxy(int x,int y) { COORD pos= {x,y}; SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), pos); } int main() { char words[10][20] = {"apple", "kiwi", "melon", "banana", "mandarin", "orange"}; char ans[20] = {0}; char inp; int r, x, y, a, b, c, i,j, g=0, t=0; srand(time(NULL)); for(;;) { r = rand()%6; printf("anser is %s\n", words[r]); for(;;) { scanf(" %c", &inp); t=0; for(i=0; i<strlen(words[r]); i++) { if(inp==words[r][i]) { ans[i]=1; } t += ans[i]; } if(t == strlen(words[r])) { printf("문제를 맞췄습니다!!!\n"); break; } for(i=0; i<strlen(words[r]); i++) { if(ans[i]==0) { printf("_"); } else { printf("%c", words[r][i]); } } printf("\n"); } printf("다시 시작하고 싶으면1, 끝내고 싶으면 2: "); scanf("%d", &g); if(g == 1) { for(i=0; i<20; i++) { ans[i] = 0; } system("cls"); } else if(g == 2) { return 0; } else { printf("하, 숫자 1, 2만 입력하라고 했는데 허허허허허ㅓ ㅗ"); return 0; } } } //중복처리,시도한 횟수

#include<stdio.h> #include<math.h> #include<time.h> #include<windows.h> void gotoxy(int x,int y) { COORD pos= {x,y}; SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), pos); } int main() { char words[10][20] = {"apple", "kiwi", "melon", "banana", "mandarin", "orange"}; char ans[20] = {0}; char inp; int r, x, y, a, b, c, i,j; srand(time(NULL)); r = rand()%6; printf("answer is %s\n", words[r]); for(;;) { scanf(" %c", &inp); for(i=0;i<strlen(words[r]);i++){ if(inp==words[r][i]){ ans[i]=1; } } for(i=0; i<strlen(words[r]); i++) { if(ans[i]==0) { printf("_"); } else { printf("%c", words[r][i]); } } printf("\n"); } }

#include<stdio.h> long long int stack[10001]; long long int stack2[10001]; char stack3[10001]; char data1[10000]; char data2[10000]; long long int top=-1,top2=-1,i,n,sum=0; int main() { scanf("%s", data1); scanf("%s", data2); for(i=strlen(data1)-1; i>=0; i--) { top++; stack[top]=data1[i]; } for(i=strlen(data2)-1; i>=0; i--) { top2++; stack2[top2]=data2[i]; } printf("%lld", (stack[0]+stack2[0])%10); // printf("%lld %lld", stack[0], stack2[0]); /* for(i=0;i<=top;i++){ if((stack[i-1]+stack2[i-1])>=10) { stack3[top]=(stack[i]+stack2[i])%10+1; top--; } else{ stack3[top]=(stack[i]+stack2[i])%10; top--; } // top--; } for(i=0;i<=top;i++) { printf("%d",stack3[i]); } } */ /* while(top!=-1) { printf("%c", stack[top]); top--; } while(top2!=-1) { printf("%c", stack2[top2]); top2--; } */ }

#include<stdio.h> char stack[10001]; char stack2[10001]; char data1[10000]; char data2[10000]; long long int top=-1,top2=-1,i,n,sum; int main() { scanf("%s", data1); scanf("%s", data2); for(i=strlen(data1)-1; i>=0; i--) { top++; stack[top]=data1[i]; } for(i=strlen(data2)-1; i>=0; i--) { top2++; stack2[top2]=data2[i]; } while(top!=-1) { printf("%c", stack[top]); top--; } while(top2!=-1) { printf("%c", stack2[top2]); top2--; } }

#include<stdio.h> char stack[10001]; char data1[10000]; char data2[10000]; long long int top=-1,i,n,a, b; int main() { scanf("%s", data1); scanf("%s", data2); for(i=strlen(data1)-1;i>=0;i--) { top++; stack[top]=a; } for(i=strlen(data2)-1;i>=0;i--) { top++; stack[top]=b; } while(top!=-1) { printf("%c", stack[top]); top--; } }

/* #include <stdio.h> #include <stdlib.h> int stack[100001]; int top=-1,n,i; int main() { int k,sum=0; scanf("%d", &n); for(i=1; i<=n; i++) { scanf("%d", &k); if(k==0) { top--; } else { top++; stack[top]=k; } } while(top!=-1) { sum+=stack[top]; top--; } printf("%d", sum); } */ #include<stdio.h> char stack[100001]; char str[100001]; int top=-1,i,n; int main() { scanf("%s", str); for(i=1;i<=str[i];i++) { top++; stack[top]=str[i]; } while(top!=-1) { printf("%c", ('(' ')')) top--; } }

#include<stdio.h> char stack[1001]; char str[1001]; int top=-1,n,i; int main() { int k=0; scanf("%d ", &n); scanf("%s", str); for(i=n-1; i>=0; i--) { top++; stack[top]=str[i]; k++; if(k==3) { top++; stack[top] = ','; k=0; } } if(stack[top]==',') { top--; } while(top!=-1) { printf("%c", stack[top]); top--; } }

#include<stdio.h> char stack[201]; char str[201]; int top=-1,n,i; int main() { int k=0; scanf("%d ", &n); scanf("%s", str); for(i=n-1; i>=0; i--) { top++; stack[top]=str[i]; k++; if(k==3) { top++; stack[top] = ','; k=0; } } if(stack[top]==',') { top--; } while(top!=-1) { printf("%c", stack[top]); top--; } }

//stack 스택 /* #include <stdio.h> int stack[500]; int top=-1; //마지막으로 입력된 데이터의 위치 // top==-1 : stack is empty 비어있다. int main() { // data 1 push top++; stack[top]=1; //data 2 push top++; stack[top]=2; //pop printf("pop data : %d\n",stack[top]); top--; //pop printf("pop data : %d\n",stack[top]); top--; printf("top : %d\n",top); //stack에 있는 모든 데이터를 출력해라 while(top!=-1) { printf("%d\n",stack[top]); top--; } } */ /* #include<stdio.h> char stack[501]; int top=-1, n, i; char str[501]; int main() { scanf("%s", str); for(i=0; str[i]!=0; i++) { top++; stack[top]=str[i]; } while(top!=-1) { printf("%c", stack[top]); top--; } } */ #include<stdio.h> char stack[201]; char str[201]; int top=-1,n,i; int main() { scanf("%d " , &n); scanf("%s", str); for(i=n-1;i>=0;i--) { top++; stack[top]=str[i]; } while(top!=-1) { printf("%c", stack[top]); if() { } top--; } }

//stack 스택 /* #include <stdio.h> int stack[500]; int top=-1; //마지막으로 입력된 데이터의 위치 // top==-1 : stack is empty 비어있다. int main() { // data 1 push top++; stack[top]=1; //data 2 push top++; stack[top]=2; //pop printf("pop data : %d\n",stack[top]); top--; //pop printf("pop data : %d\n",stack[top]); top--; printf("top : %d\n",top); //stack에 있는 모든 데이터를 출력해라 while(top!=-1) { printf("%d\n",stack[top]); top--; } } */ #include<stdio.h> int stack[501]; int top=-1, n, i; int main() { scanf("%d", &n); for(i=n/*문자열로 받기*/; i>=1; i--) stack[top]=i; printf("%d",top); }

/* #include<stdio.h> int a[100001]= {}; int b[100001] = {0}; int bs(int s, int e, int k) { int mid=(s+e)/2; if(s>e) return -1; if(a[mid]==k) return mid; else if(a[mid]<k) bs(mid+1,e,k); else bs(s,mid-1,k); } void quick_sort(int s, int e) { int temp; int pivot=s; int low=s,high=e+1; if(s>=e) return ; do { do { low++; } while(a[pivot]>a[low]); do { high--; } while(a[pivot]<a[high]); if(low<high) { temp = a[low]; a[low] = a[high]; a[high] = temp; } } while(low<high); temp = a[pivot]; a[pivot] = a[high]; a[high] = temp; quick_sort(s,high-1); quick_sort(high+1,e); } int main() { int i, n; scanf("%d", &n); for(i=1; i<=n; i++) { scanf("%d", &a[i]); b[i] = a[i]; } quick_sort(1,n); // printf("\n"); for(i=1; i<=n; i++) { printf("%d ",bs(1, n, b[i])-1); } } */ /* #include<stdio.h> int a[100001]; void quick_sort(int s, int e) { int temp; int pivot=s; int low=s,high=e+1; if(s>=e) return ; do { do { low++; } while(a[pivot]>a[low]); do { high--; } while(a[pivot]<a[high]); if(low<high) { temp=a[low]; a[low]=a[high]; a[high]=temp; } } while(low<high); temp=a[pivot]; a[pivot]=a[high]; a[high]=temp; quick_sort(s,high-1); quick_sort(high+1,e); } int main() { int i, j, n; scanf("%d", &n); for(i=1; i<=n; i++) { scanf("%d", &a[i]); } quick_sort(1,n); for(i=1; i<=n; i++) { printf("%d",a[i]); printf("\n"); } } 포인터 : 주소 int* pa int변수의 주소를 담는 자료형 *pa pa가 가리키는 곳의 값 ( 간접참조연산자) #include <stdio.h> void f(int* pa) { //printf("%d\n",pa); //printf("%d",*pa); *pa=*pa+5; } int main() { int a=10; f(&a); printf("%d",a); } #include <stdio.h> void myswap(int* a, int* b) { int p; if(*a>*b) { p=*a; *a=*b; *b=p; } } main() { int a, b; scanf("%d%d", &a, &b); myswap(&a, &b); printf("%d %d", a, b); } #include <stdio.h> char* fp(char* a) { return a; //printf("%s",a); } main() { char str[50]; scanf("%s",str); fp(str); //str == &str[0] //배열의 이름 == 배열의 첫번째 값의 주소 } #include <stdio.h> void fp(int* arr,int len) { int i; for(i=0;i<len;i++) { printf("%d ",arr[i]); } } main() { //char str[50]; //scanf("%s",str); int arr[5]={1,8,4,3,7}; fp(arr,5); //배열을 함수간에 넘길때는 배열의 시작주소와 길이만 넘겨주면 된다. //str == &str[0] //배열의 이름 == 배열의 첫번째 값의 주소 } */ /* char *mysubstr(char *str, int start, int count) { str[start+count]=0; printf("%s", str+start); } int main() { char str[101]; int s, e; scanf("%s",str); scanf("%d %d",&s,&e); mysubstr(str,s,e); return 0; } */ /* #include<stdio.h> int main() { int a[101][101]; int k=1,n,i,j,m; scanf("%d %d", &n, &m); for(i=1; i<=n; i++) { if(i%2==0) { for(j=1; j<=m; j++) { a[i][j]=k++; } } else { for(j=m; j>=1; j--) { a[i][j]=k++; } } } for(i=n; i>=1; i--) { for(j=1; j<=m; j++) { printf("%d ",a[i][j]); } printf("\n"); } } */

#include<stdio.h> int a[100001]= {}; int b[100001] = {0}; int bs(int s, int e, int k) { int mid=(s+e)/2; if(s>e) return -1; if(a[mid]==k) return mid; else if(a[mid]<k) bs(mid+1,e,k); else bs(s,mid-1,k); } void quick_sort(int s, int e) { int temp; int pivot=s; int low=s,high=e; if(s>=e) return ; while(low<high) { while(a[pivot]>a[low]) low++; while(a[pivot]<a[high]) high--; if(low<high) { temp = a[low]; a[low] = a[high]; a[high] = temp; } } temp = a[pivot]; a[pivot] = a[high]; a[high] = temp; quick_sort(s,high-1); quick_sort(high+1,e); } int main() { int i, n; scanf("%d", &n); for(i=1;i<=n;i++) { scanf("%d", &a[i]); b[i] = a[i]; } quick_sort(1,n); // for(i=1;i<=n;i++){ } for(i=1; i<=n; i++) { printf("%d ", b[i]); } printf("\n"); for(i=1;i<=n;i++) { printf("%d ",bs(s, e, k)); } } printf("%d ",bs(s, e, k)); } }

/* #include<stdio.h> int bs(int s, int e, int k) { int mid=(s+e)/2; if(s>e) return -1; if(a[mid]==k) return mid; else if(a[mid]<k) bs(mid+1,e,k); else bs(s,mid-1,k); } int main() { int a[50001],b[50001]; int i, j, n, temp; scanf("%d", &n); for(i=1; i<=n; i++) { scanf("%d", &a[i]); b[i]=a[i]; } for(i=1; i<n; i++) { for(j=1; j<=n-i; j++) { if (a[j] > a[j+1]) { temp = a[j]; a[j] = a[j+1]; a[j+1] = temp; } } } for(i=1; i<=n; i++) { printf("%d ",bs(1,n,b[i])-1); } } */ /* s=1 e=7 k=50 1 2 3 4 5 6 7 1 15 18 40 49 50 60 */ // a[i] 23 24 50 54 123 // b[i] 50 23 54 24 123 /* #include<stdio.h> int a[100001]={}; int bs(int s, int e, int k) { int mid=(s+e)/2; if(s>e) return -1; if(a[mid]==k) return mid; else if(a[mid]<k) bs(mid+1,e,k); else bs(s,mid-1,k); } int main() { int i, j, n, m,t; scanf("%d", &n); for(i=1;i<=n;i++) { scanf("%d", &a[i]); } scanf("%d", &m); for(i=1;i<=m;i++) { scanf("%d", &t); printf("%d ",bs(1,n,t)); } } */ int a[100001]= {}; void quick_sort(int s, int e) { int temp; int pivot=s; int low=s,high=e; if(s>=e) return ; while(low<high) { while(a[pivot]>a[low]) low++; while(a[pivot]<a[high]) high--; if(low<high) { temp = a[low]; a[low] = a[high]; a[high] = temp; } } temp = a[pivot]; a[pivot] = a[high]; a[high] = temp; quick_sort(s,high-1); quick_sort(high+1,e); } int main() { int i, n; scanf("%d", &n); for(i=1;i<=n;i++) { scanf("%d", &a[i]); } quick_sort(1,n); for(i=1;i<=n;i++) { printf("%d ",a[i]); } }

/* #include<stdio.h> int main() { int a[101]={}, temp; int i, j, n; for(i=1;i<=5;i++) { scanf("%d", &a[i]); } for(i=1; i<5; i++) { for(j=1;j<=5-i;j++) { if (a[j] > a[j+1]) { temp = a[j]; a[j] = a[j+1]; a[j+1] = temp; } } } printf("%d ", a[3]); } */ /* #include<stdio.h> int main() { int i,j,n,m,l,k=0,sum=0,min=10000; scanf("%d\n%d", &m, &n); for(i=m; i<=n; i++) { k=0; for(j=1; j<=i; j++) { if(i%j==0) { k++; } } if(k==2) { if(min>i) { min=i; } sum=sum+i; } }printf("%d\n%d", sum, min); } //이분탐색 binary_search int bs(int s, int e, int k) { int mid=(s+e)/2; if(s>e) return -1; if(a[mid]==k) return mid; else if(a[mid]<k) bs(mid+1,e,k); else bs(s,mid-1,k); } #include<stdio.h> int a[100001]={}; int main() { int i, j, n, m,t; scanf("%d", &n); for(i=1;i<=n;i++) { scanf("%d", &a[i]); } scanf("%d", &m); for(i=1;i<=m;i++) { scanf("%d", &t); printf("%d ",bs(1,n,t)); } } */ #include<stdio.h> int a[100000]={}; int main() { int i, j, n; scanf("%d", &n); for(i=1;i<=n;i++) { scanf("%d", &a[i]); } }