A+

root_src.cpp

#include <stdio.h>

#include <math.h>

void rooter(double a, double b, double c)

{

double x, pan = (pow(b, 2) - (4 * a * c));

printf("판별식 값 : %lf\n", pan);

if(pan > 0) {

x = (-b + (sqrt(pan))) / (2 * a);

printf("실근 1 : %lf\n", x);

x = (-b - (sqrt(pan))) / (2 * a);

printf("실근 2 : %lf\n", x);

} else if(pan == 0) {

x = (-b + (sqrt(pan))) / (2 * a);

printf("중근 : %lf\n", x);

} else {

double sil, huh;

pan = -pan;

sil = -b / (2 * a);

huh = pan / (2 * a);

printf("허근 1 : %lf + %lfi\n", sil, huh);

printf("허근 2 : %lf - %lfi\n", sil, huh);

}

}

int main()

{

double a, b, c;

while(1) {

printf("2차 방정식의 계수 3개 입력 : ");

scanf("%lf %lf %lf", &a, &b, &c);

rooter(a, b, c);

}

return 0;

}

Polynomia_src.cpp

1. #include <stdio.h>

2. #include <stdlib.h>

3. #include <conio.h>

4. 
   

5. 
   

6. typedef struct node {

7. int gs;  // 계수

8. int js;  // 지수

9. struct node *next;

10. } NODE;

11. NODE *start[3] = {NULL};

12. int cnt[3] = {0};

13. bool rage_flag = false;

14. 
    

15. 
    

16. void del(int i);

17. void init(int i);

18. void rage();

19. void insert(int i, int g, int j);

20. void print();

21. 
    

22. 
    

23. void init(int i)

24. {

25. NODE *del, *cur = start[i];

26. 
    

27. if(start[i] == NULL)

28. return;

29. else {

30. while(cur->next != NULL) {

31. del = cur;

32. cur = cur->next;

33. free(del);

34. }

35. del = cur;

36. start[i] = NULL;

37. free(del);

38. }

39. }

40. 
    

41. 
    

42. void del(int i)

43. {

44. NODE *del, *cur = start[i];

45. 
    

46. while(cur->next != NULL) {

47. if(cur->next->gs == 0) {

48. del = cur->next;

49. cur->next = del->next;

50. free(del);

51. cnt[i]--;

52. return;

53. }

54. cur = cur->next;

55. }

56. 
    

57. if(start[i]->gs == 0) {

58. del = start[i];

59. start[i] = start[i]->next;

60. free(del);

61. cnt[i]--;

62. return;

63. }

64. }

65. 
    

66. 
    

67. void rage()

68. {

69. int i;

71. if(start[0] == NULL || start[1] == NULL) {

72. printf("먼저 A랑 B를 채워\n");

73. return;

74. }

76. init(2);

77. for(i = 0; i < 2; i++) {

78. NODE *cur = start[i];

79. while(cur->next != NULL) {

80. insert(2, cur->gs, cur->js);

81. cur = cur->next;

82. }

83. insert(2, cur->gs, cur->js);

84. }

85. rage_flag = true;

86. }

87. 
    

88. 
    

89. void insert(int i, int g, int j)

90. {

91. NODE *newnode, *cur;

92. newnode = (NODE*)malloc(sizeof(NODE));

93. newnode->next = NULL;

94. newnode->gs = g;

95. newnode->js = j;

96. cur = start[i];

97. rage_flag = false;

98. 
    

99. if(start[i] != NULL) {

100. while(cur->next != NULL) {

101. if(cur->js == j) {

102. cur->gs += g;

103. if(cur->gs == 0)

104. del(i);

105. return;

106. }

107. cur = cur->next;

108. }

109. if(cur->js == j) {

110. cur->gs += g;

111. if(cur->gs == 0)

112. del(i);

113. return;

114. }

115. cur = start[i];

116. }

118. if(start[i] == NULL || start[i]->js < newnode->js) {

119. newnode->next = start[i];

120. start[i] = newnode;

121. cnt[i]++;

122. return;

123. }

124. 
     

125. if(cur->js >= newnode->js) {

126. while(cur->next != NULL) {

127. if(cur->next->js <= newnode->js) {

128. newnode->next = cur->next;

129. cur->next = newnode;

130. cnt[i]++;

131. return;

132. }

133. cur = cur->next;

134. }

135. cur->next = newnode;

136. cnt[i]++;

137. }

138. }

139. 
     

140. 
     

141. void print()

