- Please, please please, please please please please. Thanks :-)
- Could you also update the problem statement to show how to get the relocated file, thanks. --Paddy3118 04:27, 4 October 2008 (UTC)
- The file is of directed random data generated by me and to a file format that I created. Please feel free to re-host under your normal RC terms. --Paddy3118 09:40, 4 October 2008 (UTC)
- Not sure about the RC copy, but I still have the original here.
- Whoops! Must have mised that in the MediaWiki upgrade. I'll get it fixed this evening; I still have all the old files. --Short Circuit 12:36, 31 July 2009 (UTC)
Name change needed
- Yes, it's unexciting and it isn't as informative as it might be. But it does give one a much better idea of what the task is about than "Max licenses in use". That's why I consider it an improvement. If you can think of an further improvement, I welcome you to be bold and move the page again. —Underscore (Talk) 21:01, 14 February 2010 (UTC)
I agree that a serial-numbered name is bad. However, the old name has a problem; when I first saw it I assumed it was a task about implementing license restrictions, i.e. tracking the number of copies of your program running on a network. So maybe something like Text processing/Max licenses in use. —Kevin Reid 16:01, 14 February 2010 (UTC)
times THROUGH times
I noticed that most programmers did not treat the time as steady-state, but discontinous with the times being descreet only at job INs and OUTs, that is, the times --between-- INs and OUTs also exist, but are never listed, nor are the times shown as THROUGH (start) to (end). The maximum is not just AT two times, but all times in between (inclusive) those times listed.
If one looks at the actual input file, you'll see job 1837 logging at OUT starting at 08:40:40, but the next job doesn come IN until 08_40_47 (records 3577 and 3578). Gerard Schildberger 09:28, 14 March 2012 (UTC)