All submissions for this problem are available.
Its Independence day so Prateek, the captain has decided to give away free coffee. He has decided to install P coffee machines at the
cafeteria each of which can serve a person under
one minute.Now he has received the list of N person that are going to visit his cafeteria. Each person's visiting time is denoted by two integers (H,M) where H is the hour of the day of visit and M is the minute of visit in that hour.
If a person has to wait to get coffee after his arrival at the cafeteria, the person gets angry.Now he is concerned about the cost and wants to set up the minimum number of coffee machines so that
no person gets angry.Help him to find the minimum number of coffee machine required so that everyone is happy :)
First line contains t, the no of test cases. First line of each test case contains N, the number of persons to be served on that day. The next N line contain two space separated integers H and M for that particular customer.
One line for each test, a integer denoting the min
imum number of coffee machines required.
Should contain all the constraints on the input data that you may have. Format it like:
- 1 ≤ t ≤ 100
- 1 ≤ n ≤ 10000
- 0 ≤ h ≤ 23
- 0 ≤ m ≤ 59
Input: 1 7 10 20 5 40 10 20 23 11 5 50 10 30 17 12 Output: 2
|Tags||easy, hashing, learnersclub, learnersclub, sorting, ssc2016|
|Time Limit:||1 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, SCALA, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, PERL6, TEXT, SCM chicken, CLOJ, FS|
Fetching successful submissions