프로그램 명: aaaahh
제한시간: 1 초
[요약]
N (1 <= N <= 100) 개의 시간대가 입력 예의 형식으로 주어졌을 때 겹치는 시간이 있는지를 출력하세요.
있다면 conflict, 없다면 no conflict
Elaine is excited to begin the school year|so excited, in fact, that she signed herself up to attend several
events today (This programming contest, sadly, is not one of them). She may have overdone it, though; she
didn't bother to check whether the events she signed up for have con icting times. While you're sitting here
in this contest, why not check for her?
입력
-
Each test case begins with an integer N , 1 <= N <= 100, on a line by itself denoting the number of events.
- After that follow N lines giving the start and end times of each event, in hh:mm-hh:mm 24-hour format. The end time is guaranteed to be strictly after the start time.
출력
Print out a single line that says "conflict " (no quotes) if Elaine's events have con icting times, and "no conflict" (no quotes) otherwise.
Assume that Elaine can travel around campus instantaneously, so if an event starts at the same time another event ends, the two events do not conflict.
입출력 예
입력
3
09:00-09:50
13:00-17:00
09:50-10:30
출력
no conflict
입력
2
10:00-11:00
09:00-12:00
출력
conflict
출처:standford/2010/
요약:ladown21
[질/답]
[제출 현황]
[푼 후(2)]