142. {

143. int i, minus;

144. 
     

145. for(i = 0; i < 3; i++) {

146. NODE *cur = start[i];

147. 
     

148. if(i == 0)

149. printf("A = ");

150. else if(i == 1)

151. printf("B = ");

152. else

153. printf("C = ");

154. 
     

155. if(start[i] == NULL) {

156. if(i == 2) {

157. printf("아직 합치지 않았어\n");

158. continue;

159. }

160. printf("이 배열은 비어있어\n");

161. continue;

162. }

163. else {

164. if(i == 2 && !rage_flag) {

165. printf("다시 합쳐\n");

166. continue;

167. }

168. }

170. printf("%dX^%d", cur->gs, cur->js);

171. if(cur->next != NULL)

172. cur = cur->next;

173. else{

174. printf("\n");

175. continue;

176. }

177. 
     

178. while(cur->next != NULL) {

179. if(cur->gs > 0) {

180. minus = cur->gs;

181. printf(" + ");

182. }

183. else if(cur->gs < 0) {

184. minus = -cur->gs;

185. printf(" - ");

186. }

187. printf("%dX^%d", minus, cur->js);

188. cur = cur->next;

189. }

190. if(cur->gs > 0) {

191. minus = cur->gs;

192. printf(" + ");

193. }

194. else if(cur->gs < 0) {

195. minus = -cur->gs;

196. printf(" - ");

197. }

198. printf("%dX^%d\n", minus, cur->js);

199. }

200. }

201. 
     

202. 
     

203. int main()

204. {

205. int sel, gs, js;

206. 
     

207. while(1) {

208. system("cls");

209. puts("1. Insert A");

210. puts("2. Insert B");

211. puts("3. Print");

212. puts("4. A + B");

213. puts("5. Initialize");

214. puts("6. Quit");

215. printf("골라 : ");

216. scanf("%d", &sel);

217. fflush(stdin);

218. 
     

219. switch(sel) {

220. case 1:

221. printf("식 A 입력\n");

222. printf("계수 : ");

223. scanf("%d", &gs);

224. fflush(stdin);

225. printf("지수 : ");

226. scanf("%d", &js);

227. insert(0, gs, js);

228. printf("식 A에 추가했다\n");

229. break;

230. case 2:

231. printf("식 B 입력\n");

232. printf("계수 : ");

233. scanf("%d", &gs);

234. fflush(stdin);

235. printf("지수 : ");

236. scanf("%d", &js);

237. insert(1, gs, js);

238. printf("식 B에 추가했어\n");

239. break;

240. case 3:

241. print();

242. break;

243. case 4:

244. if(rage_flag) {

245. printf("이미 더했어\n");

246. getch();

247. continue;

248. }

249. rage();

250. printf("두 식을 더했어\n");

251. break;

252. case 5:

253. init(0);

254. init(1);

255. init(2);

256. printf("모두 초기화했어\n");

257. break;

258. case 6:

259. exit(1);

260. }

261. getch();

262. }

263. return 0;

264. }
     

doubly_linked_list_src.cpp

1. #include <stdio.h>

2. #include <stdlib.h>

3. #include <conio.h>

4. 
   

5. 
   

6. typedef struct node {

7. int key;

8. struct node *prev;

9. struct node *next;

10. } DNODE;

11. DNODE *start = NULL;

12. int cnt = 0;

13. 
    

14. 
    

15. void insert()  // 오름차순 정렬삽입

16. {

17. DNODE *newnode, *cur;

18. newnode = (DNODE*)malloc(sizeof(DNODE));

19. newnode->prev = newnode->next = NULL;

20. cur = start;

21. 
    

22. printf("삽입할 정수를 입력해 : ");

23. scanf("%d", &newnode->key);

24. fflush(stdin);

25. 
    

26. if(start == NULL || start->key > newnode->key) {

27. newnode->next = start;

28. start = newnode;

29. printf("맨 앞에 삽입됐다\n");

30. cnt++;

31. return;

32. }

33. 
    

34. if(cur->key <= newnode->key) {

35. while(cur->next != NULL) {

36. if(cur->next->key >= newnode->key) {

37. newnode->prev = cur;

38. newnode->next = cur->next;

39. cur->next->prev = newnode;

40. cur->next = newnode;

41. cnt++;

42. printf("중간에 삽입됐다\n");

43. return;

44. }

45. cur = cur->next;

46. }

47. 
    

48. newnode->prev = cur;

49. cur->next = newnode;

50. printf("맨 끝에 삽입됐다\n");

51. cnt++;

52. }

53. }

