Minyokim

minyokim/BOJ/0. bronze/1/1157_단어공부.c

@@ -0,0 +1,46 @@
+#include <stdio.h>
+#include <string.h>
+
+#define MAX(a, b) ((a) > (b) ? (a) : (b))
+
+int main(void)
+{
+    char word[1000000];
+    char alpha[] = "abcdefghijklmnopqrstuvwxyz";
+    char Alpha[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
+    int count[26] = {0};
+    int max;
+    int max_index;
+    int check = 0;
+    int str_len;
+
+    scanf("%s", word);
+    str_len = strlen(word);
+    for (int i = 0; i < str_len; i++)
+        for (int j = 0; j < 26; j++)
+            if (word[i] == alpha[j] || word[i] == Alpha[j])
+                count[j]++;
+
+    max = count[0];
+    max_index = 0;
+    for (int i = 1; i < 26; i++)
+        max = MAX(max, count[i]);
+
+    for (int i = 0; i < 26; i++)
+    {
+        if (max == count[i])
+        {
+            check++;
+            max_index = i;
+        }
+    }
+
+    if (check != 1)
+    {
+        printf("?");
+        return 0;
+    }
+
+    printf("%c", Alpha[max_index]);
+    return 0;
+}

minyokim/BOJ/0. bronze/1/2750_수정렬하기.c

@@ -0,0 +1,28 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+void swap(int *a, int *b)
+{
+    int temp = *a;
+    *a = *b;
+    *b = temp;
+}
+
+int main(void)
+{
+    int N;
+    int *arr;
+
+    scanf("%d", &N);
+    arr = (int *)malloc(sizeof(int) * N);
+    for (int i = 0; i < N; i++)
+        scanf("%d", &arr[i]);
+    for (int i = N - 1; i > 0; i--)
+        for (int j = 0; j < i; j++)
+            if (arr[j] > arr[j + 1])
+                swap(&arr[j], &arr[j + 1]);
+    for (int i = 0; i < N; i++)
+        printf("%d\n", arr[i]);
+
+    return 0;
+}

minyokim/BOJ/0. bronze/2/10809_알파벳찾기.c

@@ -0,0 +1,28 @@
+#include <stdio.h>
+#include <string.h>
+
+int main(void)
+{
+    char word[101];
+    char alphabet[] = "abcdefghijklmnopqrstuvwxyz";
+    int flag;
+
+    scanf("%s", word);
+
+    for (int i = 0; i < 26; i++)
+    {
+        flag = 0;
+        for (int j = 0; j < strlen(word); j++)
+        {
+            if (alphabet[i] == word[j])
+            {
+                printf("%d ", j);
+                flag = 1;
+                break;
+            }
+        }
+        if (flag == 0)
+            printf("-1 ");
+    }
+    return 0;
+}

minyokim/BOJ/0. bronze/2/10870_피보나치수5.c

@@ -0,0 +1,21 @@
+#include <stdio.h>
+
+int fibonacci(int n)
+{
+    if (n == 0)
+        return 0;
+    if (n == 1)
+        return 1;
+    if (n == 2)
+        return 1;
+    return (fibonacci(n - 1) + fibonacci(n - 2));
+}
+int main(void)
+{
+    int n;
+
+    scanf("%d", &n);
+    printf("%d", fibonacci(n));
+
+    return 0;
+}

minyokim/BOJ/0. bronze/2/1152_단어의개수.c

@@ -0,0 +1,24 @@
+#include <stdio.h>
+#include <string.h>
+
+int main(void)
+{
+    char str[1000000];
+    int count = 1;
+    int i = 0;
+
+    scanf("%[^\n]s", str);
+    if (str[0] == ' ')
+        count--;
+    if (str[strlen(str) - 1] == ' ')
+        count--;
+    while (str[i])
+    {
+        if (str[i] == ' ')
+            count++;
+        i++;
+    }
+    printf("%d", count);
+
+    return 0;
+}

minyokim/BOJ/0. bronze/2/11720_숫자의합.c

@@ -0,0 +1,21 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+int main(void)
+{
+    int num;
+    char *arr;
+    int result = 0;
+
+    scanf("%d", &num);
+
+    arr = (char *)malloc(sizeof(char) * num);
+    scanf("%s", arr);
+
+    for (int i = 0; i < num; i++)
+    {
+        result += arr[i] - '0';
+    }
+
+    printf("%d", result);
+}

minyokim/BOJ/0. bronze/2/15596_정수N개의합.c

@@ -0,0 +1,12 @@
+#include <stdio.h>
+
+long long sum(int *a, int n)
+{
+    long long ans = 0;
+
+    for (int i = 0; i < n; i++)
+    {
+        ans += a[i];
+    }
+    return ans;
+}

minyokim/BOJ/0. bronze/2/2231_분해합.c

@@ -0,0 +1,27 @@
+#include <stdio.h>
+
+int bucket[1000000];
+
+int ft_bucket(int n)
+{
+    int sum = n;
+    int temp = n;
+    while (n)
+    {
+        sum += n % 10;
+        n /= 10;
+    }
+    if (sum <= 1000000 && bucket[sum - 1] == 0)
+        bucket[sum - 1] = temp;
+}
+
+int main(void)
+{
+    int N;
+
+    scanf("%d", &N);
+    for (int i = 1; i < 1000000; i++)
+        ft_bucket(i);
+
+    printf("%d", bucket[N - 1]);
+}

minyokim/BOJ/0. bronze/2/2675_문자열반복.c

@@ -0,0 +1,21 @@
+#include <stdio.h>
+#include <string.h>
+
+int main(void)
+{
+    int T;
+    int R;
+    char str[20];
+
+    scanf("%d", &T);
+    for (int n = 0; n < T; n++)
+    {
+        scanf("%d %s", &R, &str);
+        for (int i = 0; i < strlen(str); i++)
+        {
+            for (int j = 0; j < R; j++)
+                printf("%c", str[i]);
+        }
+        printf("\n");
+    }
+}

minyokim/BOJ/0. bronze/2/2798_블랙잭.c

@@ -0,0 +1,34 @@
+#include <stdio.h>
+#define MAX(a, b) (a >= b ? a : b)
+
+int main(void)
+{
+    int N;
+    int M;
+    int card[100];
+    int comb[161700];
+    int n = 0;
+    int count = 0;
+    int max;
+
+    scanf("%d %d", &N, &M);
+
+    for (int i = 0; i < N; i++)
+        scanf("%d", &card[i]);
+
+    for (int i = 0; i < N - 2; i++)
+        for (int j = i + 1; j < N - 1; j++)
+            for (int k = j + 1; k < N; k++)
+                if (card[i] + card[j] + card[k] <= M)
+                {
+                    comb[n] = card[i] + card[j] + card[k];
+                    count++;
+                    n++;
+                }
+
+    max = comb[0];
+    for (int i = 1; i < count; i++)
+        max = MAX(max, comb[i]);
+    printf("%d", max);
+    return 0;
+}

minyokim/BOJ/0. bronze/2/2908_상수.c

@@ -0,0 +1,26 @@
+#include <stdio.h>
+
+int main(void)
+{
+    char num1[4];
+    char num2[4];
+
+    scanf("%s%s", num1, num2);
+    for (int i = 2; i >= 0; i--)
+    {
+        if (num1[i] == num2[i])
+            continue;
+        if (num1[i] > num2[i])
+        {
+            for (int j = 2; j >= 0; j--)
+                printf("%d", num1[j] - '0');
+            return 0;
+        }
+        else
+        {
+            for (int j = 2; j >= 0; j--)
+                printf("%d", num2[j] - '0');
+            return 0;
+        }
+    }
+}

minyokim/BOJ/0. bronze/2/5622_다이얼.c

@@ -0,0 +1,32 @@
+#include <stdio.h>
+
+int main(void)
+{
+    char word[16];
+    int result = 0;
+    int i = 0;
+    scanf("%s", word);
+    while (word[i])
+    {
+        if (word[i] >= 'A' && word[i] <= 'C')
+            result += 3;
+        if (word[i] >= 'D' && word[i] <= 'F')
+            result += 4;
+        if (word[i] >= 'G' && word[i] <= 'I')
+            result += 5;
+        if (word[i] >= 'J' && word[i] <= 'L')
+            result += 6;
+        if (word[i] >= 'M' && word[i] <= 'O')
+            result += 7;
+        if (word[i] >= 'P' && word[i] <= 'S')
+            result += 8;
+        if (word[i] >= 'T' && word[i] <= 'V')
+            result += 9;
+        if (word[i] >= 'W' && word[i] <= 'Z')
+            result += 10;
+        i++;
+    }
+    printf("%d", result);
+
+    return 0;
+}

minyokim/BOJ/0. bronze/3/10872_팩토리얼.c

@@ -0,0 +1,19 @@
+#include <stdio.h>
+
+int factorial(int N)
+{
+    int result = N;
+
+    if (N == 1 || N == 0)
+        return 1;
+    return (result * factorial(N - 1));
+}
+int main(void)
+{
+    int N;
+
+    scanf("%d", &N);
+    printf("%d", factorial(N));
+
+    return 0;
+}

minyokim/BOJ/0. bronze/5/11654_아스키코드.c

@@ -0,0 +1,9 @@
+#include <stdio.h>
+
+int main(void)
+{
+    char i;
+
+    scanf("%s", &i);
+    printf("%d", i);
+}

minyokim/BOJ/1. silver/4/1065_한수.c

@@ -0,0 +1,8 @@
+#include <stdio.h>
+
+int main(void)
+{
+    int N;
+
+    scanf("%d", &N);
+}