--- Log opened Sun Nov 02 00:00:50 2008 |
00:05 | | AnnoDomini [~farkoff@Nightstar-29220.neoplus.adsl.tpnet.pl] has quit [Quit: Why is there a jalapeno in the Aegean Sea?] |
04:24 | | Reiver [~reaverta@Nightstar-6435.xdsl.xnet.co.nz] has quit [Quit: Changing servers] |
04:24 | | Reiver [~reaverta@Admin.Nightstar.Net] has joined #Code |
04:24 | | mode/#code [+o Reiver] by ChanServ |
04:28 | | Attilla [~The.Attil@Nightstar-9469.cdif.cable.ntl.com] has quit [Ping Timeout] |
04:45 | | Vornicus [~vorn@Admin.Nightstar.Net] has quit [Quit: Leaving] |
04:45 | | gnolam [lenin@Nightstar-1382.A163.priv.bahnhof.se] has quit [Quit: Nowhere to run, nowhere to hide? Then rest easy with Cyanide.] |
04:48 | | Vornicus [~vorn@64.252.115.ns-23676] has joined #code |
04:48 | | mode/#code [+o Vornicus] by ChanServ |
06:42 | | Vornicus is now known as Vornicus-Latens |
06:45 | | Chalcedon [~Chalcedon@Nightstar-1770.ue.woosh.co.nz] has joined #code |
07:12 | | crem_ [~moo@Nightstar-28703.adsl.mgts.by] has joined #code |
07:13 | | crem [~moo@Nightstar-28703.adsl.mgts.by] has quit [Connection reset by peer] |
07:18 | | Chalcedon [~Chalcedon@Nightstar-1770.ue.woosh.co.nz] has left #code [Leaving] |
07:55 | | AnnoDomini [~farkoff@Nightstar-29220.neoplus.adsl.tpnet.pl] has joined #Code |
07:56 | | mode/#code [+o AnnoDomini] by ChanServ |
09:08 | | C_tiger [~c_wyz@Nightstar-8414.hsd1.ca.comcast.net] has quit [Ping Timeout] |
09:48 | | You're now known as TheWatcher |
10:01 | | Attilla [~The.Attil@Nightstar-9469.cdif.cable.ntl.com] has joined #code |
10:01 | | mode/#code [+o Attilla] by ChanServ |
10:36 | | gandalf54 [~gandalf54@Nightstar-10354.49-82-r.retail.telecomitalia.it] has joined #Code |
10:36 | | gandalf54 [~gandalf54@Nightstar-10354.49-82-r.retail.telecomitalia.it] has left #Code [] |
11:45 | | Vornicus-Latens [~vorn@Admin.Nightstar.Net] has quit [Ping Timeout] |
12:42 | | Attilla [~The.Attil@Nightstar-9469.cdif.cable.ntl.com] has quit [Ping Timeout] |
12:44 | | Attilla [~The.Attil@Nightstar-9469.cdif.cable.ntl.com] has joined #code |
12:44 | | mode/#code [+o Attilla] by ChanServ |
14:09 | | DBot [~Reiver@Nightstar-6435.xdsl.xnet.co.nz] has joined #Code |
14:10 | | DiceBot [~Reiver@Nightstar-6435.xdsl.xnet.co.nz] has quit [Ping Timeout] |
14:11 | | Reiver [~reaverta@Admin.Nightstar.Net] has quit [Ping Timeout] |
14:12 | | DiceBot [~Reiver@Nightstar-6435.xdsl.xnet.co.nz] has joined #Code |
14:12 | | mode/#code [+v DiceBot] by ChanServ |
14:13 | | DBot [~Reiver@Nightstar-6435.xdsl.xnet.co.nz] has quit [Ping Timeout] |
14:18 | | Reiver [~reaverta@Admin.Nightstar.Net] has joined #Code |
14:18 | | mode/#code [+o Reiver] by ChanServ |
14:24 | | DBot [~Reiver@Nightstar-6435.xdsl.xnet.co.nz] has joined #Code |
14:25 | | DiceBot [~Reiver@Nightstar-6435.xdsl.xnet.co.nz] has quit [Ping Timeout] |
14:28 | | Reiver [~reaverta@Admin.Nightstar.Net] has quit [Ping Timeout] |
14:28 | | DBot [~Reiver@Nightstar-6435.xdsl.xnet.co.nz] has quit [Ping Timeout] |
14:40 | | Reiver [~reaverta@Admin.Nightstar.Net] has joined #Code |
14:40 | | mode/#code [+o Reiver] by ChanServ |
14:41 | | ReivDamnit [~reaverta@Admin.Nightstar.Net] has joined #Code |
14:43 | | Reiver [~reaverta@Admin.Nightstar.Net] has quit [Ping Timeout] |
14:44 | | gnolam [lenin@Nightstar-1382.A163.priv.bahnhof.se] has joined #Code |
14:44 | | mode/#code [+o gnolam] by ChanServ |
14:47 | | DiceBot [~Reiver@Nightstar-6435.xdsl.xnet.co.nz] has joined #Code |
14:47 | | mode/#code [+v DiceBot] by ChanServ |
15:47 | | Vornotron [~vorn@Admin.Nightstar.Net] has joined #code |
15:48 | | Vornotron is now known as Vornicus |
16:22 | | C_tiger [~c_wyz@Nightstar-8414.hsd1.ca.comcast.net] has joined #code |
16:22 | | mode/#code [+o C_tiger] by ChanServ |
16:31 | | DBot [~Reiver@Nightstar-6435.xdsl.xnet.co.nz] has joined #Code |
16:33 | | DiceBot [~Reiver@Nightstar-6435.xdsl.xnet.co.nz] has quit [Ping Timeout] |
16:34 | | DBot is now known as DiceBot |
17:28 | | ReivDamnit [~reaverta@Admin.Nightstar.Net] has quit [Ping Timeout] |
17:30 | | DiceBot [~Reiver@Nightstar-6435.xdsl.xnet.co.nz] has quit [Ping Timeout] |
17:35 | | Reiver [~reaverta@Admin.Nightstar.Net] has joined #Code |
17:35 | | mode/#code [+o Reiver] by ChanServ |
17:51 | | DiceBot [~Reiver@Nightstar-6435.xdsl.xnet.co.nz] has joined #Code |
17:51 | | mode/#code [+v DiceBot] by ChanServ |
19:56 | <@gnolam> | http://pics.nase-bohren.de/progress-bar.jpg |
19:58 | <@AnnoDomini> | Seen it. It's still awesome, though. |
19:59 | <@gnolam> | It reminds me to redouble my efforts to convert the local student pub into a jihad-themed pub called "Allahu AqBar & Grill". |
20:22 | <@AnnoDomini> | That's a nasty pun. |
20:25 | <@gnolam> | Today's special: salami aleikum. |
20:30 | | DiceBot [~Reiver@Nightstar-6435.xdsl.xnet.co.nz] has quit [Ping Timeout] |
20:33 | | Reiver [~reaverta@Admin.Nightstar.Net] has quit [Ping Timeout] |
20:39 | | DiceBot [~Reiver@Nightstar-6435.xdsl.xnet.co.nz] has joined #Code |
20:39 | | mode/#code [+v DiceBot] by ChanServ |
20:39 | | Reiver [~reaverta@Admin.Nightstar.Net] has joined #Code |
20:39 | | mode/#code [+o Reiver] by ChanServ |
20:39 | <@AnnoDomini> | gnolam: http://pics.nase-bohren.de/turist.jpg <- This from Poland? |
20:52 | <@gnolam> | You tell me. |
20:53 | <@AnnoDomini> | The phonetics look like Polish. |
21:06 | | Vornicus is now known as Finerty |
21:21 | | AnnoDomini [~farkoff@Nightstar-29220.neoplus.adsl.tpnet.pl] has quit [Ping Timeout] |
21:25 | | AnnoDomini [~farkoff@Nightstar-29569.neoplus.adsl.tpnet.pl] has joined #Code |
21:25 | | mode/#code [+o AnnoDomini] by ChanServ |
22:01 | | Chalcedon [~Chalcedon@Nightstar-1770.ue.woosh.co.nz] has joined #code |
22:28 | <@Consul> | Do I have to register with Project Euler to get to the answers? |
22:30 | < Finerty> | You don't see the answer until you solve the problem; I think you need to register to do that. |
22:30 | < Finerty> | to put that you've solved it, that is |
22:31 | <@Consul> | I won't know if I have until I know the answer, though. |
22:32 | < Finerty> | Register, type in your suspected answer, and it will tell you if you're right or not. |
22:32 | < Finerty> | There is, as far as I'm aware, no penalty for a wrong answer... but what problem is it? |
22:32 | <@Consul> | The first one. |
22:32 | <@Consul> | I'm just using PE for learning Python/. |
22:33 | < Finerty> | Okay. PM me your answer and I'll tell you if you've got it. |
22:33 | <@Consul> | So for me, getting the right answer is more for "okay, I got the language right" then "okay, I solved that problem right". |
22:33 | <@Consul> | I just registered. |
22:33 | | * Finerty also stoatloafs Chalcy. |
22:34 | <@Consul> | I also got it wrong, so I guess I need to check those references again./ |
22:34 | < Finerty> | what was your answer? |
22:35 | <@GeekSoldier> | if you get it wrong, it tells you. If you get about 5 incorrect responses on the same question within a few minutes, it freezes the question for a while. |
22:35 | <@GeekSoldier> | To avoid brute forcing, I suppose. |
22:35 | <@Consul> | I'm guessing I constructed my if statement incorrectly. |
22:36 | < Finerty> | Are you accidentally double counting multiples of 15? are you including 1000? Both of those are wrong |
22:37 | <@Consul> | Ooh, good point on that first one... |
22:38 | <@Consul> | No, it shouldn't be double-counting numbers divisible by both... |
22:39 | < Finerty> | pastebin your code. You're talking to at least one person who is an Expert at python. |
22:39 | <@GeekSoldier> | At least one expert and one proficient dabbler. |
22:40 | | mode/#code [+o Finerty] by GeekSoldier |
22:40 | <@Consul> | Well, I guess the whole point is to learn Python... I'm going to try a few more things here really quick... |
22:40 | | mode/#code [+oo Chalcedon crem_] by Finerty |
22:41 | | * GeekSoldier searches for an HP 50G. |
22:45 | <@Finerty> | and at that number theory. |
22:46 | <@Consul> | Okay, it wants all numbers that are multiples of 3 or 5 up to 1000 summed, right? |
22:46 | <@Finerty> | Right. |
22:47 | <@Finerty> | Not including 1000 |
22:48 | <@Consul> | http://rafb.net/p/tJCL9s20.html -- I'm sure I'm about to really embarrass myself, but hey... |
22:48 | <@Finerty> | that's how I'd do it. odd that it's not working. |
22:48 | <@GeekSoldier> | it's counting multiples of 15 twice. |
22:49 | <@Finerty> | No it's not |
22:49 | <@Consul> | I get 233168 as the answer. |
22:49 | <@Finerty> | That's the right answer. |
22:49 | <@GeekSoldier> | Correct. |
22:49 | <@GeekSoldier> | I see. |
22:49 | <@Consul> | PE disagreed. |
22:49 | <@Finerty> | that's odd. |
22:50 | <@Consul> | Just out of curiosity, is there a better algorithm? |
22:50 | <@GeekSoldier> | It is correct... |
22:50 | <@Finerty> | Consul: there's a way of doing it without any code... |
22:50 | <@Consul> | Huh? Doesn't that defeat the purpose of the exercise? |
22:51 | <@GeekSoldier> | not really. there are plenty of submissions that were done on paper. |
22:51 | <@Finerty> | Indeed, a good many of these I could do without code. |
22:52 | <@Consul> | Oh, hey... |
22:52 | <@Consul> | I included 1000 by accident the first time. |
22:52 | <@Consul> | It accepted it now. |
22:53 | <@GeekSoldier> | Man, I miss calculators with RPN. |
22:53 | <@Finerty> | I wouldn't necessarily want to, but I could. This one, it's (3 + 5 + 6 + 9 + 10 + 12 + 15) * 66 + 7 * 15 * triangle(65) + 993 + 995 + 996 + 999 |
22:56 | <@GeekSoldier> | heh, wow. |
22:56 | <@GeekSoldier> | I'll stick with the Python or J solution. |
22:57 | <@Consul> | Ooh, now I get to come up with a slick Fibonacci function. :-) |
22:57 | <@McMartin> | Problem. You wrote 'The long of longcat is long' : but that is a very peculiar property value, and ought to be something more definite and explicit. |
22:57 | <@GeekSoldier> | Damn, I need to bring my server up so that I can access all my old PE files. |
22:59 | <@Consul> | Can Python do recursive functions? |
23:00 | <@Finerty> | Consul: yes. |
23:00 | <@Consul> | Cool, thanks. |
23:01 | <@Finerty> | print sum(k for k in xrange(1000) if k % 3 == 0 or k % 5 == 0) # this by the way is my solution to number 1. |
23:02 | <@GeekSoldier> | that's about what I had, too. |
23:02 | <@Finerty> | mmm-mm-mmm, generators are tasty. |
23:02 | <@Consul> | Ooh, see, that's handy language stuff I'd like to know. |
23:04 | <@Consul> | okay, does problem 2 not want the sum to exceed 4 million, or the final number of the sequence being summed to not exceed that? |
23:04 | <@GeekSoldier> | the latter. |
23:04 | <@Consul> | Okay, thanks |
23:04 | <@Consul> | This is gonna be a huge number. |
23:04 | <@Finerty> | No it's not. |
23:05 | <@Finerty> | If you're using a non-memoized recursive function though it will be a pain. |
23:05 | <@GeekSoldier> | think about how rapidly the fib sequence gets larger. |
23:05 | <@Consul> | Well, not "current national debt" huge, but not small. |
23:06 | <@Consul> | Hrm, good point. |
23:06 | <@McMartin> | Geek: Exponential. |
23:06 | <@McMartin> | O(2^n). |
23:07 | | AnnoDomini [~farkoff@Nightstar-29569.neoplus.adsl.tpnet.pl] has quit [Quit: Gnothi seauton, malákas.] |
23:08 | | EvilDarkLord [~jjlehto3@Nightstar-9591.cs.hut.fi] has joined #code |
23:08 | | mode/#code [+o EvilDarkLord] by ChanServ |
23:10 | <@EvilDarkLord> | I occasionally see files stored in paths like /media/images/1000000/10003000/10003721.gif . Is this necessary for performance in modern file systems? |
23:10 | <@Finerty> | EvilDarkLord: File systems can be slow at finding files in very popular directories. |
23:11 | <@EvilDarkLord> | Finerty: Okay. What causes this? |
23:13 | <@Finerty> | For each file you have to examine the directory's node, then hunt up the node for each file from there, open it up, examine the title, close the node... |
23:14 | <@gnolam> | Shouldn't be an issue in any kind of modern file system. |
23:14 | <@gnolam> | Hashing, etc. |
23:15 | <@gnolam> | It'll make /listing all the files/ within slow though. |
23:17 | <@Finerty> | Or doing any globbing. |
23:17 | <@EvilDarkLord> | Err, globbing? |
23:17 | <@Finerty> | globbing: use of * and ? and others to list multiple files that match certain patterns |
23:18 | <@Finerty> | From another channel: <ToxicFrog> '*' is anything, '?' is any one character. Thus 'cp *.gm /foo' will copy all files ending in '.gm' in the current directory, and 'cp ???.gm /foo' copies only those with exactly three characters before the extension. |
23:22 | | Chalcedon [~Chalcedon@Nightstar-1770.ue.woosh.co.nz] has quit [Quit: Leaving] |
23:23 | <@ToxicFrog> | EvilDarkLord: generally, when I see filenames like that, they're from a camera or whatever doing autogenerated names |
23:25 | <@EvilDarkLord> | The only thing I intend to use these file names for is one-at-a-time image display on a media server. Does it offer any significant benefit to use small directories in a case like that? |
23:28 | <@EvilDarkLord> | The assumption is that there will be about 500,000 different directories all told. |
23:32 | | You're now known as TheWatcher[T-2] |
23:33 | <@ToxicFrog> | That's rather a lot. |
23:35 | <@EvilDarkLord> | This is true. If you think I'm Doing It Wrong, I'd be very happy to take advice. |
23:37 | | You're now known as TheWatcher[zZzZ] |
23:43 | | Serah [~Z@87.72.35.ns-26506] has quit [Killed (NickServ (GHOST command used by ZLOK))] |
23:43 | | ZLOK [~Z@87.72.35.ns-26506] has joined #Code |
23:44 | <@ToxicFrog> | I have no idea. I'm not sure if that actually is a lot. |
23:44 | <@ToxicFrog> | It's not something I've looked into before. |
23:44 | <@McMartin> | Efficiency is nothing until you can prove you don't have it, etc. |
23:45 | <@McMartin> | I'd say give it a shot and see how it goes |
23:45 | <@McMartin> | If it gets slow, fabbing directories out of the synthetic filenames should be very easy. |
23:51 | <@McMartin> | There. Lolbugs: http://www.stanford.edu/~mcmartin/misc/lolbugs.txt |
--- Log closed Mon Nov 03 00:00:02 2008 |