update README.md

devOTTO · devOTTO · commit 1347ceb33260 · 2019-04-28T17:40:42.000+09:00
diff --git a/README.md b/README.md
@@ -10,7 +10,16 @@ Personal Solution of Algorithm Probs
 #### [2.사칙연산 도전하기](https://www.acmicpc.net/step/2)
 #### [3.for문 사용해보기](https://www.acmicpc.net/step/3)
 #### [4.if문 사용해보기](https://www.acmicpc.net/step/4)
+- [9498](https://www.acmicpc.net/problem/9498) : 시험 성적 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/9498.cpp)
+- [10817](https://www.acmicpc.net/problem/10817) : 세 수 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/10817.cpp)
+- [10871](https://www.acmicpc.net/problem/10871) : X보다 작은 수 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/10871.cpp)
+- [1546](https://www.acmicpc.net/problem/1546) : 평균 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/1546.cpp)
+- [4344](https://www.acmicpc.net/problem/4344) : 평균은 넘겠지 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/4344.cpp)
+- [1110](https://www.acmicpc.net/problem/1110) : 더하기 사이클 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/1110.cpp)
 #### [5.함수 사용하기](https://www.acmicpc.net/step/5)
+- [4673](https://www.acmicpc.net/problem/4673) : 셀프 넘버 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/4673.cpp)
+- [1065](https://www.acmicpc.net/problem/1065) : 한수 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/1065.cpp)
+- [2448](https://www.acmicpc.net/problem/2448) : 별 찍기 - 11 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/2448.cpp)
 #### [6.1차원 배열 사용하기](https://www.acmicpc.net/step/6)
 - [1152](https://www.acmicpc.net/problem/1152) : 단어의 개수 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/1152.cpp)
 - [2577](https://www.acmicpc.net/problem/2577) : 숫자의 개수 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/2577.cpp)
diff --git a/baekjoon/1065.cpp b/baekjoon/1065.cpp
@@ -0,0 +1,26 @@
+//
+// Created by 융미 on 2019-04-28.
+//1065 한수
+#include <cstdio>
+
+int main(){
+
+    int num;
+    int han;
+
+    scanf("%d", &num);
+
+    if(num<100) han=num;
+    else{
+        han=99;
+        for(int i = 100; i<=num; i++){
+
+            if(((i/100) - ((i%100)/10)) == (((i%100)/10)-((i%100)%10))){
+                han++;
+            }
+        }
+    }
+
+    printf("%d", han);
+    return 0;
+}
diff --git a/baekjoon/2448.cpp b/baekjoon/2448.cpp
@@ -0,0 +1,115 @@
+//
+// Created by 융미 on 2019-04-28.
+//2448 별 찍기 - 11
+#include <iostream>
+
+char arr[3072][6144];
+
+void star(int h, int x, int y) //입력은 삼각형의 높이, x, y좌표
+{
+    //base case : 삼각형 높이가 3인 경우 삼각형 찍고 탈출
+    if(h==3){
+        arr[y][x] = '*';
+        arr[y+1][x-1] = '*';
+        arr[y+1][x+1] = '*';
+        arr[y+2][x-2] = '*';
+        arr[y+2][x-1] = '*';
+        arr[y+2][x] = '*';
+        arr[y+2][x+1] = '*';
+        arr[y+2][x+2] = '*';
+        return;
+    }
+
+    //위 삼각형
+    star(h/2, x, y);
+    //왼쪽 삼각형
+    star(h/2, x-(h/2), y+(h/2));
+    //오른쪽 삼각형
+    star(h/2, x+(h/2), y+(h/2));
+}
+
+int main(){
+
+    int input = 0;
+    std::cin>>input;
+
+    //배열 공백 초기화
+    for(int i = 0; i<input; i++)
+    {
+        for(int j = 0; j < input*2 -1; j++){
+            arr[i][j] = ' ';
+        }
+    }
+
+    star(input, input-1, 0);
+
+    for(int i = 0; i<input; i++)
+    {
+        for(int j = 0; j < input*2 -1; j++){
+            std::cout << arr[i][j];
+        }
+        std::cout << '\n';
+    }
+
+    return 0;
+}
+
+////*2448 재귀 별찍기-C출력 버전
+//#include <cstdio>
+//
+//char arr[3072][6144];
+//
+//void star(int h, int x, int y) //입력은 삼각형의 높이, x, y좌표
+//{
+//    //base case : 삼각형 높이가 3인 경우 삼각형 찍고 탈출
+//    if(h==3){
+//        arr[y][x] = '*';
+//        arr[y+1][x-1] = '*';
+//        arr[y+1][x+1] = '*';
+//        arr[y+2][x-2] = '*';
+//        arr[y+2][x-1] = '*';
+//        arr[y+2][x] = '*';
+//        arr[y+2][x+1] = '*';
+//        arr[y+2][x+2] = '*';
+//        return;
+//    }
+//
+//    //위 삼각형
+//    star(h/2, x, y);
+//    //왼쪽 삼각형
+//    star(h/2, x-(h/2), y+(h/2));
+//    //오른쪽 삼각형
+//    star(h/2, x+(h/2), y+(h/2));
+//}
+//
+//int main(){
+//
+//    int input = 0;
+//    scanf("%d", &input);
+//
+//    //배열 공백 초기화
+//    for(int i = 0; i<input; i++)
+//    {
+//        for(int j = 0; j < input*2 -1; j++){
+//            arr[i][j] = ' ';
+//        }
+//    }
+//
+//    star(input, input-1, 0);
+//
+//    for(int i = 0; i<input; i++)
+//    {
+//        for(int j = 0; j < input*2 -1; j++){
+//            printf("%c", arr[i][j]);
+//        }
+//        printf("\n");
+//    }
+//
+//    return 0;
+//}
+
+
+
+
+
+
diff --git a/baekjoon/4673.cpp b/baekjoon/4673.cpp
@@ -0,0 +1,32 @@
+//
+// Created by 융미 on 2019-04-28.
+//4673 셀프 넘버
+#include <cstdio>
+
+int d(int num){
+    int sum = num;
+    while(num!=0)
+    {
+        sum += num%10;
+        num = num/10;
+    }
+    return sum;
+}
+
+int main()
+{
+    bool arr[10001] = {false, };
+    for (int i = 1; i<10001; i++)
+    {
+        int num = d(i);
+        if(num<=10000){
+            arr[num] = true;
+        }
+    }
+
+    for(int i = 1; i<10001; i++)
+    {
+        if(!arr[i]) printf("%d\n", i);
+    }
+    return 0;
+}
