8.6 แบบฝึกหัด

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

char name[55];

void print_repeat(char symbol, int count)
{
    for (int i = 0; i < count; i++) {
        printf("%c", symbol);
    }
}

void print_border(int width)
{
    print_repeat('#', width);
    printf("\n");
}

void print_blank(int width)
{
    printf("#");
    print_repeat(' ', width - 2);
    printf("#\n");
}

int main()
{
    int padding;
    scanf("%s %d", name, &padding);
    int width = strlen(name) + 2 * padding + 2;
    print_border(width);
    for (int i = 0; i < padding; i++) {
        print_blank(width);
    }
    printf("#");
    print_repeat(' ', padding);
    printf("%s", name);
    print_repeat(' ', padding);
    printf("#\n");
    for (int i = 0; i < padding; i++) {
        print_blank(width);
    }
    print_border(width);
    return 0;
}

#include <stdio.h>

int digit_sum(int n)
{
    int sum = 0;
    while (n > 0) {
        sum += n % 10;
        n /= 10;
    }
    return sum;
}

int main()
{
    int n;
    scanf("%d", &n);
    int best_ticket = -1;
    int best_sum = -1;
    for (int i = 0; i < n; i++) {
        int ticket;
        scanf("%d", &ticket);
        int sum = digit_sum(ticket);
        if (sum > best_sum || (sum == best_sum && ticket < best_ticket)) {
            best_ticket = ticket;
            best_sum = sum;
        }
    }
    printf("%d %d\n", best_ticket, best_sum);
    return 0;
}

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

int xs[1000];
int ys[1000];

double distance(int x1, int y1, int x2, int y2)
{
    double dx = x2 - x1;
    double dy = y2 - y1;
    return sqrt(dx * dx + dy * dy);
}

int main()
{
    int n;
    scanf("%d", &n);
    for (int i = 0; i < n; i++) {
        scanf("%d %d", &xs[i], &ys[i]);
    }
    double total = 0;
    double longest = 0;
    for (int i = 0; i < n; i++) {
        int next = (i + 1) % n;
        double leg = distance(xs[i], ys[i], xs[next], ys[next]);
        total += leg;
        if (leg > longest) {
            longest = leg;
        }
    }
    printf("%.2f\n", total);
    printf("%.2f\n", longest);
    return 0;
}

#include <stdio.h>

int is_prime(int n)
{
    if (n < 2) {
        return 0;
    }
    for (long long i = 2; i * i <= n; i++) {
        if (n % i == 0) {
            return 0;
        }
    }
    return 1;
}

int reverse_number(int n)
{
    int result = 0;
    while (n > 0) {
        result = result * 10 + n % 10;
        n /= 10;
    }
    return result;
}

int main()
{
    int a, b;
    scanf("%d %d", &a, &b);
    int count = 0;
    for (int n = a; n <= b; n++) {
        if (is_prime(n) && is_prime(reverse_number(n))) {
            count++;
        }
    }
    printf("%d\n", count);
    return 0;
}

#include <stdio.h>

int room_a[1000];
int room_b[1000];

void read_array(int values[], int n)
{
    for (int i = 0; i < n; i++) {
        scanf("%d", &values[i]);
    }
}

int max_of_array(int values[], int n)
{
    int best = values[0];
    for (int i = 1; i < n; i++) {
        if (values[i] > best) {
            best = values[i];
        }
    }
    return best;
}

int min_of_array(int values[], int n)
{
    int worst = values[0];
    for (int i = 1; i < n; i++) {
        if (values[i] < worst) {
            worst = values[i];
        }
    }
    return worst;
}

int sum_of_array(int values[], int n)
{
    int sum = 0;
    for (int i = 0; i < n; i++) {
        sum += values[i];
    }
    return sum;
}

int main()
{
    int n, m;
    scanf("%d", &n);
    read_array(room_a, n);
    scanf("%d", &m);
    read_array(room_b, m);
    printf("%d %d\n", max_of_array(room_a, n), min_of_array(room_a, n));
    printf("%d %d\n", max_of_array(room_b, m), min_of_array(room_b, m));
    int left = sum_of_array(room_a, n) * m;
    int right = sum_of_array(room_b, m) * n;
    if (left > right) {
        printf("A\n");
    } else if (left < right) {
        printf("B\n");
    } else {
        printf("SAME\n");
    }
    return 0;
}

#include <stdio.h>

long long gcd(long long a, long long b)
{
    while (b != 0) {
        long long remainder = a % b;
        a = b;
        b = remainder;
    }
    return a;
}

int main()
{
    int n;
    scanf("%d", &n);
    long long top = 0;
    long long bottom = 1;
    for (int i = 0; i < n; i++) {
        int a, b;
        scanf("%d/%d", &a, &b);
        top = top * b + a * bottom;
        bottom = bottom * b;
        long long g = gcd(top, bottom);
        top /= g;
        bottom /= g;
    }
    if (bottom == 1) {
        printf("%lld\n", top);
    } else {
        printf("%lld/%lld\n", top, bottom);
    }
    return 0;
}

#include <stdio.h>

int is_leap(int year)
{
    return (year % 4 == 0 && year % 100 != 0) || year % 400 == 0;
}

int days_in_month(int month, int year)
{
    if (month == 2) {
        return is_leap(year) ? 29 : 28;
    }
    if (month == 4 || month == 6 || month == 9 || month == 11) {
        return 30;
    }
    return 31;
}

int day_number(int day, int month, int year)
{
    int total = 0;
    for (int y = 1900; y < year; y++) {
        total += is_leap(y) ? 366 : 365;
    }
    for (int m = 1; m < month; m++) {
        total += days_in_month(m, year);
    }
    return total + day;
}

int main()
{
    int q;
    scanf("%d", &q);
    for (int i = 0; i < q; i++) {
        int d1, m1, y1, d2, m2, y2;
        scanf("%d %d %d %d %d %d", &d1, &m1, &y1, &d2, &m2, &y2);
        printf("%d\n", day_number(d2, m2, y2) - day_number(d1, m1, y1));
    }
    return 0;
}

#include <stdio.h>

char segments[10][8] = {"abcdef", "bc", "abdeg", "abcdg", "bcfg",
                        "acdfg", "acdefg", "abc", "abcdefg", "abcdfg"};
char digits[25];
int size;

int is_on(int digit, char segment)
{
    for (int i = 0; segments[digit][i] != '\0'; i++) {
        if (segments[digit][i] == segment) {
            return 1;
        }
    }
    return 0;
}

void print_repeat(char symbol, int count)
{
    for (int i = 0; i < count; i++) {
        printf("%c", symbol);
    }
}

void print_horizontal(char segment)
{
    for (int i = 0; digits[i] != '\0'; i++) {
        if (i > 0) {
            printf(".");
        }
        printf(".");
        print_repeat(is_on(digits[i] - '0', segment) ? '#' : '.', size);
        printf(".");
    }
    printf("\n");
}

void print_vertical(char left, char right)
{
    for (int i = 0; digits[i] != '\0'; i++) {
        int digit = digits[i] - '0';
        if (i > 0) {
            printf(".");
        }
        printf("%c", is_on(digit, left) ? '#' : '.');
        print_repeat('.', size);
        printf("%c", is_on(digit, right) ? '#' : '.');
    }
    printf("\n");
}

int main()
{
    scanf("%d %s", &size, digits);
    print_horizontal('a');
    for (int r = 0; r < size; r++) {
        print_vertical('f', 'b');
    }
    print_horizontal('g');
    for (int r = 0; r < size; r++) {
        print_vertical('e', 'c');
    }
    print_horizontal('d');
    return 0;
}