Guys, I really think this problem should be reformulated or taken of the book. After 20+ failed submissions, I managed to think in a specific test case:
This is the input:
1
1 A 100:00 Y
2 B 100:00 Y
3 C 100:00 Y
4 D 100:00 Y
5 E 100:00 Y
6 F 100:00 Y
7 G 100:00 Y
8 H 100:00 Y
9 I 100:00 Y
10 J ...
Search found 2 matches
- Fri Oct 14, 2016 10:11 pm
- Forum: Volume 7 (700-799)
- Topic: 790 - Head Judge Headache
- Replies: 49
- Views: 23116
- Thu Sep 29, 2016 3:04 am
- Forum: Volume 3 (300-399)
- Topic: 362 - 18,000 Seconds Remaining
- Replies: 75
- Views: 39169
Re: 362 - 18,000 Seconds Remaining
Hi dudes, remember that when you are doing a division, you are losing some data. And as we don't know which test case is The Tricky one, we should not trust so much on divisions. For example, I received 3 WA before changing a silly thing.
-> This code below was receiving WA:
printf("%d seconds\n ...
-> This code below was receiving WA:
printf("%d seconds\n ...