15059

백준 알고리즘/Lang-C | C++

[백준/C] 15080번 Every Second Counts

백준 온라인 저지 / 15080번 Every Second Counts https://www.acmicpc.net/problem/15080 15080번: Every Second Counts Input consists of two lines: the first contains the start time and the second contains the end time for a single taxi ride. Each time is of the form hh : mm : ss, giving the hour, minute and seconds. Meredith uses a 24 hour clock, with 0 : 0 : 0 representi www.acmicpc.net 사용언어 : C (C99) 알고리즘 ..

백준 알고리즘/Lang-C | C++

[백준/C] 15059번 Hard choice

백준 온라인 저지 / 15059번 Hard choice https://www.acmicpc.net/problem/15059 15059번: Hard choice The first line contains three integers Ca, Ba and Pa (0 ≤ Ca, Ba, Pa ≤ 100), representing respectively the number of meals available for chicken, beef and pasta. The second line contains three integers Cr, Br and Pr (0 ≤ Cr, Br, Pr ≤ 100), indicati www.acmicpc.net 사용언어 : C (C99) 알고리즘 : 수학, 구현 C 코드 1. 문제 정리 장..

Jongung
'15059' 태그의 글 목록
상단으로

티스토리툴바