update README.md

devOTTO · devOTTO · commit f6c7fb259819 · 2019-04-27T00:01:06.000+09:00
diff --git a/README.md b/README.md
@@ -14,6 +14,15 @@ Personal Solution of Algorithm Probs
 #### [6.1차원 배열 사용하기](https://www.acmicpc.net/step/6)
 #### [7.문자열 사용하기](https://www.acmicpc.net/step/7)
 #### [8.규칙 찾기](https://www.acmicpc.net/step/8)
+- [2438](https://www.acmicpc.net/problem/2438) : 별 찍기 - 1 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/2438.cpp)
+- [2292](https://www.acmicpc.net/problem/2292) : 벌집 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/2292.cpp)
+- [1193](https://www.acmicpc.net/problem/1193) : 분수찾기 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/1193.cpp)
+- [1011](https://www.acmicpc.net/problem/1011) : Fly me to the Alpha Centauri = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/1011.cpp)
+- [10250](https://www.acmicpc.net/problem/10250) : ACM 호텔 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/10250.cpp)
+- [1924](https://www.acmicpc.net/problem/1924) : 2007년 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/1924.cpp)
+- [2775](https://www.acmicpc.net/problem/2775) : 부녀회장이 될테야 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/2775.cpp)
+- [1475](https://www.acmicpc.net/problem/1475) : 방 번호 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/1475.cpp)
+- [6064](https://www.acmicpc.net/problem/6064) : 카잉달력 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/6064.cpp)
 #### [9.정렬해보기](https://www.acmicpc.net/step/9)
 - [2750](https://www.acmicpc.net/problem/2750) : 수 정렬하기 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/2750.cpp)
 - [2751](https://www.acmicpc.net/problem/2751) : 수 정렬하기 2 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/2751.cpp)
diff --git a/baekjoon/10250.cpp b/baekjoon/10250.cpp
@@ -0,0 +1,21 @@
+//
+// Created by 융미 on 2019-04-26.
+//10250 ACM 호텔
+#include <cstdio>
+
+int main(){
+    int tc;
+    int h, w, n;
+    scanf("%d", &tc);
+    while(tc--)
+    {
+        scanf("%d %d %d", &h, &w, &n);
+        n--;
+        int floor = n%h + 1;
+        int num = n/h+1;
+
+        printf("%d\n", floor*100 + num);
+
+    }
+    return 0;
+}
diff --git a/baekjoon/1193.cpp b/baekjoon/1193.cpp
@@ -0,0 +1,33 @@
+//
+// Created by 융미 on 2019-04-26.
+//1193 분수찾기
+#include <cstdio>
+
+int main()
+{
+    int input = 0;
+    scanf("%d", &input);
+    int sum = 0;
+    int count = 0;
+    int up = 0;
+    int down = 0;
+
+    while(input > sum)
+    {
+        sum += ++count;
+    }
+
+    int k = input - (sum - count);
+
+    if(count%2)//홀
+    {
+        up = count - k + 1;
+        down = k;
+    }
+    else{
+        up = k;
+        down = count - k + 1;
+    }
+    printf("%d/%d", up, down);
+    return 0;
+}
diff --git a/baekjoon/1475.cpp b/baekjoon/1475.cpp
@@ -0,0 +1,33 @@
+//
+// Created by 융미 on 2019-04-26.
+//1475 방 번호
+#include <cstdio>
+
+int main()
+{
+    int num;
+    int arr[10] = {0, };
+    scanf("%d", &num);
+    if(num == 0)
+        printf("%d", 1);
+    else{
+        while(num){
+            arr[num%10]++;
+            num/=10;
+        }
+
+        int big = (arr[9] + arr[6] + 1)/2;
+
+        arr[6] = 0;
+
+        for(int i = 0; i<9; i++)
+        {
+            if(arr[i] > big)
+                big = arr[i];
+        }
+
+        printf("%d", big);
+    }
+
+    return 0;
+}
diff --git a/baekjoon/1924.cpp b/baekjoon/1924.cpp
@@ -0,0 +1,23 @@
+//
+// Created by 융미 on 2019-04-26.
+//1924 2007년
+#include <cstdio>
+int main(){
+
+    int month[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30,31};
+    char days[7][4] = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
+
+    int x, y, count = 0;
+
+    scanf("%d %d", &x, &y);
+
+    for(int i = 0; i < x-1; i++)
+    {
+        count += month[i];
+    }
+    count += y;
+
+    printf("%s", days[count%7]);
+
+    return 0;
+}
diff --git a/baekjoon/2292.cpp b/baekjoon/2292.cpp
@@ -0,0 +1,18 @@
+//
+// Created by 융미 on 2019-04-26.
+//2292 벌집
+#include <cstdio>
+
+int main()
+{
+    int input = 0;
+    scanf("%d", &input);
+    int sum = 1;
+    int count = 1;
+    while(input > sum)
+    {
+        sum += 6*(count++);
+    }
+    printf("%d", count);
+    return 0;
+}
diff --git a/baekjoon/2438.cpp b/baekjoon/2438.cpp
@@ -0,0 +1,19 @@
+//
+// Created by 융미 on 2019-04-27.
+//2438 별 찍기-1
+#include <cstdio>
+int main()
+{
+    int a;
+    scanf("%d", &a);
+
+    for(int i = 0; i<a; i++){
+        for(int j = 0; j<=i; j++)
+        {
+            printf("*");
+        }
+        printf("\n");
+    }
+    return 0;
+}
+
diff --git a/baekjoon/2775.cpp b/baekjoon/2775.cpp
@@ -0,0 +1,32 @@
+//
+// Created by 융미 on 2019-04-26.
+//2775 부녀회장이 될테야
+#include <cstdio>
+
+int bunyu(int k, int n);
+
+int main(){
+    int tc,k,n;
+
+    scanf("%d", &tc);
+
+    while(tc--)
+    {
+        scanf("%d", &k);
+        scanf("%d", &n);
+
+        printf("%d\n", bunyu(k,n));
+    }
+    return 0;
+}
+
+int bunyu(int k, int n)
+{
+    if(n == 1)   // base case 1호
+        return 1;
+
+    if(k == 0) //base case 0층
+        return n;
+
+    return bunyu(k, n-1) + bunyu(k-1,n);
+}
diff --git a/baekjoon/6064.cpp b/baekjoon/6064.cpp
@@ -0,0 +1,61 @@
+//
+// Created by 융미 on 2019-04-26.
+//6064 카잉 달력
+#include <cstdio>
+
+int gcd(int x, int y);
+
+int main()
+{
+    int tc, m,n,x,y, tempX, tempY;
+    int lcm = 0;
+    int count = 0;
+    scanf("%d", &tc);
+
+    while(tc--){
+        scanf("%d %d %d %d", &m, &n, &x, &y);
+
+        lcm =  m*n/gcd(m,n);
+        tempX = 1;
+        tempY = 1;
+        for(count = x; count<=lcm; count+=m)
+        {
+            tempX = (count-1)%m + 1;
+            tempY = (count-1)%n + 1;
+
+            if(tempX == x && tempY == y)
+                break;
+        }
+        if(count > lcm)
+            count = -1;
+
+        printf("%d\n", count);
+
+    }
+
+
+
+    return 0;
+
+}
+
+int gcd(int x, int y)
+{
+        if(x%y == 0) //base case
+            return y;
+
+        return gcd(y, x%y);
+
+}
+
+
+
+
+
+
+
+
+
+
+
+
