| Submit | All submissions | Best solutions | Back to list |
|
Problem hidden on 2014-11-25 17:51:26 by Francky
CAMPANA1 - CAMPANADAS 1 |
Problem (english version) - Problema (versión en español)
The priest of a church want to know the number of times the bell will ring during a specified time interval. This interval starts on h1:m1, and ends on h2:m2; where h1:m1 is the hour-minute of beginning, and h2:m2 is hour-minute of the end.
h1:m1 and h2:m2 are in the same day, and h1:m1 < h2:m2.
El cura de una iglesia local quiere conocer exactamente cuántas veces deben sonar las campanas en un intervalo de tiempo determinado, y quiere que le desarrollemos un pequeño programa donde pueda ingresar la hora de comienzo y de final de dicho intervalo, y obtenga la cantidad de campanadas en él. (las campanas deben tocarse 1 vez en los minutos: 0, 15, 30 y 45).
h1:m1 y h2:m2 están en el mismo día, y h1:m1 < h2:m2.
Input - Entrada
The input comes as a series of intervals, each in a different line. In each line there are six integers indicating day, hour and minute of the beginning and the end of the interval (not included). The last line contains the values 0 0 0 0 0 0, indicating end of data and should not be processed.
In no case will be more than 1000 intervals in the input.
La entrada viene como una serie de intervalos, cada uno en un renglón diferente. En cada renglón vienen 4 enteros que indican hora y minuto de comienzo, y hora y minuto de final (no incluído). El último renglón contiene los valores 0 0 0 0, que indican final de datos y no deben procesarse.
En ningún caso habrá más de 1000 intervalos en la entrada.
Output - Salida
The output to show in each input case, will be an integer indicating the number of times that the bell will ring.
Como salida para cada uno de los casos de entrada, debe mostrarse un entero indicando la cantidad de campanadas de ese intervalo.
Example - Ejemplo
Input - Entrada:
8 0 8 56
7 16 8 16
0 0 0 15
0 0 0 0
Output - Salida:
4
4
1
| Added by: | Coach UTN FRSF |
| Date: | 2012-10-29 |
| Time limit: | 1s-500s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: ASM64 |
hide comments
|
2014-11-25 17:10:57 Min_25
@Francky I agree with you. (If the I/O files and time limit are not revised, it should be hidden.) |
|
|
2014-11-25 14:59:37 Francky
Description is about 6 integers per line, sample is with 4. Description doesn't mention that bell ring every quarter, isn't it ? It seems IO files are broken. It seems a trivial task. I propose to hide this task, and/or move it to tutorial. --edit--> Done. Last edit: 2014-11-25 17:52:00 |
|
|
2014-11-25 11:51:45 Min_25
Perhaps, some of the input files are broken; The last line doesn't contain "0 0 0 0". The I/O files should be fixed and all the submissions should be rejudged. Since the task is very easy (trivial), the time limit should be decreased to under or around 1s. (The current time limit is 500 seconds. Although I don't know the input file is enabled or not.) Last edit: 2014-11-25 14:56:43 |
RSS