[C] Backjoon 1002번,2525번,2563번,2884번 문제정답코드

정답코드

---

2884번-알람 시계

#include <stdio.h>

int main(void) {
	int h, m, temp;
	scanf("%d %d", &h, &m);
	temp = 45 - m;
	m -= 45;
	if (m < 0) {
		h--;
		m = 60 - temp;
		if (h < 0)
			h = 23;
	}
	printf("%d %d", h, m);
	return 0;
 }

2525번-오븐 시계

#include <stdio.h>

int main()
{
    int A, B, C;
    scanf("%d %d", &A, &B);
    scanf("%d",&C);
	A += C / 60;
	B += C % 60;
    if (B >= 60) {
    	A++;
    	B -= 60;
		}
        
    if(A>=24)
    	A-=24;
    printf("%d %d", A, B);
    return 0;
    }

1002번-터렛

#include <stdio.h>
#include <math.h>
int main(void) {
    int TestTable, jo_x, jo_y, back_x, back_y, jo_to_ruu, back_to_ruu, result;
    double distanse, subtract;
    scanf("%d", &TestTable);
    while (TestTable--){
        scanf("%d %d %d %d %d %d", &jo_x, &jo_y, &jo_to_ruu, &back_x, &back_y, &back_to_ruu);
        distanse = sqrt(pow(back_x - jo_x, 2) + pow(back_y - jo_y, 2));
        subtract = jo_to_ruu > back_to_ruu ? jo_to_ruu - back_to_ruu : back_to_ruu - jo_to_ruu;
        if (distanse == 0 && jo_to_ruu == back_to_ruu)
            result = -1;
        else if (distanse < jo_to_ruu + back_to_ruu && (subtract < distanse))
            result = 2;
        else if (distanse == jo_to_ruu + back_to_ruu || distanse == subtract)
            result = 1;
        else
            result = 0;
        printf("%d\n", result);
    }
    return 0;
}

2563번-색종이

#include <stdio.h>
int main(void) {
	int arr[100][100] = { 0, };
	int x, y, result = 0;
	int t;
	scanf("%d", &t);
	for (int i = 0; i < t; i++) {
		scanf("%d %d", &x, &y);
		for (int j = 0; j < 10; j++) {
			for (int k = 0; k < 10; k++) {
				arr[x + j][y + k] = 1;
			}
		}
	}
	for (int i = 0; i < 100; i++) {
		for (int j = 0; j < 100; j++) {
			if (arr[i][j] == 1) {
				result++;
			}
		}
	}
	printf("%d", result);
	return 0;
}

---

C언어는 최악의 언어이다