본문 바로가기
Algorithm/JUNGOL

C언어, JUNGOL 181 ~ 190

by OdOp 관리자 2023. 11. 25.
SMALL

jungol 181부터 jungol 190까지 c언어로 작성된 코드입니다.

참고해 주시면 좋을 것 같습니다. 

 

jungol 181

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>

#define A 7

double j_181_1(double radius)
{
    return radius * radius * 3.141592;
}

int main(void)
{
    double radius;

    printf("radius : ");
    scanf("%lf", &radius);
    printf("area = %.3f",j_181_1(radius));
    return 0;
}

 

jungol 182

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include<math.h> 

int main()
{
    int pls;
    int sub;
    char str1;
    char str2;

    scanf("%c %c", &str1, &str2);
    pls = (int)str1 + (int)str2;
    sub = abs((int)str1 - (int)str2);
    printf("%d %d\n", pls, sub);
    return 0;
}

 

jungol 183

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>

int main()
{
    char str[100];

    scanf("%[^\n]s", str);
    for (int i = 0; i < 5; i++)
    {
        printf("%c", str[i]);
    }
    return 0;
}

 

jungol 184

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include<string.h> 

int main()
{
    int len;
    char str[100];
    
    scanf("%[^\n]s", str);
    len = strlen(str);
    for (int i = 0; i < len; i++)
    {
        if ((int)str[i] >= 48 && (int)str[i] <= 57)
        {
            printf("%c", str[i]);
        }
        else if ((int)str[i] >= 65 && (int)str[i] <= 90)
        {
            str[i] += 32;
            printf("%c", str[i]);
        }
        else if ((int)str[i] >= 97 && (int)str[i] <= 122) 
        {
            printf("%c", str[i]);
        }
        else
        {
            continue;
        }
    }
    return 0;
}

 

jungol 185

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include<string.h> 

int main()
{
    int len;
    int i;
    char str[100];
    char n;

    scanf("%s %c", str, &n);
    len = strlen(str);
    for (i = 0; i < len; i++)
    {
        if (str[i] == n)
        {
            printf("%d\n", i);
            break;
        }
    }
    if (str[i] != n && i!= len-1)
    {
        printf("No");
    }
    return 0;
}

 

jungol 186

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include<string.h> 

int main()
{
    int len1;
    int len2;
    char str1[100];
    char str2[100];
    
    scanf("%s %s", str1, str2);
    len1 = strlen(str1);
    len2 = strlen(str2);
    if (len1 >= len2)
    {
        printf("%d\n", len1);
    }
    else
    {
        printf("%d\n", len2);
    }
    return 0;
}

 

jungol 187

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include<string.h>

int main()
{
    char str[100];
    int n;
    int len;

    scanf("%s", str);
    while (strlen(str) > 1)
    {
        scanf("%d", &n);
        if (n <= strlen(str)-1)
        {
            for (int i = n-1; i < strlen(str); i++)
            {
                str[i] = str[i + 1];
            }
        }
        else
        {
            str[strlen(str) - 1] = NULL;
        }
        printf("%s\n", str);
    }
    return 0;
}

 

jungol 188

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include<string.h>

int main()
{
    char str[100];
    int n = 1;

    scanf("%[^\n]s", str);
    char* ptr = strtok(str, " ");
    while (ptr != NULL)
    {
        printf("%d. %s\n", n, ptr);
        ptr = strtok(NULL, " ");
        n++;
    }
    return 0;
}

 

jungol 189

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>

int main()
{
    char c1[100];
    char* ar[20];
    int count = 0;

    scanf("%[^\n]s", c1);
    char* ptr = strtok(c1, " ");
    while (ptr != NULL)
    {
        ar[count] = ptr;
        count++;
        ptr = strtok(NULL, " ");
    }
    count--;
    for (int i = count; i >= 0; i--)
    {
        printf("%s\n", ar[i]);
    }
    return 0;
}

 

jungol 190

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>

int main()
{
    char c1;
    char ar[5][20] = { "flower", "rose", "lily", "daffodil", "azalea" };
    char* arr1[5];
    int count = 0;

    scanf("%c", &c1);
    for (int i = 0; i < 5; i++)
    {
        for (int j = 1; j < 3; j++)
        {
            if (c1 == ar[i][j])
            {
                j = 3;
                arr1[count] = ar[i];
                count++;
            }
        }
    }
    for (int i = 0; i < count; i++)
        printf("%s\n", arr1[i]);
    printf("%d\n", count);
    return 0;
}
LIST

'Algorithm > JUNGOL' 카테고리의 다른 글

C언어, JUNGOL 591 ~ 600  (0) 2023.11.27
C언어, JUNGOL 9091 ~ 9100  (4) 2023.11.26
C언어, JUNGOL 581 ~ 590  (1) 2023.11.24
C언어, JUNGOL 9081 ~ 9090  (1) 2023.11.23
C언어, JUNGOL 171 ~ 180  (0) 2023.11.22