Codeup 1548, 1556, 1561, 3160 문제풀이

No. 1548

#include <stdio.h>
int n;
int grade(n)
{
    if (n >= 90 && n <= 100)
    {
        return 'A';
    }

    else if (n >= 80 && n < 90)
    {
        return 'B';
    }

    else if (n >= 70 && n < 80)
    {
        return 'C';
    }

    else if (n >= 60 && n < 70)
    {
        return 'D';
    }

    else
    {
        return 'F';
    }
}

int main(void)
{
    scanf("%d", &n);
    printf("%c", grade(n));

    return 0;
}

No. 1556

#include <stdio.h>
int n;

long long int f(n)
{
    int sum = 1;

    for (int i = 2; i <= n; i++)
    {
        sum *= i;
    }
    return sum;
}
int main(void)
{
    scanf("%d", &n);
    printf("%lld\n", f(n));
    return 0;
}

No. 1561 

#include <stdio.h>
int n, m;
int max(n, m)
{
    int max = 0;
    if (n >= m)
    {
        max = n;
    }

    else
    {
        max = m;
    }
    return max;
}

int main(void)
{
    scanf("%d %d", &n, &m);
    printf("%d\n", max(n, m));
    return 0;
}

No. 3160

#include <stdio.h>
int main(void)
{
    int a, time[101], amount[101], HamburgerCnt = 0, cnt = 1, total = 0;
    scanf("%d", &a);

    for (int i = 0; i < a; i++)
    {
        scanf("%d %d", &time[i], &amount[i]);
    }

    for (int i = 1; i <= 120; i++)
    {
        if (i != 0 && i % 10 == 0)
        {
            HamburgerCnt += 5;
        }

        if (time[cnt] == i)
        {
            if (HamburgerCnt >= amount[cnt])
            {
                HamburgerCnt -= amount[cnt];
                total += amount[cnt];
            }
            cnt++;
       }
    }

    printf("%d", total);
    return 0;
}