| Submit | All submissions | Best solutions | Back to list |
MEETING - Hands meeting |
| Wersja polska | English version |
Dla danej godziny oblicz minimalną ilość minut, jaka musi minąć, żeby wskazówki zegara się spotkały.
Wejście
Wejście składa się z nieokreślonej liczby testów. Każdy z nich zawiera z kolei dwie liczby naturalne: h i m które reprezentują godzinę startową (0<h<25, 0<=m<60).
Wyjście
Dla każdego testu wypisz minimalną ilość minut, jaka musi minąć, żeby wskazówki zegara się spotkały.
Przykład
Wejście:
3 0
12 0
17 47
15 15
8 44
13 6
Wyjście:
16
0
46
1
0
65
| Added by: | Piotr Kąkol |
| Date: | 2010-11-09 |
| Time limit: | 11.14s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: SCM qobi |
hide comments
|
|||||
|
2013-10-30 00:31:13 Piotr KÄ…kol
I've also agreed with Konstantin. As you bring that problem to a head, I'll make another version of the task in free time (not soon) with correct output and without removing this one and see what happens. |
|||||
|
2013-10-27 17:18:43 primo
I agree with @Konstantin At 8:44, the hands have just met 22 seconds ago. The next meeting will be in 64m 49s. |
|||||
|
2013-04-26 22:10:35 Piotr KÄ…kol
@GiVe_Me_TiMe - You don't seem to understand what the input for the program is. You ought to read pairs in loop waiting for EOF while you read only one, so for the sample test you have to execute your program 6 times instead of one. And please don't use multiple '?'. It's kind of childish, isn't it? |
|||||
|
2013-01-21 22:18:25 GiVe_Me_TiMe
can u provide some typical test case ?????????? |
|||||
|
2011-09-23 14:07:35 Hallvard Norheim Bø
@Piotr: Sorry, I must have mixed up before submitting, it used to be 1e-9. Works after fixing this. :/ Anyway, I found a couple of algorithms that worked (no more fmod() and round-off issues, or printf outputting -0). Last edit: 2011-09-23 15:25:51 |
|||||
|
2011-09-23 10:34:19 Piotr KÄ…kol
@hallvabo - You print "0" for all tests. I think that 65-1e9+sth (which is 10^9) will allways be negative as this sth can't be greater than 1e9. So in printf You print 0. Last edit: 2011-09-23 10:36:48 |
|||||
|
2011-09-23 01:12:18 Hallvard Norheim Bø
What's wrong with #5708944? I tested both my Python solution (AC), and my C solution (WA) at ideone.com with all 1440 possible testcases, and the results were identical. Strange. |
|||||
|
2010-11-29 20:46:33 Piotr KÄ…kol
Maybe a good idea would be making another task on Your conditions and adding it on main SPOJ? That way everybody would (?) be satisfied being able to choose the task they want. |
|||||
|
2010-11-29 16:58:13 Konstantin
well... it looks like these 3 users just keep optimizing there solutions for shorter code size. that's what I call a fair play :-) Last edit: 2010-11-29 16:59:48 |
|||||
|
2010-11-21 10:41:36 Piotr KÄ…kol
Now I understand. Hmm... it would be unfair because 3 users have done it. On the other hand, adding second similar task is also not a good idea. I agree now with Your point of view and would change tests+examples if these 3 users (or 2 of them) agreed. Or maybe You have another idea to make all satisfied? Sorry for the confusion concerning this task! |
|||||
RSS