54. 
    

55. 
    

56. void print()

57. {

58. DNODE *cur = start;

59. 
    

60. if(start == NULL) {

61. printf("배열이 비어 있어서 삭제못해\n");

62. return;

63. }

64. 
    

65. while(cur->next != NULL) {

66. printf("%d -> ", cur->key);

67. cur = cur->next;

68. }

69. printf("%d", cur->key);

70. }

71. 
    

72. 
    

73. void del()

74. {

75. int k;

76. bool flag = false;

77. DNODE *del, *cur = start;

78. 
    

79. if(start == NULL) {

80. printf("배열이 비어 있어서 출력못해\n");

81. return;

82. }

83. 
    

84. printf("삭제할 정수를 입력해 : ");

85. scanf("%d", &k);

86. fflush(stdin);

87. 
    

88. while(cur->next != NULL) {

89. if(cur->next->key == k) {

90. del = cur->next;

91. cur->next = del->next;

92. printf("배열의 %d를 삭제한다\n", del->key);

93. free(del);

94. cnt--;

95. flag = true;

96. }

97. else

98. cur = cur->next;

99. }

100. 
     

101. if(start->key == k) {

102. del = start;

103. start = start->next;

104. printf("배열의 %d를 삭제한다\n", del->key);

105. free(del);

106. cnt--;

107. flag = true;

108. }

109. if(start != NULL)

110. printf("start 노드의 key 값 : %d\n", start->key);

111. 
     

112. if(!flag)

113. printf("%d는 배열에 없어\n", k);

114. }

115. 
     

116. 
     

117. int main()

118. {

119. int sel;

120. 
     

121. while(1) {

122. system("cls");

123. puts("1. Insert");

124. puts("2. Print");

125. puts("3. Delete");

126. puts("4. Quit");

127. printf("골라 : ");

128. scanf("%d", &sel);

129. fflush(stdin);

130. 
     

131. switch(sel) {

132. case 1: insert(); break;

133. case 2: print();  break;

134. case 3: del();    break;

135. case 4: exit(1);

136. }

137. 
     

138. getch();

139. }

140. 
     

141. return 0;

142. }

linked_list_src.cpp

1. #include <stdio.h>

2. #include <stdlib.h>

3. #include <conio.h>

4. 
   

5. 
   

6. typedef struct node {

7. int key;

8. struct node *next;

9. }NODE;

10. NODE *start = NULL;

11. int cnt = 0;

12. 
    

13. 
    

14. void insert()

15. {

16. NODE *newnode, *cur;

17. newnode = (NODE*)malloc(sizeof(NODE));

18. 
    

19. printf("\n\t정수를 입력해 : ");

20. scanf("%d", &newnode->key);

21. fflush(stdin);

22. newnode->next = NULL;  // 맨 뒤에 붙으므로 넥스트는 NULL

23. 
    

24. if(start == NULL) {

25. start = newnode;

26. printf("\n\t배열이 비어 있어 첫 원소로 %d 삽입했어.\n", newnode->key);

27. }

28. else {

29. cur = start;

30. while(cur->next != NULL) {

31. cur = cur->next;

32. }

33. cur->next = newnode;

34. printf("\n\t배열의 맨 뒤에 %d 삽입했어.\n", newnode->key);

35. }

36. 
    

37. cnt++;  // 추가된 갯수 업데이트

38. }

39. 
    

40. 
    

41. void print()

42. {

43. NODE *cur;

45. if(start == NULL) {

46. printf("\n\t배열이 비어 있어서 출력할게 없어.\n");

47. return;

48. }

50. cur = start;

51. printf("\n\t");

52. while(cur->next != NULL) {

53. printf("%d -> ", cur->key);

54. cur = cur->next;

55. }

56. printf("%d\n\t총 %d개야.", cur->key, cnt);

57. }

58. 
    

59. 
    

60. void sort()

