2012-01-08T00:03:09 *** grc48 has joined #aichallenge 2012-01-08T00:19:45 *** dorisabayon has joined #aichallenge 2012-01-08T00:21:27 *** u_ has quit IRC (Quit: u_) 2012-01-08T00:22:48 *** Fandekasp has quit IRC (Ping timeout: 252 seconds) 2012-01-08T00:55:01 *** raemde has joined #aichallenge 2012-01-08T00:58:32 *** lhb__ has quit IRC (Ping timeout: 240 seconds) 2012-01-08T01:16:15 *** Kahtras has joined #aichallenge 2012-01-08T01:21:41 bah stupid network 2012-01-08T01:21:46 claims ports are open yet they aren't 2012-01-08T01:21:51 including my torrent ones 2012-01-08T01:27:38 *** antimatroid has joined #aichallenge 2012-01-08T01:28:23 *** antimatroid1 has quit IRC (Ping timeout: 240 seconds) 2012-01-08T01:33:28 nm i'm retarded 2012-01-08T01:45:46 *** amstan has quit IRC (Quit: Konversation terminated!) 2012-01-08T01:47:18 *** amstan has joined #aichallenge 2012-01-08T01:47:31 *** ChanServ sets mode: +o amstan 2012-01-08T01:57:14 https://github.com/berak/ants-tcp/blob/master/webserver.py#L478 2012-01-08T01:57:19 i don't get how to add my host ip to that? 2012-01-08T01:57:24 anyone know? 2012-01-08T02:06:13 thestinger: are you around? 2012-01-08T02:07:59 http://www.whatsmyip.org/ 2012-01-08T02:09:21 yeah i can get that 2012-01-08T02:09:31 but it doesn't load for me 2012-01-08T02:09:39 only when i go via 192.168.1.100 2012-01-08T02:09:49 i'm wondering if people outside can access it 2012-01-08T02:23:18 *** Kurnevsky has joined #aichallenge 2012-01-08T02:25:29 antimatroid: did you forward the port to there? 2012-01-08T02:28:38 *** amstan has quit IRC (Ping timeout: 240 seconds) 2012-01-08T02:32:35 *** Palmik has joined #aichallenge 2012-01-08T02:48:35 thestinger: yeah it seems to work 2012-01-08T02:48:39 got pairofdice to load it 2012-01-08T02:49:00 it wont load the external ip from my computer though, i don't understand these things though so not sure if that's to be expected :\ 2012-01-08T02:51:05 what are peoples thoughts about username/botname/versionno for tcp? 2012-01-08T02:51:06 i 2012-01-08T02:51:17 i'm thinking of just leaving it at botname/versionNo 2012-01-08T02:51:28 well, adding in the versionNo 2012-01-08T02:51:38 i like being able to be more anonymous 2012-01-08T03:04:12 *** thestinger has quit IRC (Quit: WeeChat 0.3.6) 2012-01-08T03:20:03 *** Fandekasp has joined #aichallenge 2012-01-08T03:23:25 *** dorisabayon has quit IRC (Ping timeout: 252 seconds) 2012-01-08T03:25:26 *** JamesMG_ has quit IRC (Read error: Connection reset by peer) 2012-01-08T03:28:41 *** JamesMG has joined #aichallenge 2012-01-08T03:47:50 *** Jak_o_Shadows has quit IRC (Ping timeout: 248 seconds) 2012-01-08T03:49:45 *** Jak_o_Shadows has joined #aichallenge 2012-01-08T04:01:50 phiton TCP srver and client very baggy and bad 2012-01-08T04:23:25 *** grc48 has quit IRC (Quit: Leaving) 2012-01-08T04:26:14 Accoun: I'm currently looking at rewriting it, although i have zero idea with this stuff so i can't imagine i'm going to do a very good job 2012-01-08T04:26:23 especially the webserver part 2012-01-08T04:27:46 *** epicmonkey has joined #aichallenge 2012-01-08T04:36:37 *** ruser has quit IRC (Read error: Operation timed out) 2012-01-08T04:40:34 *** ruser has joined #aichallenge 2012-01-08T04:56:19 *** acieroid has quit IRC (Quit: :[) 2012-01-08T04:57:46 Huh? math.sqrt(1) gives 1.0 not 0, there goes that PE #80 solution 2012-01-08T05:03:51 *** ikaros has joined #aichallenge 2012-01-08T05:08:29 Well, that was too easy for an 80 2012-01-08T05:10:07 *** foRei has joined #aichallenge 2012-01-08T05:14:54 not 1* 2012-01-08T05:23:17 man the tcp code is gross 2012-01-08T05:29:17 *** Kurnevsky has quit IRC (Quit: Instantbird 1.0) 2012-01-08T05:39:34 *** choas has joined #aichallenge 2012-01-08T05:53:02 *** kire has joined #aichallenge 2012-01-08T06:01:44 *** kilae has joined #aichallenge 2012-01-08T06:20:23 *** dorisabayon has joined #aichallenge 2012-01-08T06:22:14 *** Redgis has joined #aichallenge 2012-01-08T06:23:22 *** Fandekasp has quit IRC (Ping timeout: 240 seconds) 2012-01-08T06:25:36 *** X-Scale has quit IRC (Remote host closed the connection) 2012-01-08T06:29:52 *** kire has quit IRC (Quit: Leaving) 2012-01-08T06:32:05 *** replore has joined #aichallenge 2012-01-08T06:38:33 *** nickjohnson has joined #aichallenge 2012-01-08T07:23:57 *** sigh has quit IRC (Remote host closed the connection) 2012-01-08T07:24:45 *** sigh has joined #aichallenge 2012-01-08T07:24:49 *** dr- has quit IRC (Ping timeout: 240 seconds) 2012-01-08T07:28:37 *** dorisabayon has quit IRC (Ping timeout: 248 seconds) 2012-01-08T07:29:17 *** Fandekasp has joined #aichallenge 2012-01-08T07:30:32 *** dr- has joined #aichallenge 2012-01-08T07:48:06 *** Jak_o_Shadows has quit IRC (Remote host closed the connection) 2012-01-08T08:15:35 *** antbuilder has joined #aichallenge 2012-01-08T08:16:15 hello room 2012-01-08T08:16:23 hello 2012-01-08T08:16:41 *** AntMan_ has joined #aichallenge 2012-01-08T08:16:57 hey 2012-01-08T08:17:36 does any of you have any experience with the java starter package of the ant builder? 2012-01-08T08:17:46 i mean the ant challenge* 2012-01-08T08:19:23 because i have tried to implement an A* algorithm in the code, after following the tutorial, however, my bot does not do anything anymore 2012-01-08T08:43:02 *** antbuilder has quit IRC (Quit: Page closed) 2012-01-08T08:47:13 *** TheLinker has joined #aichallenge 2012-01-08T09:04:17 *** aeter has joined #aichallenge 2012-01-08T09:09:09 *** AlliedEnvy has quit IRC (Read error: Connection reset by peer) 2012-01-08T09:10:14 *** AlliedEnvy has joined #aichallenge 2012-01-08T09:10:18 *** mceier has joined #aichallenge 2012-01-08T09:14:17 *** AntMan_ has quit IRC (Ping timeout: 258 seconds) 2012-01-08T09:14:52 *** conor_f has joined #aichallenge 2012-01-08T09:20:36 *** dorisabayon has joined #aichallenge 2012-01-08T09:23:56 *** Fandekasp has quit IRC (Ping timeout: 240 seconds) 2012-01-08T09:26:33 *** mleise has joined #aichallenge 2012-01-08T09:36:22 lol, fear and loathing in las vegas 2012-01-08T09:36:48 "What?! No! We can't stop here! This is bat country." 2012-01-08T09:40:38 I never quite got that quote, are bats supposed to be scary? 2012-01-08T09:41:19 nah, I think it's the fact that they were "giant bats" and they appeared out of nowhere in the middle of the desert 2012-01-08T09:41:40 and maybe a bit of parinoia from all the drugs lol 2012-01-08T09:42:28 Drugs would explain most of it, yes 2012-01-08T09:43:12 heh, drugs explains just about everything in that film :) 2012-01-08T09:43:18 have you read the book? 2012-01-08T09:44:22 Nah 2012-01-08T09:45:01 * conor_f needs to go find a free ebook of it 2012-01-08T09:45:19 *** srgpqt has joined #aichallenge 2012-01-08T09:53:00 *** Blkt has joined #aichallenge 2012-01-08T09:53:45 good day everyone 2012-01-08T09:55:27 hi Blkt 2012-01-08T09:55:35 :D 2012-01-08T09:56:01 The Pemba flying fox is one big bat with a wingspan of up to 5 1/2 feet 2012-01-08T09:56:52 They were also very tasty according to local cuisine 2012-01-08T09:57:56 *** aeter has quit IRC (Quit: Leaving.) 2012-01-08T09:57:57 And a herbivore, also very rare 2012-01-08T10:02:29 look at that: http://www.youtube.com/watch?v=UROVfmY3NTA, funny comment: Joker: "Its simple: We kill the Batman." - Centipede: "Ok" 2012-01-08T10:03:17 a bat eating centipede.... 2012-01-08T10:03:29 do you want me to ever sleep again in my life?!? 2012-01-08T10:03:31 Those are fucking creepy 2012-01-08T10:04:06 dear god. I'm not the most squeamish of people 2012-01-08T10:04:32 but did you watch that video? theres bugs _everywhere_ 2012-01-08T10:04:44 Guano eating bugs 2012-01-08T10:04:51 Fucked if you thinkn I'd be the cameraman... 2012-01-08T10:04:51 * antimatroid just discovered chuck 2012-01-08T10:05:37 g++'s -g option is the best thing <3 2012-01-08T10:06:22 especially since I learned to use gdb :) 2012-01-08T10:21:16 *** kire has joined #aichallenge 2012-01-08T10:24:10 *** mcstar has joined #aichallenge 2012-01-08T10:27:15 *** dici has joined #aichallenge 2012-01-08T10:33:25 *** dici has quit IRC (Read error: Connection reset by peer) 2012-01-08T10:37:21 *** aeter has joined #aichallenge 2012-01-08T10:53:46 *** u_ has joined #aichallenge 2012-01-08T10:57:35 Programming with unicode: "Your cards are: ♠8 ♠9 ♣9 ♣J ♢Q ♣Q ♢K ♠K" 2012-01-08T10:59:24 It would be an unreadable mess in ascii 2012-01-08T11:00:54 Still has 2 squares for me :/ 2012-01-08T11:05:14 Your cards are: ♠8 ♠9 ♣9 ♣J ♢Q ♣Q ♢K ♠K 2012-01-08T11:05:32 no hearts or diamonds 2012-01-08T11:05:48 ♢ 2012-01-08T11:05:54 this is the diamond 2012-01-08T11:05:58 square 2012-01-08T11:06:04 sorry 2012-01-08T11:06:10 it's very vague and grey 2012-01-08T11:06:44 conor_f: did you solve the problem? 2012-01-08T11:06:57 which? 2012-01-08T11:07:04 wedge/point mass 2012-01-08T11:07:13 no -_- 2012-01-08T11:08:16 I hate wedges with a passion 2012-01-08T11:30:17 http://codepad.org/E0J60YoN 2012-01-08T11:30:32 for PE #23 2012-01-08T11:30:38 it should work 2012-01-08T11:30:49 and yes, set tabstop=4 2012-01-08T11:30:57 and yes that code will take ages to run 2012-01-08T11:31:14 any ideas why it's not working? 2012-01-08T11:35:25 conor_f: d^2x/dt^2=g tan(a)(1+m/M)/(1/tan(a)-tan(a)(1+m/M))/M 2012-01-08T11:35:37 thats what i get 2012-01-08T11:35:43 im not sure if its correct 2012-01-08T11:36:01 it was literally ages since i did these kinds of stuff 2012-01-08T11:36:36 but i was very fast in these in high school, almost always the first 2012-01-08T11:36:47 heh 2012-01-08T11:36:48 i wonder what happened... 2012-01-08T11:36:55 competetitive ;) 2012-01-08T11:37:07 conor_f: dont drink when you get into university 2012-01-08T11:37:07 I'll try it again later maybe 2012-01-08T11:37:10 lol 2012-01-08T11:37:16 *** g0llum has joined #aichallenge 2012-01-08T11:37:24 s/university/high school :P 2012-01-08T11:37:48 woooow 2012-01-08T11:37:51 I'm retarded 2012-01-08T11:37:53 >_< 2012-01-08T11:38:19 instead of summing them all up, just use n(n-1)/2 to add up everything from 1 to 28123 2012-01-08T11:38:27 and then take away all the abundant numbers lol 2012-01-08T11:39:44 *** Kurnevsky has joined #aichallenge 2012-01-08T11:40:08 *n(n+1)/2 2012-01-08T11:41:44 *** dorisabayon has quit IRC (Ping timeout: 252 seconds) 2012-01-08T11:48:02 *** choas has quit IRC (Ping timeout: 240 seconds) 2012-01-08T11:57:48 *** kire has quit IRC (Remote host closed the connection) 2012-01-08T12:18:08 *** choas has joined #aichallenge 2012-01-08T12:21:58 *** Paradoxiality has joined #aichallenge 2012-01-08T12:36:43 *** aeter has quit IRC (Ping timeout: 252 seconds) 2012-01-08T12:38:36 *** aeter has joined #aichallenge 2012-01-08T12:40:19 *** grwip has joined #aichallenge 2012-01-08T12:41:52 *** sofuture has joined #aichallenge 2012-01-08T12:42:56 *** denysonique_ has joined #aichallenge 2012-01-08T12:46:44 *** thestinger has joined #aichallenge 2012-01-08T13:03:22 *** sashaSochka has joined #aichallenge 2012-01-08T13:08:30 drink all the alcohol 2012-01-08T13:12:50 http://projecteuler.net/problem=61 another one of these :) 2012-01-08T13:12:58 *** X-Scale has joined #aichallenge 2012-01-08T13:16:34 thestinger: lol, these problems are so stupid, yet I'm compelled to do them :P 2012-01-08T13:16:55 54 was really fun 2012-01-08T13:17:55 heh 2012-01-08T13:18:17 *** aeter has quit IRC (Quit: Leaving.) 2012-01-08T13:18:21 that is actually the most useful one I've seen (still not very useful though :P) 2012-01-08T13:18:56 well you end up with a program that can rank poker hands 2012-01-08T13:19:00 but still, wouldn't it be better if they asked you to code how much to bet? 2012-01-08T13:19:09 given a hand 2012-01-08T13:19:26 they need to have questions with one answer 2012-01-08T13:19:42 yeah, a limitation of the site 2012-01-08T13:19:59 thats what makes spoj.pl a bit superior 2012-01-08T13:20:06 The use of that site isn't in practical applications... 2012-01-08T13:20:08 but I prefer PE overall 2012-01-08T13:20:31 thestinger: i could get my haskell one for 74 down to 8.5 secs vs yours 8.0(pypy) 2012-01-08T13:21:18 thestinger: the weird thing was that testing a list/set/map/hashmap for membership for the cycle detection, didnt matter 2012-01-08T13:21:22 mcstar: I tried 74 yesterday in C. Manage to get it down to 0.050s at 1.7GHz 2012-01-08T13:21:48 X-Scale: what data structure do yo use? 2012-01-08T13:21:54 damn, cold fingerds 2012-01-08T13:22:04 well, lets see how fast it is if I rewrite it in C++ :P 2012-01-08T13:22:54 thestinger: i think haskell didnt like that i have to create those structures a million times 2012-01-08T13:23:02 *** aeter has joined #aichallenge 2012-01-08T13:23:04 I used memoization on a simple array of unsigned chars for the main table. Another array for the 0..9 factorials, and another array to store temporary partial chains. 2012-01-08T13:23:14 so their better membership complexity didnt shop up 2012-01-08T13:23:27 yeah 2012-01-08T13:23:34 simple damn vectors 2012-01-08T13:23:36 lol 2012-01-08T13:23:47 hashmaps and balanced trees can suck my finger 2012-01-08T13:25:06 *** alehorst has joined #aichallenge 2012-01-08T13:25:31 meh, I'm too lazy lol 2012-01-08T13:25:43 oh wait nvm 2012-01-08T13:25:51 it will be easy, my hash table is already basically an array 2012-01-08T13:25:58 thestinger $! program 2012-01-08T13:26:07 *** mceier has quit IRC (Quit: leaving) 2012-01-08T13:26:08 *** sashaSochka has quit IRC (Ping timeout: 258 seconds) 2012-01-08T13:27:01 http://codepad.org/chx5pAJU 2012-01-08T13:27:17 can anyone see the problem with that? It's failing 2012-01-08T13:27:52 sum all the integers that can't be represented by the sum of 2 abundant numbers 2012-01-08T13:30:09 also, I know it would be slow 2012-01-08T13:30:22 but it's only going through 1 number a second.... 2012-01-08T13:32:45 you should put the sums into a set 2012-01-08T13:32:50 or at least sort them 2012-01-08T13:33:02 yeah 2012-01-08T13:33:12 if they were in a set I wouldn't have any duplicates alright 2012-01-08T13:33:15 but still 2012-01-08T13:33:17 conor_f: what's that problem # ? 2012-01-08T13:33:23 23 2012-01-08T13:33:26 thx 2012-01-08T13:34:06 mcstar: >_< 2012-01-08T13:34:24 i dont see an error so far 2012-01-08T13:34:31 a simple break if the abundant sum is greater then i would make things a lot faster I imagine :/ 2012-01-08T13:34:34 its not the way id do it, but.. 2012-01-08T13:35:46 *** sashaSochka has joined #aichallenge 2012-01-08T13:36:28 a lot faster, but also wrong 2012-01-08T13:38:41 mcstar: on 74, they forgot to mention that 1, 2 and 40585 also have the same 1-cycle property as 145. 2012-01-08T13:38:55 and 0 2012-01-08T13:39:08 ah no 2012-01-08T13:39:17 0!=1 1!=1 2012-01-08T13:39:22 lol 2012-01-08T13:39:27 0 doesnt cycle 2012-01-08T13:40:01 I spotted 1 and 2 cases before testing, because they were trivial. But the 40585 demanded a simple GDB session as the program was in an infinite loop. :P 2012-01-08T13:40:03 Right 2012-01-08T13:43:03 conor_f: i dont know really 2012-01-08T13:43:16 seems logically correct to me 2012-01-08T13:43:51 yeah 2012-01-08T13:43:56 its not an overflow 2012-01-08T13:46:30 PE#23 sounds interesting. Specially finding a fast way of creating the sum of all proper divisors of a large number set. 2012-01-08T13:47:17 I just brute forced that one 2012-01-08T13:47:18 mcstar: I think I found the problem 2012-01-08T13:47:38 23 takes 500ms in python 2012-01-08T13:47:44 a stupid mistake 2012-01-08T13:47:48 thestinger: :O 2012-01-08T13:47:52 whats that? 2012-01-08T13:47:57 brute force? 2012-01-08T13:48:01 conor_f: you're doing factoring in a really bad way :P 2012-01-08T13:48:07 lol, yes 2012-01-08T13:48:10 but still 2012-01-08T13:48:23 you could start by just finding the lower factors and getting the higher ones from that 2012-01-08T13:48:27 the difference between like, 3 mins and counting and 500 ms? 2012-01-08T13:48:42 just takes one infinite loop 2012-01-08T13:48:49 so you turn n into sqrt(n) 2012-01-08T13:49:05 anyway, you can get divisors in better ways than that 2012-01-08T13:49:09 Yeah, you don't need to go past sqrt(n) at all 2012-01-08T13:49:26 yeah, I knew that 2012-01-08T13:49:36 but thats not whats taking the time 2012-01-08T13:49:49 are you sure? 2012-01-08T13:49:56 yes 2012-01-08T13:50:00 certain 2012-01-08T13:50:02 how do you check if a number is abundant 2012-01-08T13:50:04 that takes less then a second 2012-01-08T13:50:13 sum all its divisors 2012-01-08T13:50:24 and then if it's greater then the base 2012-01-08T13:50:28 simpley as that 2012-01-08T13:50:36 all that is done in < 1 second 2012-01-08T13:50:50 and summing them all and putting them into a vector 2012-01-08T13:51:12 a vector..? 2012-01-08T13:51:12 it's the sorting of the vector and the checking for non-abundant numbers thats killing it 2012-01-08T13:51:21 so you are doing a linear search over it? 2012-01-08T13:51:29 yes 2012-01-08T13:51:56 well, use a proper data structure where it's O(1) to check if something is in it, not O(n) 2012-01-08T13:52:22 http://codepad.org/lS0OD2MD 2012-01-08T13:52:24 std::hash is a perfect hash for unsigned ints 2012-01-08T13:52:29 or you could just use a bit/bool array 2012-01-08T13:52:58 conor_f: what was the problem? 2012-01-08T13:53:29 conor_f: well, I'm too lazy to figure out what your code does :P 2012-01-08T13:53:49 thestinger: i looked over it and found no logical errors 2012-01-08T13:54:51 mcstar: what I said at 33 of this hour 2012-01-08T13:54:58 about checking if it was greater 2012-01-08T13:55:09 (line 42 in the most recent paste 2012-01-08T13:56:06 I hadn't the vector sorted so it wasn't checking it correctly 2012-01-08T13:56:17 still doesn't explain why it's so incredibly slow though.... 2012-01-08T13:57:31 well, you should use a better data structure 2012-01-08T13:58:54 yes 2012-01-08T13:58:56 I should 2012-01-08T14:00:47 if(j == abundant_numbers.size()-1) 2012-01-08T14:00:57 if(j == abundant_numbers_sums.size()-1) 2012-01-08T14:01:16 i think this was the problem 2012-01-08T14:01:23 the sorting inst necessairy 2012-01-08T14:01:37 and that other check is redundant also 2012-01-08T14:01:40 i think 2012-01-08T14:01:49 oh ffs 2012-01-08T14:01:53 tyvm mcstar 2012-01-08T14:02:04 i missed this th efirst time 2012-01-08T14:02:17 weird, I think I found a pypy bug 2012-01-08T14:02:37 mcstar: both checks are needed 2012-01-08T14:02:51 stops line 42 being a seg fault 2012-01-08T14:03:00 *accessing an element outside the array 2012-01-08T14:03:04 not always seg faults 2012-01-08T14:03:26 use libmudflap 2012-01-08T14:03:29 catches all that stuff 2012-01-08T14:04:16 gcc -fmudflap -o test test.c -lmudflap 2012-01-08T14:04:32 well, not sure how well it works with C++ 2012-01-08T14:04:53 lol 2012-01-08T14:04:57 never heard of that 2012-01-08T14:05:29 it's better than crappy valgrind because it builds in checks for each array 2012-01-08T14:05:40 so it doesn't have false positives and doesn't miss stuff 2012-01-08T14:05:59 huh 2012-01-08T14:06:05 *** aeter has quit IRC (Quit: Leaving.) 2012-01-08T14:06:29 funny how there are programs debugging your programs all running under some program :P 2012-01-08T14:06:36 computes amaze me from time to time 2012-01-08T14:06:50 well, it's a library 2012-01-08T14:06:56 yeah 2012-01-08T14:07:51 my codes speed makes me want to cry 2012-01-08T14:08:15 especially when theres a much easier way to do it but I'm not bothered coding it 2012-01-08T14:08:33 answer = n(n+1)/2; 2012-01-08T14:08:58 and then just take all the unique values in abundant_numbers_sums away from it 2012-01-08T14:13:58 lol, did it and got it right :P 2012-01-08T14:14:05 I should make more of an effort :| 2012-01-08T14:25:17 conor_f: http://codepad.org/aasTIC1Z 2012-01-08T14:25:54 ugh... C++ 2012-01-08T14:26:33 sum(map(factorial, map(int, str(current_n)))) <- I like how that becomes 5 lines, and I have to use to_string and c_to_i functions 2012-01-08T14:26:49 mcstar: runtime? 2012-01-08T14:26:59 1.4sec 2012-01-08T14:27:03 I clearly use map too little (not at all) 2012-01-08T14:27:24 heh, same here pairofdice :P 2012-01-08T14:27:34 it was the same with vectors 2012-01-08T14:27:38 set/map aren't very useful, unordered_set and unordered_map are though 2012-01-08T14:27:40 i told you that would fix it 2012-01-08T14:27:42 http://codepad.org/s3IUrhwp 2012-01-08T14:27:45 thats mine 2012-01-08T14:27:48 pairofdice: don't you use lots of sets and dicts in python? :P 2012-01-08T14:27:53 but if i didnt change the vector to set, thestinger would tkae my head off 2012-01-08T14:27:54 Sure 2012-01-08T14:28:09 runtime 30 seconds lol :P 2012-01-08T14:28:19 mcstar: well, or use an array as a hash table :) 2012-01-08T14:28:31 But I'm only at the DDK pythonista level 2012-01-08T14:28:59 well my solution is 1.6s now for 74 2012-01-08T14:31:15 you all need to do 54 2012-01-08T14:31:24 best problem I've done so far 2012-01-08T14:32:36 heh 2012-01-08T14:34:16 it looks difficult enough 2012-01-08T14:34:27 well, long enough anyways 2012-01-08T14:34:29 no it was pretty easy 2012-01-08T14:34:32 just took a while 2012-01-08T14:34:34 but it was fun 2012-01-08T14:34:39 im tired by looking at the long description 2012-01-08T14:34:41 11+ functions in C++ methinks 2012-01-08T14:34:50 mcstar: well, I can explain it in a sentence 2012-01-08T14:34:53 no 2012-01-08T14:34:53 mcstar: who wins a hand of poker 2012-01-08T14:34:57 thats it :P 2012-01-08T14:35:02 i dont care 2012-01-08T14:35:07 XD 2012-01-08T14:35:27 http://projecteuler.net/project/poker.txt each line is 2 poker hands (split in the middle), count the number of times the hand on the left wins :P 2012-01-08T14:36:04 conor_f: anyway, that's the perfect place to use std::unordered_map 2012-01-08T14:36:38 for the problem I just did or the poker one? 2012-01-08T14:36:44 I ended up making cards_by_suit and cards_by_value for each hand 2012-01-08T14:36:46 conor_f: the poker one 2012-01-08T14:37:25 anyway I'm going to rewrite it in C++ for fun 2012-01-08T14:37:33 lol 2012-01-08T14:37:38 what did you do it in? 2012-01-08T14:37:45 python 2012-01-08T14:37:52 ah 2012-01-08T14:37:56 takes 50ms anyway 2012-01-08T14:38:09 I need to do one more problem tonight :@ 2012-01-08T14:38:17 just want to get to level 1 lol :P 2012-01-08T14:39:09 I need to do 1 more for level 3 but I'm too lazy 2012-01-08T14:39:17 lol 2012-01-08T14:39:32 first level 1, then catch up with rwest_ ;) 2012-01-08T14:39:49 I "solved" 51 but it was taking more than 10s so I cancelled it 2012-01-08T14:40:10 lol 2012-01-08T14:40:16 I thought the limit was 1 minute? 2012-01-08T14:40:52 I'm not that patient 2012-01-08T14:41:27 *** aeter has joined #aichallenge 2012-01-08T14:41:55 22 shouldn't be too bad 2012-01-08T14:42:26 oh, that one was easy 2012-01-08T14:42:33 it's a one liner in python 2012-01-08T14:42:53 Yeah, pretty easy 2012-01-08T14:42:56 most of the ones I've done are just a single list comprehension thing though 2012-01-08T14:43:15 maybe 2-3 nested ones 2012-01-08T14:43:33 Nice work, strcat, you've just advanced to Level 3. 2012-01-08T14:43:35 :) 2012-01-08T14:43:48 ./solution.py 6.31s user 0.11s system 99% cpu 6.423 total 2012-01-08T14:43:51 anyway it was only 6s 2012-01-08T14:44:01 in pypy 2012-01-08T14:44:19 in cpython, it's 45s 2012-01-08T14:45:21 thestinger: that's #51 ? 2012-01-08T14:45:41