2012-01-10T00:01:45 *** srgpqt has quit IRC (Quit: Lost terminal) 2012-01-10T00:02:22 *** McLeopold has quit IRC (Quit: Ex-Chat) 2012-01-10T00:07:54 *** Areks has joined #aichallenge 2012-01-10T00:24:59 *** Fandekasp has joined #aichallenge 2012-01-10T00:28:55 *** dorisabayon has quit IRC (Ping timeout: 276 seconds) 2012-01-10T00:49:18 http://www.youtube.com/watch?feature=player_embedded&v=9Wq5MHIRWqQ 2012-01-10T00:49:22 that's amazing 2012-01-10T01:04:07 *** pairofdice has joined #aichallenge 2012-01-10T01:05:42 hrmpf 2012-01-10T01:05:51 sweet. 2012-01-10T01:18:18 *** Areks has quit IRC (Read error: Connection reset by peer) 2012-01-10T01:21:29 here's my p78 solution: http://codepad.org/Vwu0eTBG 2012-01-10T01:21:33 *** Chris_0076 has joined #aichallenge 2012-01-10T01:21:48 *** thestinger has quit IRC (Quit: sleep) 2012-01-10T01:24:00 *** deltree_ has quit IRC (Quit: ChatZilla 0.9.88-rdmsoft [XULRunner 1.9.0.17/2009122204]) 2012-01-10T01:27:45 pe for everyone 2012-01-10T01:39:39 *** phillijw_ has joined #aichallenge 2012-01-10T01:39:56 pe? 2012-01-10T01:42:08 *** phillijw has quit IRC (Ping timeout: 240 seconds) 2012-01-10T01:42:52 pe, http://projecteuler.net 2012-01-10T01:44:17 *** Areks has joined #aichallenge 2012-01-10T01:44:56 *** sashaSochka has joined #aichallenge 2012-01-10T01:55:48 cool 2012-01-10T01:55:54 i'll have to try it at some point 2012-01-10T01:56:48 *** replore has joined #aichallenge 2012-01-10T01:58:24 *** Palmik has joined #aichallenge 2012-01-10T02:07:13 hrm http://www.catb.org/hacker-emblem/ 2012-01-10T02:08:54 !ping 2012-01-10T02:09:06 oh. doorbot dead? 2012-01-10T02:10:59 In addition to game of life, it looks like a position in a game of go 2012-01-10T02:29:21 *** dr- has quit IRC (Ping timeout: 240 seconds) 2012-01-10T02:33:55 *** Kurnevsky has joined #aichallenge 2012-01-10T02:51:06 real steel that was interesting 2012-01-10T02:52:04 *** epicmonkey has joined #aichallenge 2012-01-10T02:57:22 ooh, the filmed the reasure island 2012-01-10T02:57:24 i wonder 2012-01-10T02:57:28 ^.^ 2012-01-10T02:57:42 whops wrong channel. sorry fellas 2012-01-10T02:57:50 i've been talkign in wrong channel all along 2012-01-10T03:00:32 No no, this is the right channel. 2012-01-10T03:03:42 *** epicmonkey has quit IRC (Ping timeout: 260 seconds) 2012-01-10T03:09:32 haha 2012-01-10T03:09:38 fair enough :) 2012-01-10T03:21:41 *** sigh has joined #aichallenge 2012-01-10T03:24:54 *** dorisabayon has joined #aichallenge 2012-01-10T03:28:35 *** Fandekasp has quit IRC (Ping timeout: 252 seconds) 2012-01-10T03:29:45 *** Blkt has joined #aichallenge 2012-01-10T03:30:54 good morning everyone 2012-01-10T03:32:29 FizzBuzz 2012-01-10T04:13:02 *** amstan has quit IRC (Quit: Konversation terminated!) 2012-01-10T04:36:41 *** ikaros has joined #aichallenge 2012-01-10T04:48:09 *** pairofdice has quit IRC (Read error: Operation timed out) 2012-01-10T04:49:11 *** pairofdice has joined #aichallenge 2012-01-10T04:53:52 *** X-Scale has quit IRC (Remote host closed the connection) 2012-01-10T04:56:43 *** dorisabayon has quit IRC (Ping timeout: 276 seconds) 2012-01-10T05:03:40 *** replore has quit IRC (Remote host closed the connection) 2012-01-10T05:05:55 *** amstan_ has joined #aichallenge 2012-01-10T05:05:55 *** ChanServ sets mode: +o amstan_ 2012-01-10T05:11:35 *** amstan__ has joined #aichallenge 2012-01-10T05:11:36 *** ChanServ sets mode: +o amstan__ 2012-01-10T05:11:47 *** amstan_ has quit IRC (Read error: No route to host) 2012-01-10T05:16:02 *** mikewintermute has joined #aichallenge 2012-01-10T05:17:07 *** amstan has joined #aichallenge 2012-01-10T05:17:07 *** ChanServ sets mode: +o amstan 2012-01-10T05:17:09 *** Garf has joined #aichallenge 2012-01-10T05:17:11 *** amstan__ has quit IRC (Read error: Connection reset by peer) 2012-01-10T05:22:41 *** ziro`_ has joined #aichallenge 2012-01-10T05:22:50 gutted I missed the ant challenge :( 2012-01-10T05:23:15 *** amstan has quit IRC (Ping timeout: 240 seconds) 2012-01-10T06:02:48 *** pairofdice has quit IRC (Read error: Operation timed out) 2012-01-10T06:05:17 *** pairofdice has joined #aichallenge 2012-01-10T06:21:59 think i'm gona try replicating it for fun :D 2012-01-10T06:31:38 maybe some http based thing 2012-01-10T06:33:19 ziro`_: there are tcp servers enabling you to run your bot against others with a local client. you could also download some of the released source code for the top bots and run against those locally. 2012-01-10T06:33:41 :) thanks 2012-01-10T06:42:38 *** mcstar has joined #aichallenge 2012-01-10T06:50:57 it's pretty easy to get running actually 2012-01-10T06:52:18 i havent run in months 2012-01-10T06:52:28 winter is a downtime for me 2012-01-10T06:52:38 :P 2012-01-10T06:52:52 i rode my bike to uni today, wasn't as easy as at the end of last year 2012-01-10T06:52:54 too lazy lately 2012-01-10T06:57:50 i bet you read some haskell, thats why 2012-01-10T06:58:14 Hasmilk 2012-01-10T06:58:21 i measured my weight last week, im 93 kgs! 2012-01-10T06:58:30 i couldnt believe the scale 2012-01-10T06:58:44 i wonder where that weight is 2012-01-10T07:01:47 anyway, ive got to find a way to motivate myself to do regular exercises 2012-01-10T07:02:01 That is the question 2012-01-10T07:02:39 pairofdice: do you exercise? 2012-01-10T07:04:24 soft spot? 2012-01-10T07:05:03 Once in a while 2012-01-10T07:06:03 I weight less than 70 so no great issues there 2012-01-10T07:06:06 kg 2012-01-10T07:06:37 im not overweight either, i really wonder where that weight is 2012-01-10T07:06:44 Ask Higgs 2012-01-10T07:06:52 hm 2012-01-10T07:06:58 funny 2012-01-10T07:07:00 really 2012-01-10T07:07:19 anyway, my ankles feel it nevertheless 2012-01-10T07:07:32 but i still found running the most motivating exercise so far 2012-01-10T07:07:40 i incredibly hate weigth lifting 2012-01-10T07:07:55 i find cycling boring 2012-01-10T07:08:09 but running is great 2012-01-10T07:08:21 Cyclings not boring if you're going somewhere, but cycling on a stand is boring. 2012-01-10T07:08:53 not on a stand 2012-01-10T07:09:01 but im considerng buying one 2012-01-10T07:09:02 Cycling in the winter is anything but boring 2012-01-10T07:09:11 isnt it great, you can watch something, and still peadl? 2012-01-10T07:09:48 riding is fun when you have cool shit to look at 2012-01-10T07:09:52 it takes too much time to tire me down... 2012-01-10T07:09:59 like 5km each way to uni is on a bike path next to the water 2012-01-10T07:10:07 ride harder 2012-01-10T07:10:16 go tackle a mountain 2012-01-10T07:10:28 best thing is, what goes up must come down, weeeeeeeeeeeeeeeeeeeeee 2012-01-10T07:10:30 hills kill me 2012-01-10T07:10:32 Problem with my stand, is that I can't watch anything on TV either, it's too loud 2012-01-10T07:10:47 Jak_o_Shadows: is it old? 2012-01-10T07:10:51 hills kill me too 2012-01-10T07:10:56 but i'm slowly getting better at them 2012-01-10T07:12:21 mcstar: Not old, it uses a fan thing for resistance, and the bike is old. If i tightened it up properly it might be quieter, but still really loud. 2012-01-10T07:12:43 Noise cancelling headphones? :) 2012-01-10T07:12:51 or simply headphones 2012-01-10T07:12:58 or earbud 2012-01-10T07:13:02 Probably not enough 2012-01-10T07:13:11 i guess he tried 2012-01-10T07:13:42 Nowhere near enough. I should try to figure out how to make it have more resistance. 2012-01-10T07:14:09 afaik today's bikes use magnetic resistance 2012-01-10T07:14:21 i think thats totally noiseless 2012-01-10T07:14:45 whats the proper name of this stand-bike? 2012-01-10T07:15:09 we call it room-bicycle, but that wont work in english 2012-01-10T07:15:38 Yeah, that would be nice. Name = really cheap triangle one that you clamp a normal bike into. I once tried hooking it up to a drill motor, that sort of worked. 2012-01-10T07:16:02 hah 2012-01-10T07:17:08 they seem to call what i meant stationary bicycles 2012-01-10T07:17:42 Yeah, a proper exercise bike is much nicer, but i'm not serious enough for that. 2012-01-10T07:18:42 i guess a good one that wont break in a week is not that cheap, so id use it if i bought it 2012-01-10T07:21:15 Oh yeah, I should definitely use mine more. It's just that i'm not that fit, I get bored easily while staring at nothing, and mosquitos come out by the time it's cooled down enough outside to use it. 2012-01-10T07:22:14 *** Kurnevsky has quit IRC (Quit: Instantbird 1.0) 2012-01-10T07:27:32 *** ziro`_ has quit IRC (Quit: ziro`_) 2012-01-10T07:29:02 hydrocortosine creame dude 2012-01-10T07:29:08 makes the itching disappear 2012-01-10T07:29:21 1% pharmacy only medicine :) 2012-01-10T07:30:02 *** Jak_o_Shadows has quit IRC (Remote host closed the connection) 2012-01-10T07:30:14 *** ziro`_ has joined #aichallenge 2012-01-10T07:30:42 lol? 2012-01-10T07:38:21 nah i'm serious 2012-01-10T07:38:28 it's my magical mossie cure 2012-01-10T07:42:42 ok, but i still dont know whatcha talking 'bout 2012-01-10T07:42:59 what itching? what mossie? 2012-01-10T07:43:49 mosquitoe 2012-01-10T07:43:51 s 2012-01-10T07:44:29 ah 2012-01-10T07:44:32 kk 2012-01-10T07:45:03 i bought some kind liquid-vaporizer, its crazy 2012-01-10T07:45:24 i turn it on, and after 10 minutes the 'mossies' start to fall from the air 2012-01-10T07:45:36 its raining mossies 2012-01-10T07:46:28 my problem wasnt really with the "bites" 2012-01-10T07:46:48 i just cant sleep if they keep hovering around my head 2012-01-10T07:46:58 so my other solution was -37db earplugs 2012-01-10T07:53:01 i started exploring an uncharted(for me) part of youtube 2012-01-10T07:53:20 there are some ladies with great aerobic/workout videos 2012-01-10T07:53:31 so much fun to watch them 2012-01-10T07:54:07 Chica bomb 2012-01-10T08:03:22 "This Porn has good Music!" 2012-01-10T08:03:44 i see this comment quite frequently by music videos 2012-01-10T08:04:20 The chew Fu remix is better 2012-01-10T08:04:47 (has no guy) 2012-01-10T08:05:09 haha 2012-01-10T08:05:11 on itz 2012-01-10T08:13:47 *** ziro`_ has quit IRC (Quit: ziro`_) 2012-01-10T08:15:04 pairofdice: http://www.youtube.com/watch?v=5VGIsSfMo6A&feature=related no video, but great remix 2012-01-10T08:15:24 once i had it on loop.. 2012-01-10T08:20:25 *** u_ has joined #aichallenge 2012-01-10T08:24:31 *** ziro`_ has joined #aichallenge 2012-01-10T08:28:34 *** sigh has quit IRC (Remote host closed the connection) 2012-01-10T08:30:39 *** ziro`_ has quit IRC (Quit: ziro`_) 2012-01-10T08:33:57 f 2012-01-10T08:34:09 this is hard 2012-01-10T08:35:43 *** sashaSochka has quit IRC (Quit: Page closed) 2012-01-10T08:41:36 whoa http://www.xlsport.hu/Video-Brock-Lesnar-vs-Alistair-Overeem-UFC-141- 2012-01-10T08:41:44 just whoa 2012-01-10T08:42:02 i didnt think 2 years ago that overeem gonna be so good 2012-01-10T08:44:52 *** foRei has joined #aichallenge 2012-01-10T08:46:20 *** Fandekasp has joined #aichallenge 2012-01-10T08:47:58 *** Kurnevsky has joined #aichallenge 2012-01-10T09:18:14 *** ronchaine has joined #aichallenge 2012-01-10T09:30:07 *** dorisabayon has joined #aichallenge 2012-01-10T09:31:01 *** Fandekasp has quit IRC (Ping timeout: 248 seconds) 2012-01-10T09:36:36 *** sigh has joined #aichallenge 2012-01-10T09:38:42 *** dmj111` has joined #aichallenge 2012-01-10T09:39:31 *** ztfw` has joined #aichallenge 2012-01-10T09:40:01 *** Palmik_ has joined #aichallenge 2012-01-10T09:40:04 *** jbroman_ has joined #aichallenge 2012-01-10T09:40:05 *** u_ has quit IRC (Ping timeout: 240 seconds) 2012-01-10T09:40:05 *** jmcarthur has quit IRC (Ping timeout: 240 seconds) 2012-01-10T09:40:05 *** mleise has quit IRC (Ping timeout: 240 seconds) 2012-01-10T09:40:05 *** dmj111 has quit IRC (Ping timeout: 240 seconds) 2012-01-10T09:40:06 *** Palmik has quit IRC (Ping timeout: 240 seconds) 2012-01-10T09:40:06 *** jbroman has quit IRC (Ping timeout: 240 seconds) 2012-01-10T09:40:14 *** mleise has joined #aichallenge 2012-01-10T09:40:35 *** ztfw has quit IRC (Ping timeout: 240 seconds) 2012-01-10T09:41:07 *** mikewintermute has quit IRC (Quit: mikewintermute) 2012-01-10T09:41:35 *** alehorst has quit IRC (Ping timeout: 240 seconds) 2012-01-10T09:41:41 *** jmcarthur has joined #aichallenge 2012-01-10T09:41:43 *** Areks has quit IRC (Ping timeout: 268 seconds) 2012-01-10T09:43:45 *** mikewintermute has joined #aichallenge 2012-01-10T09:45:02 *** u_ has joined #aichallenge 2012-01-10T09:45:29 *** Palmik_ is now known as Palmik 2012-01-10T09:45:59 *** Palmik is now known as Guest16541 2012-01-10T09:48:28 *** mikewintermute has quit IRC (Client Quit) 2012-01-10T09:49:08 *** mikewintermute has joined #aichallenge 2012-01-10T09:49:21 *** Guest16541 is now known as Palmik_ 2012-01-10T09:52:47 *** Palmik_ has quit IRC (Remote host closed the connection) 2012-01-10T09:56:09 *** ziro`_ has joined #aichallenge 2012-01-10T09:58:29 *** alehorst has joined #aichallenge 2012-01-10T10:00:18 *** Chris_0076 has quit IRC (Remote host closed the connection) 2012-01-10T10:01:55 *** Palmik has joined #aichallenge 2012-01-10T10:02:31 Fatal error: Allowed memory size of 262144 bytes exhausted (tried to allocate 122880 bytes) in /web/aktivsport.hu/aktivsport.hu/www/index.php on line 150 2012-01-10T10:09:04 *** g0llum has joined #aichallenge 2012-01-10T10:09:34 *** TheLinker has joined #aichallenge 2012-01-10T10:18:22 *** ikaros has quit IRC (Quit: Ex-Chat) 2012-01-10T10:18:57 *** jbroman_ is now known as jbroman 2012-01-10T10:20:06 *** ikaros has joined #aichallenge 2012-01-10T10:35:53 *** egreavette has joined #aichallenge 2012-01-10T10:36:48 *** dapplegate has joined #aichallenge 2012-01-10T10:52:06 *** egreavette has quit IRC (Quit: Page closed) 2012-01-10T10:52:16 *** thestinger has joined #aichallenge 2012-01-10T10:54:30 *** sigh has quit IRC (Remote host closed the connection) 2012-01-10T11:07:16 *** ztfw` is now known as ztfw 2012-01-10T11:07:22 *** dvladim has joined #aichallenge 2012-01-10T11:08:02 *** ztfw has quit IRC (Read error: Connection reset by peer) 2012-01-10T11:09:24 *** ztfw has joined #aichallenge 2012-01-10T11:13:14 *** rofer has quit IRC (Ping timeout: 244 seconds) 2012-01-10T11:13:38 *** ztfw has quit IRC (Ping timeout: 240 seconds) 2012-01-10T11:14:36 *** g0llum has quit IRC (Read error: Connection reset by peer) 2012-01-10T11:16:48 *** mikewintermute has quit IRC (Quit: mikewintermute) 2012-01-10T11:16:58 *** smjms has joined #aichallenge 2012-01-10T11:29:51 *** rofer has joined #aichallenge 2012-01-10T11:30:41 *** Fandekasp has joined #aichallenge 2012-01-10T11:30:48 *** dr- has joined #aichallenge 2012-01-10T11:31:33 *** dorisabayon has quit IRC (Ping timeout: 252 seconds) 2012-01-10T11:36:41 *** dvladim has quit IRC (Ping timeout: 240 seconds) 2012-01-10T11:41:03 *** ziro`_ has quit IRC (Quit: ziro`_) 2012-01-10T11:47:57 *** iglo has joined #aichallenge 2012-01-10T12:02:08 *** JorgeB has joined #aichallenge 2012-01-10T12:14:08 *** Fandekasp has quit IRC (Ping timeout: 240 seconds) 2012-01-10T12:17:41 *** thestinger has quit IRC (Quit: WeeChat 0.3.6) 2012-01-10T12:30:37 ruh roh. tron.aichallenge.org is 403 2012-01-10T12:31:44 *** Blkt has quit IRC (Quit: ERC Version 5.3 (IRC client for Emacs)) 2012-01-10T12:33:12 *** ziro`_ has joined #aichallenge 2012-01-10T12:41:59 *** ziro`_ has quit IRC (Quit: ziro`_) 2012-01-10T12:49:18 *** thestinger has joined #aichallenge 2012-01-10T13:10:57 btw, my projecteuler friend key: 828895483464_497441dda625741a30dc754b0ebe43b9 2012-01-10T13:11:03 there used to be public profiles 2012-01-10T13:13:03 *** mviel__ has quit IRC (Quit: Leaving) 2012-01-10T13:14:21 gotcha 2012-01-10T13:23:09 that's it, I am making a script to change "project euler" to "project oiler (euler)" 2012-01-10T13:23:17 so I stop saying it wrong in my head 2012-01-10T13:23:23 haha 2012-01-10T13:26:24 it would be better if the site was called Gauss right? 2012-01-10T13:27:15 personally, im glad they didnt name it after some Indian mathematician 2012-01-10T13:28:19 indian names are at least obviously pronouncable, just really long 2012-01-10T13:29:12 i dont have a problem with euler, since i heard it said out loud the first time 2012-01-10T13:29:18 *** sashaSochka has joined #aichallenge 2012-01-10T13:29:22 i was surprised, but it was ok 2012-01-10T14:02:08 *** kapoc has joined #aichallenge 2012-01-10T14:03:27 #76 in 30 secs 2012-01-10T14:03:46 a bit too much 2012-01-10T14:03:48 ha! 75 in 35ms! 2012-01-10T14:04:16 totally different problems right? 2012-01-10T14:04:25 i havent solved 75 yet 2012-01-10T14:04:39 only ~9500 have! 2012-01-10T14:04:47 I'm l33t 2012-01-10T14:05:09 5235 2012-01-10T14:05:26 well without looking stuff up on the net my first solution took 490 seconds 2012-01-10T14:05:52 mleise: 75 was solved by 5k people 2012-01-10T14:06:01 oh right, even better ;) 2012-01-10T14:06:13 40 doesn't seem too hard by like pencil and paper 2012-01-10T14:06:23 i'm only missing 2 <= 50 2012-01-10T14:11:10 *** kire has joined #aichallenge 2012-01-10T14:12:34 a1k0n: thanks for the tip, done 2012-01-10T14:13:18 already? :( 2012-01-10T14:13:27 let digits = concat [show n|n<-[1..]] in foldl (*) 1 $ map digitToInt [digits !! (10^i-1) | i<-[0..6]] 2012-01-10T14:14:08 haha. that's not pencil and paper, that's cheating with haskell 2012-01-10T14:14:41 XD 2012-01-10T14:16:28 mcstar: you can even cut a few characters off that :P 2012-01-10T14:17:17 product? 2012-01-10T14:17:27 and use map instead of the first list comprehension 2012-01-10T14:17:28 ill get used to it 2012-01-10T14:18:29 thestinger: you want to keep all those damn list comprehensions to yourself right? 2012-01-10T14:18:48 they're an unsustainable resource 2012-01-10T14:19:22 map is faster in ghci anyway :) 2012-01-10T14:20:10 anyway I really wish tuple unpacking in python was lazy with generators 2012-01-10T14:20:19 the motivation behind the concant and the comprehension is that i dont "feel" the lazyness yet 2012-01-10T14:20:39 sort of weird for me with map 2012-01-10T14:20:48 i map on something concrete 2012-01-10T14:20:49 map is lazy in python3 :) 2012-01-10T14:20:54 not on something lazy 2012-01-10T14:21:07 here too, i just use map a lot in cl 2012-01-10T14:21:19 well, everything is lazy in haskell 2012-01-10T14:21:23 and i have to ge tused to the concept that its lazy here 2012-01-10T14:21:27 yes 2012-01-10T14:21:32 coding with generators/iterators in python gets annoying 2012-01-10T14:21:34 even `se` 2012-01-10T14:21:37 even `seq` 2012-01-10T14:29:36 *** Redgis has joined #aichallenge 2012-01-10T14:32:34 oh.... I don't need to get divisors from the powerset of the prime factors 2012-01-10T14:32:53 can just use the multiplicity of each prime factor 2012-01-10T14:33:15 that explains why this was too slow 2012-01-10T14:33:43 :) 2012-01-10T14:33:55 that was needed in some early problem 2012-01-10T14:34:09 I managed without it :P 2012-01-10T14:34:27 well, I can get prime factors really fast 2012-01-10T14:34:45 but getting divisors from that was too slow :) 2012-01-10T14:35:51 which one are you doing? 2012-01-10T14:37:22 not sure, but I was stuck on a few due to this being too slow 2012-01-10T14:37:40 prime factorization? 2012-01-10T14:37:55 no, getting divisors from the prime factors 2012-01-10T14:38:04 I know how to do it properly now 2012-01-10T14:38:19 i have a bunch of code from years ago for this that i can't understand anymore 2012-01-10T14:38:34 *** Paradoxial has joined #aichallenge 2012-01-10T14:38:37 something about searching for tau 2012-01-10T14:39:05 *** Paradoxial has quit IRC (Read error: Connection reset by peer) 2012-01-10T14:39:34 *** Paradoxiality has joined #aichallenge 2012-01-10T14:39:54 *** Paradoxial has joined #aichallenge 2012-01-10T14:42:59 *** dvladim has joined #aichallenge 2012-01-10T14:44:35 77 done 2012-01-10T14:45:08 i need to solve 78 2012-01-10T14:45:12 i must 2012-01-10T14:46:11 *** amstan has joined #aichallenge 2012-01-10T14:46:11 *** ChanServ sets mode: +o amstan 2012-01-10T14:47:37 mcstar: lol, my solution to 77 was pretty silly 2012-01-10T14:47:51 just a line of lazily coded python 2012-01-10T14:47:59 using functions I had coded already 2012-01-10T14:48:29 main = do print $ head $ [n|n<-[10..],(solve n $ primesLessThan n)>5000] 2012-01-10T14:48:31 where primes = [n|n<-[2..],isPrime n] 2012-01-10T14:48:33 primesLessThan n = takeWhile ( solve was used in a couple of problems by now 2012-01-10T14:50:17 what is it? 2012-01-10T14:50:21 I used n_partitions for that 2012-01-10T14:50:44 kinda 2012-01-10T14:50:52 but its my recursive oneliner 2012-01-10T14:51:00 not very sophisticated 2012-01-10T14:51:11 i have to do better for 78 2012-01-10T14:51:18 next(i for i in count() if n_partitions(i, primes_below(i)) > 5000)) 2012-01-10T14:51:31 *** kire has quit IRC (Remote host closed the connection) 2012-01-10T14:52:26 count()? 2012-01-10T14:52:35 like range, without an end 2012-01-10T14:52:40 ah 2012-01-10T14:52:44 count(start), count(start, stop) 2012-01-10T14:52:47 I mean 2012-01-10T14:52:51 count(start, step) 2012-01-10T14:53:17 so an infinite list basically (infinite generator) 2012-01-10T14:53:21 next() is like head 2012-01-10T14:55:19 mcstar: all of the nice lazy generator stuff is hidden away in the itertools module in python 2012-01-10T14:55:32 well, other than zip, enumerate, filter, map, reduce 2012-01-10T14:55:54 remember what did i tell you some time ago about python? 2012-01-10T14:56:01 :) 2012-01-10T15:01:57 yay, new divisors function works 2012-01-10T15:02:37 wait nvm it doesn't. 2012-01-10T15:09:51 there. 2012-01-10T15:10:21 i like the gcd algorithm i use. it's simple and fast 2012-01-10T15:13:18 is it shiny too? 2012-01-10T15:13:22 mine is shiny 2012-01-10T15:13:35 you can't even look at mine without protective goggles 2012-01-10T15:13:50 :) 2012-01-10T15:13:55 meh... it looks like this new factoring is as slow as the old way 2012-01-10T15:14:07 really poorly optimized though 2012-01-10T15:14:09 thestinger: your bottleneck is the i7 2012-01-10T15:14:25 I guess I could just be bottlenecked by memory bandwidth :) 2012-01-10T15:15:01 trial division (up to sqrt(n)) is the same speed as using a powerset of the prime factors, which is also the same speed as doing it properly with powers 2012-01-10T15:15:04 :( 2012-01-10T15:16:20 thestinger: i guess your are not multi-threadin in any way right? 2012-01-10T15:16:24 thestinger, also xrange 2012-01-10T15:16:32 cyphase: there is no xrange in python anymore 2012-01-10T15:16:42 thestinger, ah, yea, python 3 2012-01-10T15:16:47 if you're using python2 then none of the built-ins are lazy generators 2012-01-10T15:16:57 you have to use imap, izip, ireduce, ifilter from itertools too 2012-01-10T15:17:00 in addition to xrange 2012-01-10T15:17:32 (75,8118264) 2012-01-10T15:17:47 cyphase: anyway it drives me crazy when I use pypy :) 2012-01-10T15:18:10 thestinger, what does? 2012-01-10T15:18:28 that the built-ins return lists instead of generators 2012-01-10T15:18:32 ah 2012-01-10T15:18:55 i haven't use python 3 that much 2012-01-10T15:18:58 used* 2012-01-10T15:19:38 *** epicmonkey has joined #aichallenge 2012-01-10T15:19:41 *** g0llum has joined #aichallenge 2012-01-10T15:20:48 thestinger: did you find a closed formula to 78? 2012-01-10T15:21:04 or only an algorithmic solution 2012-01-10T15:22:15 mcstar: I solved it just by adding code to my n_partitions function to check with each iteration (since it builds up from the previous n) 2012-01-10T15:22:31 but a1k0n found a nice math formula with pentagonal numbers 2012-01-10T15:22:32 ok, so no math 2012-01-10T15:22:59 mine takes 2.5s now when checking up to 100k, which is enough 2012-01-10T15:23:18 (80,15796476) 2012-01-10T15:23:21 thats where i am 2012-01-10T15:23:26 n == 80? 2012-01-10T15:23:30 :) 2012-01-10T15:23:36 it's over 10k for sure :) 2012-01-10T15:23:39 n 2012-01-10T15:23:46 gonna take some time then 2012-01-10T15:24:03 81 now 2012-01-10T15:24:05 lol 2012-01-10T15:24:09 well, it's also over 20k and 30k 2012-01-10T15:24:27 mcstar: are you using a recursive solution? 2012-01-10T15:24:31 to find p(n) 2012-01-10T15:24:32 yep 2012-01-10T15:24:33 ah 2012-01-10T15:24:37 my usual function 2012-01-10T15:24:40 yeah, I started with that in python but it was way too slow 2012-01-10T15:24:45 ill code something better up 2012-01-10T15:24:56 but i wanted to think about a math formula ffirst 2012-01-10T15:25:02 so I ended up turning it into 2 nested loops with an array to store the old answers 2012-01-10T15:25:07 basically 2012-01-10T15:25:16 then I did something really weird to optimize it and it barely makes sense 2012-01-10T15:25:22 that was like a year ago though... 2012-01-10T15:25:38 ./solution 171.83s user 0.09s system 99% cpu 2:51.99 total 2012-01-10T15:25:39 dont go into details 2012-01-10T15:25:40 meh 2012-01-10T15:25:53 it takes almost 3 minutes to find the divisors for all numbers below 10**7 2012-01-10T15:26:05 now to benchmark the old functions... 2012-01-10T15:27:46 *** sashaSochka has quit IRC (Quit: Page closed) 2012-01-10T15:27:54 ./solution 86.01s user 0.03s system 99% cpu 1:26.07 total 2012-01-10T15:27:56 :( 2012-01-10T15:27:59 it's faster using the powerset 2012-01-10T15:28:01 *sigh* 2012-01-10T15:29:03 I do the powerset with bit magic though 2012-01-10T15:29:32 thestinger, i hope you're using past computations 2012-01-10T15:29:41 no, this is a benchmark 2012-01-10T15:29:42 and not recomputing everything for each number 2012-01-10T15:29:43 ah 2012-01-10T15:29:46 well 2012-01-10T15:29:58 I'm only running my sieve function one time 2012-01-10T15:30:50 I have overloads for all of these 2012-01-10T15:31:26 factorize(n) is just a convenient way of doing factorize(n, primes_below(n)) 2012-01-10T15:32:15 *** Accoun has quit IRC () 2012-01-10T15:34:28 I think I just have some memory allocation issues so generating the powerset is faster 2012-01-10T15:37:09 *** dvladim has quit IRC (Ping timeout: 248 seconds) 2012-01-10T15:37:33 I wish C++ had variable length arrays :( 2012-01-10T15:38:16 I guess alloca() will work 2012-01-10T15:38:24 why not vectors? 2012-01-10T15:38:29 always really small 2012-01-10T15:38:46 so sticking a tiny little array on the heap in an inner loop is slowing this down 2012-01-10T15:39:53 a variable-length array is actually fixed size :) 2012-01-10T15:40:26 *** forio has joined #aichallenge 2012-01-10T15:40:38 hello hello guys please i need help, in dbscan how many time i need to calculate the distance matrix ? i think that it is just 1 time it is true ? 2012-01-10T15:40:46 http://en.wikipedia.org/wiki/DBSCAN 2012-01-10T15:40:50 *** Regis has joined #aichallenge 2012-01-10T15:41:22 *** Kurnevsky has left #aichallenge 2012-01-10T15:43:28 does it ever change? 2012-01-10T15:43:55 *** Redgis has quit IRC (Ping timeout: 240 seconds) 2012-01-10T15:44:01 mcstar: yes :( 2012-01-10T15:44:25 I'll figure it out 2012-01-10T15:44:37 thestinger: to forio 2012-01-10T15:44:48 i don't think it change 2012-01-10T15:44:52 *** Accoun has joined #aichallenge 2012-01-10T15:44:59 oh, I thought you meant the vector size 2012-01-10T15:45:01 so you dont need to 2012-01-10T15:45:21 maybe you can even fill it up on a need-to basis 2012-01-10T15:45:35 lol i just need to be reassured 2012-01-10T15:45:47 i never heard of dbscan before 2012-01-10T15:45:59 theres some pseudocode 2012-01-10T15:46:06 you need to follow it and decide for yourself 2012-01-10T15:46:06 so i can optimize the alogorithm calculating just 1 time the distance matrix 2012-01-10T15:46:14 http://en.wikipedia.org/wiki/DBSCAN 2012-01-10T15:46:19 here pesudocode 2012-01-10T15:46:22 yes 2012-01-10T15:46:41 ==2632== total heap usage: 254,317 allocs, 254,317 frees, 7,740,288 bytes allocated 2012-01-10T15:46:42 lol 2012-01-10T15:46:45 well, this is what I need to fix 2012-01-10T15:47:32 ==2640== total heap usage: 34,482 allocs, 34,482 frees, 1,692,896 bytes allocated 2012-01-10T15:47:38 that's with the old method 2012-01-10T15:47:40 ugh... 2012-01-10T15:49:18 *** TheLinker has quit IRC (Remote host closed the connection) 2012-01-10T15:51:46 *** choas has joined #aichallenge 2012-01-10T15:55:39 ==2806== total heap usage: 196,575 allocs, 196,575 frees, 7,058,244 bytes allocated 2012-01-10T15:55:42 better... 2012-01-10T15:57:03 thestinger: beautiful 2012-01-10T15:57:12 lol 2012-01-10T15:57:18 ==2823== total heap usage: 191,359 allocs, 191,359 frees, 6,846,780 bytes allocated 2012-01-10T15:57:19 euler has a generating function for p(n) 2012-01-10T15:57:27 yeah 2012-01-10T15:57:30 that's what a1k0n used 2012-01-10T15:57:34 the one with pentagonal numbers, right? 2012-01-10T15:57:36 thats what i will 2012-01-10T15:57:38 a q series or whatever 2012-01-10T15:57:39 no 2012-01-10T15:57:41 no 2012-01-10T15:57:56 at least those 2 things didnt come up so far 2012-01-10T15:58:03 so i dont think they are related 2012-01-10T15:58:17 https://en.wikipedia.org/wiki/Partition_(number_theory)#Generating_function this, right? 2012-01-10T15:58:29 The denominator of the product is Euler's function and can be written, by the pentagonal number theorem, as 2012-01-10T15:58:30 im reading some lecture notes 2012-01-10T15:59:15 the generating function might expand out as pentagonal numbers 2012-01-10T15:59:25 i didn't do the algebra myself 2012-01-10T16:00:06 i need to clear out p50 2012-01-10T16:00:21 i never heaRD of pentagonal numbers before 2012-01-10T16:00:29 me either 2012-01-10T16:00:35 you probably have 2012-01-10T16:00:48 https://upload.wikimedia.org/wikipedia/commons/1/1c/First_six_triangular_numbers.svg 2012-01-10T16:00:55 well, here i came across triangular, hexagonal and some other 2012-01-10T16:01:14 haha 2012-01-10T16:01:30 it's also odd that they're generated by 0, +1, -1, +2, -2, +3, ... i've never seen a sequence like that 2012-01-10T16:01:41 without involving complex numbers anyway 2012-01-10T16:03:10 n * (3 * n - 1) // 2 is what I used for some euler question about them 2012-01-10T16:03:54 so these -gonal numbers are the number of little balls you need to have for any proper n-gon 2012-01-10T16:04:10 there was one where you had to find a number which is a triangle number, a hexagonal number and a pentagonal number 2012-01-10T16:04:12 makes sense, but i havent given any thought to them before 2012-01-10T16:05:04 you can also just solve that equation and write a test to see if a number is pentagonal 2012-01-10T16:05:09 don't need it for this though 2012-01-10T16:05:16 thestinger: now tis makes it trivial that every hexagonal number is triagonal too 2012-01-10T16:05:23 yeah 2012-01-10T16:05:24 (i used a substitution to prove it) 2012-01-10T16:05:55 have you done 45? 2012-01-10T16:06:02 that's the one with all 3 2012-01-10T16:06:08 then yes 2012-01-10T16:06:20 print(next(filter(is_pentagonal, hexagonal_numbers(143+1)))) 2012-01-10T16:06:22 I did it like that 2012-01-10T16:06:47 I did it a stupid way first and then optimized it to that for fun 2012-01-10T16:07:10 ==2640== total heap usage: 34,482 allocs, 34,482 frees, 1,692,896 bytes allocated 2012-01-10T16:07:16 stupid clipboard... 2012-01-10T16:07:27 i have a function with 6 arguments for that 2012-01-10T16:07:32 http://sprunge.us/RKDe 2012-01-10T16:07:35 that's what I meant to paste 2012-01-10T16:07:55 im gonna set up this sprunge thing one day 2012-01-10T16:08:06 solve tc pc hc tP pP hP 2012-01-10T16:08:12 alias sprunge="curl -F 'sprunge=<-' http://sprunge.us" 2012-01-10T16:08:16 | tP==pP && tP==hP = tP 2012-01-10T16:08:17 | tP==m = solve (succ tc) pc hc (t tc) pP hP 2012-01-10T16:08:19 | pP==m = solve tc (succ pc) hc tP (p pc) hP 2012-01-10T16:08:21 | hP==m = solve tc pc (succ hc) tP pP (h hc) 2012-01-10T16:08:23 | otherwise = error "lofasz" 2012-01-10T16:08:25 where m = minimum [tP,pP,hP] 2012-01-10T16:08:27 t n = n*(n+1)`div`2 2012-01-10T16:08:29 p n = n*(3*n-1)`div`2 2012-01-10T16:08:31 h n = n*(2*n-1) 2012-01-10T16:08:41 and then you can 'something | sprunge' or 'sprunge < file' 2012-01-10T16:08:43 :) 2012-01-10T16:09:33 I end up piping xclip to it and always using the wrong X clipboard 2012-01-10T16:09:51 thestinger: http://sprunge.us/LcPe 2012-01-10T16:12:46 my cpu load is at 205% and my memory is full... 2012-01-10T16:12:51 I think I broke my program :( 2012-01-10T16:13:07 I broke it so badly it's using multiple cores 2012-01-10T16:15:25 well that's a good sign 2012-01-10T16:15:40 I had to increase my print of i every 5000 to every 10000 because I made this faster 2012-01-10T16:27:03 *** treeform has joined #aichallenge 2012-01-10T16:27:17 *** rwest has quit IRC (Quit: Lost terminal) 2012-01-10T16:29:05 !#(*! 2012-01-10T16:29:16 projecteuler lost its mysql db 2012-01-10T16:29:19 just as i solved p50 2012-01-10T16:29:46 hehe, i hope everything is lost and they have no backup. 2012-01-10T16:30:02 guess i should do some work 2012-01-10T16:30:07 I am pretty sure correlation implies causation in this case. 2012-01-10T16:30:07 because I still have my code for everything and you don't , ha har 2012-01-10T16:30:18 i still have most of my code 2012-01-10T16:30:21 in dropbox 2012-01-10T16:30:39 * mleise 's harddisk crashes 2012-01-10T16:30:44 Oh nooooo! 2012-01-10T16:31:08 next reboot I'll backup, I promise 2012-01-10T16:31:29 talk about the devil... 2012-01-10T16:31:37 all my stuff is in the cloud now, devices are transient 2012-01-10T16:31:57 i have too much stuff, i dont want to break the cloud 2012-01-10T16:32:01 except raw photos i guess 2012-01-10T16:32:27 i have 2TB stuff, noway the cloud can handle that 2012-01-10T16:32:41 I don't know... all that private stuff on someone elses server? 2012-01-10T16:32:51 I am pretty sure the porn is already in the cloud 2012-01-10T16:33:08 oh do they scan for duplicates? 2012-01-10T16:33:20 they do. 2012-01-10T16:33:32 that's what sshfs is for 2012-01-10T16:33:33 that would speed up the upload if they calculated the checksum on the client 2012-01-10T16:33:39 i film my own pron... 2012-01-10T16:33:40 indeed 2012-01-10T16:34:05 aw crap, I wasted 10 minutes optimizing this and it does _more_ memory allocations than before 2012-01-10T16:34:06 i uploaded all my music to teh google also 2012-01-10T16:34:26 thestinger: memory allocations *are bad* 2012-01-10T16:34:29 and now I have code like this: 2012-01-10T16:34:32 v.resize(old_size + old_size * powers.size()); 2012-01-10T16:34:36 and then 2012-01-10T16:34:38 v[old_size + i * powers.size() + j] = (v[i] * powers[j]); 2012-01-10T16:34:40 :( 2012-01-10T16:34:52 thestinger: you need to change that alias to add ?lang to the end of the url 2012-01-10T16:35:03 mcstar: meh, I hate their line numbers 2012-01-10T16:35:14 they use pygments which is nice, but they really need to stick the line numbers in a div 2012-01-10T16:35:14 ah 2012-01-10T16:35:23 they need to put that into the background 2012-01-10T16:35:38 well if they put it in a div it wouldn't be selected with the code 2012-01-10T16:36:08 *** Anilm3 has joined #aichallenge 2012-01-10T16:36:45 Hi 2012-01-10T16:37:46 Anilm3: just in time 2012-01-10T16:37:56 we were talking about you 2012-01-10T16:39:36 *** dici has joined #aichallenge 2012-01-10T16:40:00 oh 2012-01-10T16:40:55 *** g0llum has quit IRC (Ping timeout: 240 seconds) 2012-01-10T16:42:51 meh that was the worst optimization ever 2012-01-10T16:42:57 I made it 2% slower 2012-01-10T16:43:48 *** foRei has quit IRC (Quit: Bye) 2012-01-10T16:44:05 singing “I'm worst at what, I do best..and for this gift I feel blessed” 2012-01-10T16:44:29 *** Palmik has quit IRC (Remote host closed the connection) 2012-01-10T16:44:51 but really, 2% is pretty common for little optimizations that depend on more than is visible 2012-01-10T16:45:38 code fits in cache? compiler knows better? CPU is particularly bad with that setup (predictions, ...) 2012-01-10T16:46:37 for example going through a large array in sequence is orders of magnitude faster than random access 2012-01-10T16:47:03 *** kapoc has left #aichallenge 2012-01-10T16:53:13 I have a nice idea for "n choose k" and other Pascal's triangle operations. I'll make a Pascal's triangle struct, that I can "move around" in. Most tasks don't require random access, but rather some sort of iteration, i.e. 1 row up, 2 to the left 2012-01-10T16:54:53 mleise: you can do it iteratively instead of with the recursive or factorial equation 2012-01-10T16:54:54 *** ikaros has quit IRC (Quit: Ex-Chat) 2012-01-10T16:55:27 or you can make it tail-recursive the same way 2012-01-10T16:57:09 I have an iterative function already. The point is to just have a struct that represents a location in the triangle and offers methods to move around from there (using the right iterative function for row or diagonal moves) 2012-01-10T16:57:27 ah 2012-01-10T16:57:53 haskell is nice for stuff like that due to laziness 2012-01-10T16:59:09 I wouldn't know how lazyness can help here. pascal.moveLeft(2); pascal.moveRightUp(1); are two iterator function on one struct 2012-01-10T16:59:22 well you wouldn't need to populate the whole struct 2012-01-10T16:59:29 you could have an infinitely large tree 2012-01-10T16:59:54 hehe, I don't do that. I hope to have no more than "ℕ n, k, value;" 2012-01-10T17:00:12 so it is only a few bytes in size 2012-01-10T17:00:34 or you can be like McLeopold and precalculate a 2GB one :) 2012-01-10T17:00:57 he isn't doing himself a favor with that I believe ^^ 2012-01-10T17:02:09 then again, if you only seek to the right byte offset it could be fast... hmm. nah. that's cheating and I need my disk for other stuff. 2012-01-10T17:03:03 perfect for a haskell zipper 2012-01-10T17:03:11 but otherwise its pointless 2012-01-10T17:03:15 imho 2012-01-10T17:05:24 meh, I still can't be my naive old function 2012-01-10T17:05:34 at 2012-01-10T17:05:50 finding divisors 2012-01-10T17:05:57 beat 2012-01-10T17:06:01 yeah 2012-01-10T17:06:02 be at 2012-01-10T17:06:05 :) 2012-01-10T17:06:07 silly typos 2012-01-10T17:06:16 I missed the 'at' completely :) 2012-01-10T17:07:04 be@ 2012-01-10T17:09:47 http://sprunge.us/ZMWW that was my old function, which I just threw together in 2 mins to replace trial division up to sqrt(n) 2012-01-10T17:09:55 has to use a set because it ends up with duplicates 2012-01-10T17:13:03 anyway that takes 5s to factor every number from 1 to 1 million 2012-01-10T17:13:39 *** Anilm3 has quit IRC (Quit: Lost terminal) 2012-01-10T17:13:43 thats 5 million seconds\ 2012-01-10T17:13:46 crazy 2012-01-10T17:13:56 5s total :P 2012-01-10T17:14:38 trial division takes 8s, but ofc it gets much worse with higher numbers 2012-01-10T17:18:29 anyway there's a way to do it with a map of {prime_factor: multiplicity} and it should be faster, but it's slower than my crappy powerset method 2012-01-10T17:18:31 https://twitter.com/#!/mattcomi/status/156611909167235072 2012-01-10T17:19:21 *** smjms has quit IRC (Ping timeout: 240 seconds) 2012-01-10T17:21:25 anyway I'll switch std::unordered_map to std::vector> and see if that's the issue 2012-01-10T17:22:42 python has trained me to use hash tables for everything 2012-01-10T17:23:03 mleise: wrong 2012-01-10T17:23:09 what kind of dog?? 2012-01-10T17:23:19 actuall idk 2012-01-10T17:23:21 y 2012-01-10T17:29:09 *** forio has quit IRC (Quit: Leaving) 2012-01-10T17:29:26 yup, that was the problem 2012-01-10T17:29:32 C++ unordered_map is horribly unoptimized 2012-01-10T17:31:22 ./solution 2.62s user 0.00s system 99% cpu 2.621 total 2012-01-10T17:31:26 down from 8s 2012-01-10T17:33:32 *** dici has quit IRC (Read error: Connection reset by peer) 2012-01-10T17:38:01 *** choas has quit IRC (Ping timeout: 240 seconds) 2012-01-10T17:53:14 which problem? 2012-01-10T17:53:24 not a specific one 2012-01-10T17:53:35 *** Jak_o_Shadows has joined #aichallenge 2012-01-10T17:53:46 optimizing my divisors() and n_divisors() functions 2012-01-10T17:53:53 fast enough now 2012-01-10T17:56:02 lol 2012-01-10T17:56:15 some assembler guy is ragign now probably 2012-01-10T17:56:22 aw crap the euler site is broken 2012-01-10T17:56:40 n_divisors can be calculated so much faster than I realized 2012-01-10T17:57:38 yes, still broken 2012-01-10T17:58:04 there are like 20 questions I can solve now :) 2012-01-10T17:58:21 i just want to add my solution to p50 2012-01-10T17:58:23 starting with 179 2012-01-10T17:58:49 a1k0n: I have a silly brute force solution to that 2012-01-10T17:58:54 maybe not 2012-01-10T17:59:21 *** iglo has quit IRC (Remote host closed the connection) 2012-01-10T17:59:33 i compute the largest consecutive prime below the target number, starting from each prime in turn 2012-01-10T17:59:37 it's pretty easy 2012-01-10T17:59:56 a1k0n: http://sprunge.us/eVHD that was my silly code 2012-01-10T18:00:04 originally it was in python with a slice so it's kind of weird 2012-01-10T18:00:24 i thought about using a binary search to do the prime test but i didn't even bother 2012-01-10T18:00:26 candidates is a deque with all the primes up to the target 2012-01-10T18:00:49 a1k0n: well, it's actually less characters to type than std::find :) 2012-01-10T18:01:00 i just recompute is_prime as necessary 2012-01-10T18:01:06 ah 2012-01-10T18:01:16 I use a sieve to get primes up to the target 2012-01-10T18:01:24 i do too 2012-01-10T18:01:30 but i don't save the large primes 2012-01-10T18:01:36 ah 2012-01-10T18:01:56 e.g. composites < 1000000 will have prime factors < 1000 2012-01-10T18:02:02 yeah 2012-01-10T18:02:14 so your is_prime uses primes up to sqrt(n)+1? 2012-01-10T18:02:21 yeah 2012-01-10T18:02:54 *** lhb__ has quit IRC (Read error: Connection reset by peer) 2012-01-10T18:03:36 *** raemde_ has joined #aichallenge 2012-01-10T18:03:55 http://codepad.org/xAxRTNn8 is my solution 2012-01-10T18:04:04 i just use sort -nk6 to find the actual winner, heh 2012-01-10T18:05:34 euler site works again :) 2012-01-10T18:05:39 duude 2012-01-10T18:06:11 first two rows cleared 2012-01-10T18:06:28 nice 2012-01-10T18:06:40 I started to get stuck on the third row and started jumping around 2012-01-10T18:06:48 i see that 2012-01-10T18:07:04 Congratulations, the answer you gave to problem 179 is correct. :) 2012-01-10T18:07:36 takes 20s to brute force (checking the n_divisors for each number up to 10**7) 2012-01-10T18:08:36 p51 is kind of unclear 2012-01-10T18:10:47 I don't understand the ancient code I wrote to solve that... 2012-01-10T18:11:35 Non-exhaustive patterns in function driveEulerp 2012-01-10T18:11:40 wtf 2012-01-10T18:11:45 i check 1 condition 2012-01-10T18:11:53 and theres an otherwise case 2012-01-10T18:12:01 which catches anything... 2012-01-10T18:12:28 do you use pattern matching? 2012-01-10T18:12:42 ye 2012-01-10T18:12:43 s 2012-01-10T18:12:48 but that should be ok too 2012-01-10T18:13:02 apparently it isnt 2012-01-10T18:13:35 i use an x:xs pattern on [1..] 2012-01-10T18:13:38 but thats ok 2012-01-10T18:14:09 not if it's recursive 2012-01-10T18:15:43 thestinger: explain 2012-01-10T18:16:37 well if it's recursive you're probably passing a smaller list to it each time 2012-01-10T18:16:46 so eventually it gets down to [] and there's no match 2012-01-10T18:16:54 thats impossible 2012-01-10T18:17:01 [1..] cant shrinnk to [] 2012-01-10T18:17:18 true :P 2012-01-10T18:17:30 is that actually an error or just a warning? 2012-01-10T18:17:37 runtime error 2012-01-10T18:17:53 and that usually happens with not complete guards 2012-01-10T18:18:09 try compiling with ghc -Wall 2012-01-10T18:18:21 ghci 2012-01-10T18:18:24 i might 2012-01-10T18:18:34 i trace it first 2012-01-10T18:21:33 weird 2012-01-10T18:21:33 *** amstan has quit IRC (Quit: Konversation terminated!) 2012-01-10T18:21:39 seems to be working under trace 2012-01-10T18:21:42 oh 2012-01-10T18:21:44 fuck 2012-01-10T18:21:46 fuckoff 2012-01-10T18:21:48 fuckme 2012-01-10T18:22:19 thestinger: i tested it, you know, just quickly with [1..10] 2012-01-10T18:22:31 but it can only handle the infinite version 2012-01-10T18:22:33 *** amstan has joined #aichallenge 2012-01-10T18:22:33 *** ChanServ sets mode: +o amstan 2012-01-10T18:22:52 and i just forgot that i tested it with a finite list 2012-01-10T18:22:56 how stupid 2012-01-10T18:24:01 contestbot update tiem! 2012-01-10T18:24:02 amstan: No! 2012-01-10T18:24:21 contestbot: quit updating 2012-01-10T18:26:37 *** contestbot has joined #aichallenge 2012-01-10T18:26:42 yay, it came up 2012-01-10T18:26:45 contestbot: version 2012-01-10T18:26:50 amstan: The current (running) version of this Supybot is 0.83.4.1+gribble (2011-04-04T16:30:52-0400). The newest version available in the gribble git repository is 0.83.4.1+gribble (2011-08-12T18:12:56-0400). 2012-01-10T18:27:09 i didn't think that would work, cool 2012-01-10T18:27:09 lol 2012-01-10T18:27:18 now i just need to fix that services thing 2012-01-10T18:27:26 thestinger: i wrote my solution to 78 with eulers p(n) still effing slow 2012-01-10T18:27:35 how much time did yours need? 2012-01-10T18:27:56 2.5s to compute up to 100k 2012-01-10T18:28:01 I didn't use a nice math solution 2012-01-10T18:28:09 so I had to guess at the upper bound 2012-01-10T18:28:34 eulerp olds n = (sum $ zipWith (*) sumdivsList olds) `div` 2012-01-10T18:28:36 I end up with p(n) for each 1..n with one function call to n_partitions 2012-01-10T18:28:38 thats how i do it 2012-01-10T18:28:53 so I added in a line to check with each iteration 2012-01-10T18:29:11 eulerp olds n = (sum $ zipWith (*) sumdivsList olds) `div` n 2012-01-10T18:29:49 http://sprunge.us/Thgf that's what I used for 31, 76 and 78 (but with an extra check with each iteration for 78) 2012-01-10T18:30:01 a1k0n found a better way to do it 2012-01-10T18:30:14 im not gonna chek it 2012-01-10T18:30:21 ill find a better way too 2012-01-10T18:30:25 :D 2012-01-10T18:30:32 well, he cheated and looked it up :) 2012-01-10T18:30:36 haha 2012-01-10T18:30:39 #78 was nice :D 2012-01-10T18:30:44 http://mathworld.wolfram.com/PartitionFunctionP.html 2012-01-10T18:30:44 well, i looked it up too 2012-01-10T18:30:55 noway i could come up with eulers generator function 2012-01-10T18:31:17 I'll be back in about an hour 2012-01-10T18:31:21 looks so harmless and then ... bang ... an advanced generator function 2012-01-10T18:31:30 oh, recurrence 11 looks easier 2012-01-10T18:31:54 er, duh, that's the same thing 2012-01-10T18:32:05 contestbot: nick contestbot__ 2012-01-10T18:32:06 amstan: Error: You don't have the admin capability. If you think that you should have this capability, be sure that you are identified before trying again. The 'whoami' command can tell you if you're identified. 2012-01-10T18:32:15 contestbot: nick contestbot__ 2012-01-10T18:32:16 *** contestbot is now known as contestbot__ 2012-01-10T18:33:05 hmm 2012-01-10T18:33:11 i hope freenode can do password recovery 2012-01-10T18:34:02 *** dapplegate has quit IRC (Quit: Ex-Chat) 2012-01-10T18:34:06 haha equation 20 and equation 11 are identical on that mathworld link 2012-01-10T18:34:31 mcstar: the problem with eulers generator function is, that terms are added as you progress (or are defined as 0 while your n is too small) 2012-01-10T18:34:55 the problem with it is that looks like an inner product 2012-01-10T18:35:12 and traverses 2 lists to compute the next values 2012-01-10T18:35:16 -s 2012-01-10T18:35:23 eh? 2012-01-10T18:35:26 and i see now, that theres recurrence relations 2012-01-10T18:35:32 so with them its easier 2012-01-10T18:35:46 You can't deduce that from looking at the numbers alone... or it is hard at least and I spent hours finding some logic by adding and subtracting or dividing values, just to find that a few iteration further it doesn't work any more. 2012-01-10T18:35:46 a1k0n: eulerp olds n = (sum $ zipWith (*) sumdivsList olds) `div` n 2012-01-10T18:35:47 yeah, but the beauty of it is you visit a sparse set of previously-computed values for each new value 2012-01-10T18:35:59 so it runs very quickly 2012-01-10T18:36:03 ^^ thats a dense one 2012-01-10T18:36:10 EVREY element must be visited 2012-01-10T18:36:24 yeah, that method is way too slow 2012-01-10T18:36:54 i first implemented a dynamic programming version which required 6 gigs of RAM to solve it 2012-01-10T18:37:13 id need a vector for this though, and i cant do vectors in haskell :( 2012-01-10T18:37:14 then i did the brute force method and it basically choked at around 30k 2012-01-10T18:37:18 it can be solved in 40 ms 2012-01-10T18:37:28 yeah my final solution takes ~150ms 2012-01-10T18:38:16 in the end it all comes down to the algorithm complexity. some languages may be 5 times slower, but you really feel it when your algorithm sucks 2012-01-10T18:39:01 some solutions I brute force and then take a look in the forum to optimize my code. 2012-01-10T18:39:21 the forum is full of bs 2012-01-10T18:39:25 and *i'm* the one who cheats? 2012-01-10T18:39:36 :( 2012-01-10T18:39:52 the first post on the forum is inevitably some russian dude posting his assembly solution 2012-01-10T18:39:54 mleise: there are some gems, but the majority... 2012-01-10T18:40:03 haha 2012-01-10T18:40:22 they just hacked the timestamp 2012-01-10T18:40:40 no i think they teach number theory in grade school there 2012-01-10T18:40:41 it is not like his solution is the fastest either 2012-01-10T18:41:04 110 ms ASM vs. 35ms C is common on the forum 2012-01-10T18:41:20 i know that id never check an asm solution 2012-01-10T18:41:46 mcstar: The rectangular triangle problem... I found some nice idea on the forum 2012-01-10T18:41:55 XD 2012-01-10T18:42:02 try drawing one 2012-01-10T18:42:07 rectangular triangle 2012-01-10T18:42:14 uh... how do you say it in english? 2012-01-10T18:42:22 right angled? 2012-01-10T18:42:28 yep 2012-01-10T18:42:31 90deg 2012-01-10T18:42:45 right triangle then 2012-01-10T18:43:09 right as in |good| 2012-01-10T18:43:13 damn 2012-01-10T18:43:14 anyway, dividing the search space by 2 sped it up quite a bit. but I don't believe the claim of 0.1 s 2012-01-10T18:43:22 i changed my layout to us... 2012-01-10T18:43:25 contestbot__: seen zanick 2012-01-10T18:43:25 amstan: I have not seen zanick. 2012-01-10T18:43:31 looks rounded down 2012-01-10T18:43:32 did i spell it wrong? 2012-01-10T18:43:34 yes 2012-01-10T18:43:35 zannick 2012-01-10T18:43:40 @seen zannick 2012-01-10T18:43:40 mcstar: zannick was last seen in #aichallenge 1 week, 5 days, 0 hours, 31 minutes, and 2 seconds ago: dunno how to do it for konversation 2012-01-10T18:43:47 do you need him for something? 2012-01-10T18:43:57 hello! 2012-01-10T18:44:03 Zannick: hey, do you want a cloak too? 2012-01-10T18:44:21 are you role-playing? 2012-01-10T18:44:26 oooh, an aichallenge cloak? 2012-01-10T18:44:40 Zannick: yeah 2012-01-10T18:44:41 does it confer magic-resistance? 2012-01-10T18:44:44 amstan: sure :D 2012-01-10T18:44:52 much more snazzy than my unaffiliated cloak 2012-01-10T18:45:28 blessed corrosionproof greased +3 opera cloak named aichallenge.org 2012-01-10T18:45:34 yeah once you join a faction you get the good stuff 2012-01-10T18:45:50 Zannick: look ok? http://pastebin.com/1fWFVuCF 2012-01-10T18:46:15 Zannick: mostly concerned about 'admin' 2012-01-10T18:46:29 any other good word or is that it? 2012-01-10T18:47:18 looks good to me 2012-01-10T18:47:46 ah 2012-01-10T18:47:58 j3camero needs to register his account 2012-01-10T18:48:13 Zannick: you might be contacted by marienz about it, you'll have to confirm 2012-01-10T18:48:20 k 2012-01-10T18:48:46 yeah, it looks fine to me, jeff will need to register with freenode before he can get a cloak, though 2012-01-10T18:48:47 *** amstan has quit IRC (Changing host) 2012-01-10T18:48:48 *** amstan has joined #aichallenge 2012-01-10T18:48:48 *** niven.freenode.net sets mode: +o amstan 2012-01-10T18:49:26 when he comes online next time i might mention it 2012-01-10T18:49:31 *** Zannick has quit IRC (Changing host) 2012-01-10T18:49:32 *** Zannick has joined #aichallenge 2012-01-10T18:49:41 Zannick: how did you do that? i wanna do it too! 2012-01-10T18:50:10 do what? :P 2012-01-10T18:50:14 change the hosts 2012-01-10T18:50:19 that's automatic 2012-01-10T18:50:27 oh.. i guess it is, cool 2012-01-10T18:50:43 15:48:48 -!- amstan [~amstan@206-248-158-116.dsl.teksavvy.com] has quit [Changing host] 2012-01-10T18:50:46 15:48:48 -!- amstan [~amstan@aichallenge/admin/amstan] has joined #aichallenge 2012-01-10T18:52:09 contestbot__: reload 2012-01-10T18:52:09 amstan: Error: You don't have the owner capability. If you think that you should have this capability, be sure that you are identified before trying again. The 'whoami' command can tell you if you're identified. 2012-01-10T18:52:19 contestbot__: reload 2012-01-10T18:52:19 amstan: (reload ) -- Unloads and subsequently reloads the plugin by name; use the 'list' command to see a list of the currently loaded plugins. 2012-01-10T18:52:23 contestbot__: restart 2012-01-10T18:52:24 amstan: User error, it's not my fault. 2012-01-10T18:52:28 contestbot__: quit 2012-01-10T18:53:04 *** contestbot__ has joined #aichallenge 2012-01-10T18:53:14 contestbot__: why you know identify? 2012-01-10T18:53:18 amstan: An error occured while trying to show the previous error. 2012-01-10T18:53:22 turns out, i used Int type for my function 2012-01-10T18:53:40 *** contestbot__ is now known as contestbot 2012-01-10T18:54:11 in fact it seems very fast 2012-01-10T18:54:23 *** epicmonkey has quit IRC (Read error: Operation timed out) 2012-01-10T18:55:29 100 numbers/second with trace 2012-01-10T18:56:39 yay! 2012-01-10T18:57:23 Zannick: i took ops away from you for a sec, trying to get a cloak wide op thing going 2012-01-10T18:57:39 now if you can configure it to not join the channel until after it's identified, you won't leak the uncloaked hostname 2012-01-10T18:57:50 Zannick: yeah, that would be nice for me too 2012-01-10T18:57:59 i don't want to spam ppl with 3 lines 2012-01-10T18:58:17 i use a server password to do it through irssi 2012-01-10T18:58:37 huh, i didn't realize you can give access by host 2012-01-10T18:58:39 neat 2012-01-10T18:58:53 yeah.. it's just a host, you're right.. 2012-01-10T19:00:08 well, a host or hostmask 2012-01-10T19:00:16 try adding aichallenge/admin/* or something 2012-01-10T19:00:23 *!*@aichallenge/admin/* i think will work 2012-01-10T19:00:25 and i'll see if it works 2012-01-10T19:00:33 *!*@aichallenge/* for that matter 2012-01-10T19:00:54 contestbot: op 2012-01-10T19:00:54 amstan: Error: I need to be opped to op someone. 2012-01-10T19:01:08 Zannick: try asking for op 2012-01-10T19:01:16 Zannick: from chanserv 2012-01-10T19:01:23 *** ChanServ sets mode: +o Zannick 2012-01-10T19:01:29 cool 2012-01-10T19:01:46 hmm, ok, i just need to restart it then 2012-01-10T19:01:54 contestbot: quit 2012-01-10T19:02:05 *** contestbot has joined #aichallenge 2012-01-10T19:02:23 ... why you know op yourself? 2012-01-10T19:03:48 change contestbot to be +oO or change aichallenge/* to be +oO 2012-01-10T19:03:57 or have contestbot autorequest from chanserv :P 2012-01-10T19:04:10 yeah, that's what i was hoping for 2012-01-10T19:04:30 the latter? it has to be identified and in channel 2012-01-10T19:04:35 *** Zannick sets mode: -o Zannick 2012-01-10T19:04:48 contestbot: quit 2012-01-10T19:04:48 amstan: Error: You don't have the owner capability. If you think that you should have this capability, be sure that you are identified before trying again. The 'whoami' command can tell you if you're identified. 2012-01-10T19:06:51 *** contestbot has joined #aichallenge 2012-01-10T19:07:13 . 2012-01-10T19:07:14 . 2012-01-10T19:07:15 . 2012-01-10T19:07:21 (lol) 2012-01-10T19:07:46 contestbot: supybot.plugins.Services.ChanServ.op 2012-01-10T19:07:47 amstan: User error, it's not my fault. 2012-01-10T19:07:57 contestbot: config supybot.plugins.Services.ChanServ.op 2012-01-10T19:07:57 amstan: Global: True; #aichallenge: True 2012-01-10T19:10:52 *** Jak_o_Shadows has quit IRC (Remote host closed the connection) 2012-01-10T19:12:20 ok, i give up 2012-01-10T19:12:39 just set contestbot +oO then :) 2012-01-10T19:13:10 *** contestbot has left #aichallenge ("amstan") 2012-01-10T19:13:15 *** contestbot has joined #aichallenge 2012-01-10T19:13:16 *** ChanServ sets mode: +o contestbot 2012-01-10T19:13:21 close enough 2012-01-10T19:19:37 *** amstan has quit IRC (Quit: Konversation terminated!) 2012-01-10T19:19:46 *** replore_ has joined #aichallenge 2012-01-10T19:19:48 *** amstan has joined #aichallenge 2012-01-10T19:19:48 *** ChanServ sets mode: +o amstan 2012-01-10T19:20:21 Zannick: heheh, i'm cloaked from the start 2012-01-10T19:20:35 amstan: well done! :D 2012-01-10T19:20:47 Zannick: apparently you can set the server password to your nickserv's password when you first connect 2012-01-10T19:20:56 and you'll identify before you join channels 2012-01-10T19:20:58 yes, that's what i do 2012-01-10T19:27:55 *** Regis has quit IRC (Ping timeout: 240 seconds) 2012-01-10T19:28:48 *** phillijw_ is now known as phillllijw 2012-01-10T19:28:57 *** McLeopold has joined #aichallenge 2012-01-10T19:41:34 *** srgpqt has joined #aichallenge 2012-01-10T19:42:33 *** sofuture has left #aichallenge 2012-01-10T19:57:13 *** replore_ has quit IRC (Remote host closed the connection) 2012-01-10T20:03:51 *** cyphase has quit IRC (Quit: http://www.cyphase.com/) 2012-01-10T20:21:51 *** JorgeB has quit IRC (Quit: Computer has gone to sleep.) 2012-01-10T20:23:43 *** deathcorps has joined #aichallenge 2012-01-10T20:28:14 *** Garf has quit IRC (Quit: Make a new plan, Stan!) 2012-01-10T20:31:15 :q 2012-01-10T20:31:19 *** mcstar has quit IRC (Quit: mcstar) 2012-01-10T20:33:53 mlyp 2012-01-10T20:34:03 Why did I wake up at 3am 2012-01-10T20:36:16 *** Fandekasp has joined #aichallenge 2012-01-10T20:47:50 hey I know how to do 215, but I have a 'bit' problem 2012-01-10T20:48:32 pairofdice: I wonder the very same. 2012-01-10T20:52:17 ah, 11 is not the same number as 0b11 :) 2012-01-10T21:07:35 *** deathcorps has quit IRC (Ping timeout: 252 seconds) 2012-01-10T21:09:46 *** replore_ has joined #aichallenge 2012-01-10T21:17:23 I sooo want a 3d printer soon 2012-01-10T21:20:34 *** X-Scale has joined #aichallenge 2012-01-10T21:22:10 pairofdice: i'm gonna have 3 3d printers available during this coop term 2012-01-10T21:22:12 it'll be fun 2012-01-10T21:22:24 oh, right 2012-01-10T21:22:36 there was a guy in here who wanted to make prizes for the people on his printer 2012-01-10T21:25:56 BenJackson said he might make something, I don't think he was going to use a 3d printer though 2012-01-10T21:26:05 pretty sure he was going to cut it out of metal somehow 2012-01-10T21:26:51 *** treeform has quit IRC (Remote host closed the connection) 2012-01-10T21:27:05 oh.. lasercutter he said 2012-01-10T21:41:33 *** Chris_0076 has joined #aichallenge 2012-01-10T21:44:31 I can just imagine all the copyright related amusement 2012-01-10T21:56:29 *** Fandekasp has quit IRC (Ping timeout: 244 seconds) 2012-01-10T21:57:46 1 more euler problem and I'll be ahead of McLeopold again 2012-01-10T21:57:48 hm 2012-01-10T21:57:56 grrrrr 2012-01-10T21:59:25 How many numbers below fifty million can be expressed as the sum of a prime square, prime cube, and prime fourth power? 2012-01-10T21:59:28 I'll try that 2012-01-10T22:02:16 McLeopold: what's your friend key? 2012-01-10T22:02:32 4069227551376_4e0d3efe089aa13140b1e72bf84c644d 2012-01-10T22:02:53 dang 2012-01-10T22:02:59 you two are tied 2012-01-10T22:03:22 i'm tired of doing these rearrangement of digit problems 2012-01-10T22:03:26 a1k0n: he hadn't solved anything for like 2 years but he was forced to solve 6 to stay ahead of me :) 2012-01-10T22:03:52 yeah same here. i have to catch up now 2012-01-10T22:03:53 McLeopold: friend key? 2012-01-10T22:04:07 amstan: on projecteuler.net 2012-01-10T22:04:18 aw crap this is going to take forever 2012-01-10T22:04:22 need some number theory magic 2012-01-10T22:04:27 it apparently has its own social network now 2012-01-10T22:04:39 a1k0n: I think profile pages used to be public 2012-01-10T22:04:49 yeah 2012-01-10T22:04:56 maybe recruiters were farming them? 2012-01-10T22:05:52 meh, number theory 2012-01-10T22:05:55 I'll try C++ first :P 2012-01-10T22:08:55 @math calc sin(2*pi) 2012-01-10T22:08:55 amstan: 0 2012-01-10T22:12:55 @quote stats 2012-01-10T22:12:55 amstan: There are 0 quotes in my database. 2012-01-10T22:12:58 *** Chris_0076 has quit IRC (Quit: Leaving) 2012-01-10T22:13:27 @quotegrabs random 2012-01-10T22:13:27 amstan: game viewer dont worck 2012-01-10T22:14:48 oh nice that works now 2012-01-10T22:14:59 @quote grab 2012-01-10T22:14:59 thestinger: Error: I couldn't find a matching quotegrab for grab. 2012-01-10T22:15:05 @list quote 2012-01-10T22:15:05 thestinger: add, change, get, random, remove, search, and stats 2012-01-10T22:15:13 @quote add 2012-01-10T22:15:13 thestinger: Error: You must be registered to use this command. If you are already registered, you must either identify (using the identify command) or add a hostmask matching your current hostmask (using the "hostmask add" command). 2012-01-10T22:15:13 thestinger: use quotegrab 2012-01-10T22:15:16 oh 2012-01-10T22:15:17 @quote random 2012-01-10T22:15:17 pairofdice: Error: I have no quotes in my database for #. 2012-01-10T22:15:22 @quotegrab 2012-01-10T22:15:23 thestinger: An error occured while trying to show the previous error. 2012-01-10T22:15:27 @unload quote 2012-01-10T22:15:27 amstan: Yep. 2012-01-10T22:15:38 http://ubottu.com/stdin/supydocs/plugins/QuoteGrabs.html 2012-01-10T22:15:45 @grab 2012-01-10T22:15:45 amstan: (grab [] ) -- Grabs a quote from by for the quotegrabs table. is only necessary if the message isn't sent in the channel itself. 2012-01-10T22:16:08 oh, that 2012-01-10T22:16:14 @quote 2012-01-10T22:16:14 amstan: (quote [] ) -- Returns 's latest quote grab in . is only necessary if the message isn't sent in the channel itself. 2012-01-10T22:16:15 I thought that was an alias lots of channels used 2012-01-10T22:16:31 it depends on their bot and their plugins 2012-01-10T22:16:49 @pydoc map 2012-01-10T22:16:50 amstan: No! 2012-01-10T22:16:54 @load python 2012-01-10T22:16:54 amstan: Error: No plugin named "python" exists. 2012-01-10T22:16:59 @load Python 2012-01-10T22:16:59 amstan: Error: No plugin named "Python" exists. 2012-01-10T22:17:01 :( 2012-01-10T22:18:15 *** cyphase has joined #aichallenge 2012-01-10T22:18:49 *** raemde_ has quit IRC (Read error: Connection reset by peer) 2012-01-10T22:19:16 @math convert parsec womensshoesize 2012-01-10T22:19:16 thestinger: Error: womensshoesize is not a valid unit. 2012-01-10T22:19:24 @math convert parsec shoesizewomens 2012-01-10T22:19:24 thestinger: 3644501080275590144 2012-01-10T22:19:40 @math convert parsec meter 2012-01-10T22:19:40 amstan: 30856775813000000 2012-01-10T22:19:47 @math convert parsec lightsecond 2012-01-10T22:19:47 amstan: 102927125.048 2012-01-10T22:19:50 @math convert parsec lightyear 2012-01-10T22:19:50 amstan: 3.26156377697 2012-01-10T22:20:49 @errno 60 2012-01-10T22:20:49 amstan: ENOSTR (#60): Device not a stream 2012-01-10T22:21:12 @crypt hi 2012-01-10T22:21:12 amstan: wlW/W62XZPFBY 2012-01-10T22:21:52 @list unix 2012-01-10T22:21:52 thestinger: call, crypt, errno, fortune, pid, ping, spell, and wtf 2012-01-10T22:22:34 *** amstan is now known as contestbot_ 2012-01-10T22:22:44 *** contestbot_ is now known as amstan 2012-01-10T22:22:47 ... 2012-01-10T22:22:53 *** contestbot is now known as contestbot_ 2012-01-10T22:23:18 *** contestbot_ is now known as contestbot 2012-01-10T22:23:23 hmm. i see 2012-01-10T22:23:32 @nickcapture 2012-01-10T22:23:33 amstan: You have no gotten any error messages recently, so here's a random one just to let you know that we care. 2012-01-10T22:24:13 oh, fun: http://ubottu.com/stdin/supydocs/plugins/RootWarner.html 2012-01-10T22:24:23 *** replore_ has quit IRC (Remote host closed the connection) 2012-01-10T22:25:06 *** k has joined #aichallenge 2012-01-10T22:25:32 *** k is now known as Guest7349 2012-01-10T22:29:55 Congratulations, the answer you gave to problem 87 is correct. 2012-01-10T22:29:59 hurray for brute force 2012-01-10T22:30:21 yet another victory for my laziness 2012-01-10T22:32:30 *** Fandekasp has joined #aichallenge 2012-01-10T22:32:44 I could optimize it a bit anyway 2012-01-10T22:33:09 there, 20ms faster :P 2012-01-10T22:54:54 92 was way too easy... 2012-01-10T22:55:41 I didn't even use a cache 2012-01-10T23:01:56 *** dvladim has joined #aichallenge 2012-01-10T23:07:19 *** srgpqt has quit IRC (Quit: Lost terminal) 2012-01-10T23:15:17 *** dvladim has quit IRC (Ping timeout: 248 seconds) 2012-01-10T23:17:02 let me see what 87 is 2012-01-10T23:18:43 87 and 92 are both really easy 2012-01-10T23:18:47 mhm, ok. 2012-01-10T23:19:24 I'm at 215. It is a more figurative problem. 2012-01-10T23:21:55 it seems like if you do 215 you should do 256 as well... 2012-01-10T23:24:44 that's too difficult 2012-01-10T23:25:46 *** denysonique_ has quit IRC (Remote host closed the connection) 2012-01-10T23:29:14 hm. I think there is some sort of trick for 256 though. 2012-01-10T23:29:19 *** nickjohnson has quit IRC (Remote host closed the connection) 2012-01-10T23:37:24 *** Jak_o_Shadows has joined #aichallenge 2012-01-10T23:38:24 *** denysonique_ has joined #aichallenge 2012-01-10T23:39:50 *** nickjohnson has joined #aichallenge 2012-01-10T23:47:40 *** Chris_0076 has joined #aichallenge 2012-01-10T23:49:46 *** u_ has quit IRC (Quit: u_) 2012-01-10T23:55:44 *** djr has joined #aichallenge 2012-01-10T23:56:24 *** djr has joined #aichallenge 2012-01-10T23:59:27 *** djr has joined #aichallenge