61. {

62. int i, j;

63. NODE *cur, **arr, *temp;

64. arr = (NODE**)malloc(cnt * sizeof(NODE*));

65. 
    

66. if(cnt <= 0) {

67. printf("\n\t배열이 비어 있어 정렬할게 없어.\n");

68. return;

69. }

70. 
    

71. cur = start;

72. for(i = 0; i < cnt; i++) {

73. arr[i] = cur;

74. cur = cur->next;

75. }

76. 
    

77. for(i = 0; i <cnt; i++) {

78. printf("%d ", arr[i]->key);

79. }

81. for(i = 0; i < cnt - 1; i++) {

82. for(j = i + 1; j < cnt; j++) {

83. if(arr[i]->key <= arr[j]->key) {

84. temp = arr[i];

85. arr[i] = arr[j];

86. arr[j] = temp;

87. }

88. }

89. }

90. 
    

91. for(i = 0; i < cnt; i++) {

92. printf("%d ", arr[i]->key);

93. }

94. 
    

95. cur = start;

96. for(start = arr[0], cur = start, i = 1; i < cnt; i++, cur = cur->next)

97. cur->next = arr[i];

98. cur->next = NULL;

99. 
    

100. printf("\n\t배열이 내림차순으로 정렬되었어.\n");

101. 
     

102. free(arr);

103. }

104. 
     

105. 
     

106. int main()

107. {

108. int sel;

109. 
     

110. while(1) {

111. system("cls");

112. puts("MENU");

113. puts("1. Insert");

114. puts("2. Print");

115. puts("3. Sort");

116. puts("4. Quit");

117. printf("선택해 : ");

118. scanf("%d", &sel);

119. fflush(stdin);

120. 
     

121. switch(sel) {

122. case 1: insert(); break;

123. case 2: print();  break;

124. case 3: sort();   break;

125. case 4: exit(1);

126. }

127. getch();

128. }

130. return 0;

131. }
     

bingo_src.cpp

1. #include <stdio.h>

2. #include <stdlib.h>

3. #include <time.h>

4. 
   

5. 
   

6. void init_shuffle(int (*user1)[5], int (*user2)[5]) //2차원 배열 넘기기 (Call by reference)

7. {

8. srand((unsigned)time(NULL));

9. int i, j, k, w = 0, tmp, picked[25] = {0}; //picked 배열에 선택 된 수를 저장

10. bool flag = false; //picked 배열에 이미 저장된 숫자가 뽑힐 경우 true

11. 
    

12. for(i = 0; i < 5; i++) { //user1 빙고판 생성

13. for(j = 0; j < 5; j++) {

14. while(1) {

15. tmp = (rand() % 50) + 1;

16. for(k = 0; k < 25; k++) {

17. if(tmp == picked[k]) flag = true;

18. }

19. if(flag) {

20. flag = false;

21. continue; //중복이면 다시 while 첫 부분으로

22. }

23. else {

24. picked[w++] = user1[i][j] = tmp;

25. break;    //안중복이면 뽑힌거 저장하고 while 이탈

26. }

27. }

28. }

29. }

30. 
    

31. w = 0;

32. for(i = 0; i < 25; i++) {

33. picked[i] = 0;

34. }

35. 
    

36. for(i = 0; i < 5; i++) {

37. for(j = 0; j < 5; j++) {

38. while(1) {

39. tmp = (rand() % 50) + 1;

40. for(k = 0; k < 25; k++) {

41. if(tmp == picked[k]) flag = true;

42. }

43. if(flag) {

44. flag = false;

45. continue;

46. }

47. else {

48. picked[w++] = user2[i][j] = tmp;

49. break;

50. }

51. }

52. }

53. }

54. }

55. 
    

56. 
    

57. void prnt_map(int (*user1)[5], int (*user2)[5])

58. {

59. int i, j;

60. 
    

61. system("cls");

62. for(i = 0; i < 5; i++) {

63. for(j = 0; j < 5; j++) {

64. if(user1[i][j] == 0) printf("\t*");

65. else printf("\t%d", user1[i][j]);

66. }

67. printf("\n");

68. }

69. printf("\n\n\n");

70. for(i = 0; i < 5; i++) {

71. for(j = 0; j < 5; j++) {

72. if(user2[i][j] == 0) printf("\t*");

73. else printf("\t%d", user2[i][j]);

74. }

75. printf("\n");

76. }

77. }

78. 
    

79. 
    

80. int check_bingo(int user[5][5]) //2차원 배열 넘기기 (Call by value)

81. {

82. int i, j, sum = 0, bingo = 0;;

83. 
    

84. for(i = 0; i < 5; i++) {

85. for(j = 0; j < 5; j++) {

86. sum += user[i][j];

87. }

88. if(sum == 0) {

89. bingo++;

90. }

91. else         sum = 0;

92. }

93. 
    

94. for(j = 0; j < 5; j++) {

95. for(i = 0; i < 5; i++) {

96. sum += user[i][j];

97. }

98. if(sum == 0) {

99. bingo++;

100. }

101. else         sum = 0;

102. }

104. sum = 0;

105. for(i = 0; i < 5; i++) {

106. sum += user[i][i];

107. }

108. if(sum == 0) {

109. bingo++;

110. }

111. else         sum = 0;

112. 
     

113. sum = 0;

114. for(i = 4, j = 0; i > -1, j < 5; i--, j++) {

115. sum += user[i][j];

116. }

117. if(sum == 0) {

118. bingo++;

119. }

120. 
     

121. return bingo;

122. }

123. 
     

124. 
     

125. void call_number(int (*user1)[5], int (*user2)[5])

126. {

127. int i, j, num;

128. bool flag = false;

129. 
     

130. while(!flag) {

131. printf("입력해라 : ");

132. scanf("%d", &num);

133. 
     

134. for(i = 0; i < 5; i++) {

135. for(j = 0; j < 5; j++) {

136. if(num == user1[i][j]) {

137. user1[i][j] = 0;

138. flag = true;

139. }

140. }

141. }

142. if(!flag) printf("없는 숫자다.\n");

143. else {

144. for(i = 0; i < 5; i++) {

145. for(j = 0; j < 5; j++) {

146. if(num == user2[i][j]) user2[i][j] = 0;

147. }

148. }

149. }

150. }

151. }

152. 
     

153. 
     

154. void computers_revange(int (*user)[5], int (*followed)[5])

155. {

156. int i, j, ind, tmp_cmp, tmp_gst, AIpick, cnt = 0, compr[12] = {0}, ghost[12];

157. 
     

158. for(i = 0; i < 12; i++) {

159. ghost[i] = i;

160. }

161. 
     

162. for(i = 0; i < 5; i++) {

163. for(j = 0; j < 5; j++) {

164. if(user[i][j] == 0) {

165. compr[cnt]++;

166. }

167. }

168. cnt++;

169. }

171. for(j = 0; j < 5; j++) {

172. for(i = 0; i < 5; i++) {

173. if(user[i][j] == 0) {

174. compr[cnt]++;

175. }

176. }

177. cnt++;

178. }

179. 
     

180. for(i = 0; i < 5; i++) {

181. if(user[i][i] == 0) {

182. compr[cnt]++;

183. }

184. }

185. cnt++;

186. 
     

187. for(i = 4, j = 0; i > -1, j < 5; i--, j++) {

188. if(user[i][j] == 0) {

189. compr[cnt]++;

190. }

191. }

192. 
     

193. for(i = 0; i < 11; i++) {

194. for(j = i + 1; j < 12; j++) {

195. if(compr[i] < compr[j]) {

196. tmp_cmp = compr[i];

197. tmp_gst = ghost[i];

198. compr[i] = compr[j];

199. ghost[i] = ghost[j];

200. compr[j] = tmp_cmp;

201. ghost[j] = tmp_gst;

202. }

203. }

204. }

205. for(i = 0; i < 12; i++) printf("%d ", compr[i]);

206. 
     

207. for(i = 0; i < 12; i++) {

208. if(compr[i] < 5) {

209. ind = ghost[i];

210. break;

211. }

212. else continue;

213. }

214. 
     

215. if(ind >=0 && ind < 5) {

216. for(i = 0; i < 5; i++) {

217. if(user[ind][i] != 0) {

218. AIpick = user[ind][i];

219. user[ind][i] = 0;

220. break;

221. }

222. else continue;

223. }

224. }

225. else if(ind >= 5 && ind < 10) {

226. for(i = 0; i < 5; i++) {

227. if(user[i][ind - 5] != 0) {

228. AIpick = user[i][ind - 5];

229. user[i][ind - 5] = 0;

230. break;

231. }

232. else continue;

233. }

234. }

235. else if(ind == 10) {

236. for(i = 0; i < 5; i++) {

237. if(user[i][i] != 0) {

238. AIpick = user[i][i];

239. user[i][i] = 0;

240. break;

241. }

242. else continue;

243. }

244. }

245. else {

246. for(i = 4, j = 0; i > -1, j < 5; i--, j++) {

247. if(user[i][j] != 0) {

248. AIpick = user[i][i];

249. user[i][j] = 0;

250. break;

251. }

252. else continue;

253. }

254. }

255. 
     

256. for(i = 0; i < 5; i++) {

257. for(j = 0; j < 5; j++) {

258. if(followed[i][j] == AIpick) {

259. followed[i][j] = 0;

260. }

261. }

262. }

263. }

264. 
     

265. 
     

266. int main()

267. {

268. int user1[5][5];

269. int user2[5][5];

270. int a = 0;

271. 
     

272. init_shuffle(user1, user2); //빙고 판 생성

273. prnt_map(user1, user2);

274. 
     

275. while(check_bingo(user1) <= 4 && check_bingo(user2) <= 4) {

276. call_number(user1, user2);

277. computers_revange(user2, user1);

278. prnt_map(user1, user2);

279. printf("내 빙고 = %d\t적 빙고 = %d\n", check_bingo(user1), check_bingo(user2));

280. }

282. if(check_bingo(user1) == check_bingo(user2)) printf("비겼다\n");

283. else if(check_bingo(user1) > check_bingo(user2)) printf("이겼다\n");

284. else printf("졌다\n");

285. 
     

286. return 0;

287. }

아 미친 못 이김

comment_remover_src.cpp

1. #include <stdio.h>
2. 
   
3. #define OUT 0
4. #define IN  1
5. 
   
6. int main()
7. {
8. char ch, prm, sub;
9. int state = OUT;
10. bool line_flag = false;
11. bool star_flag = false;
13. while( (ch = getchar()) != '\n' ) {
14. if( state == IN ) {
15. if( ch == '*' ) {
16. prm = getchar();
17. if( prm == '/' && !line_flag) {
18. state = OUT;
19. }
20. else if( prm == '*' && !star_flag) {
21. star_flag = true;
22. }
23. }
24. else if( ch == '/' ) {
25. if(star_flag) {
26. state = OUT;
27. star_flag = false;
28. }
29. }
30. else star_flag = false;
31. }
32. else { //(state == OUT)
33. if( ch == '/' ) {
34. sub = getchar();
35. if( sub == '*' ) {
36. state = IN; 
37. }
38. else if ( sub == '/' ) {
39. state = IN;
40. line_flag = true;
41. }
42. else {
43. putchar( ch );
44. putchar( sub );
45. }
46. }
47. else putchar( ch );
48. }
49. }
50. 
    
51. printf("\n");
52. 
    
53. return 0;
54. }

1. #include <stdio.h>

2. 
   

3. int main()

4. {

5. int c, i, j, arr_cnt[26] = {0};

6. 
   

7. printf("Input things : \n");

8. while((c = getchar()) != EOF) {

9. if('a' <= c && c <= 'z') {

10. c -= 97;

11. arr_cnt[c]++;

12. }

13. else if('A' <= c && c <= 'Z') {

14. c -= 65;

15. arr_cnt[c]++;

16. }

17. else continue;

18. }

19. 
    

20. printf("<PRINT>\n");

21. for(i = 0; i <= 25; i++) {

22. if(arr_cnt[i] > 0) {

23. printf("%c : ", i + 65);

24. for(j = 1; j <= arr_cnt[i]; j++) {

25. printf("*");

26. }

27. printf("\n");

28. }

29. else continue;

30. }

31. 
    

32. return 0;

33. }

    
    

    
    

1. #include <stdio.h>

2. #include <stdlib.h>

3. #include <time.h>

4. 
   

5. 
   

6. void selection_sort(int arr[])

7. {

8. int i, j, tmp_prime, tmp_ghost;

9. static int arr_ghost[46];

10. 
    

11. for(i = 0; i <= 45; i++) {

12. arr_ghost[i] = i;

13. }

14. 
    

15. for(i = 0; i < 45; i++) {

16. for(j = i + 1; j < 46; j++) {

17. if(arr[i] < arr[j]) {

18. tmp_prime = arr[i];

19. tmp_ghost = arr_ghost[i];

20. arr[i] = arr[j];

21. arr_ghost[i] = arr_ghost[j];

22. arr[j] = tmp_prime;

23. arr_ghost[j] = tmp_ghost;

24. }

25. }

26. }

27. 
    

28. for(i = 0; i <= 6; i++) {

29. printf("%02d : %d번 뽑힘\n", arr_ghost[i], arr[i]);

30. }

31. }

32. 
    

33. int main()

34. {

35. int arr[1000] = {0};

36. int arrr[46] = {0};

37. int i, f;

38. 
    

39. srand((unsigned)time(NULL));

40. 
    

41. for(i = 0; i <= 999; i++) {

42. arr[i] = rand() % 45 + 1;

43. f = arr[i];

44. arrr[f]++;

45. }

46. 
    

47. selection_sort(arrr);

48. 
    

49. return 0;

50. }