Idea Transcript
Archives: [ cgl / g / mu ]
/g/ - Technology
4chan
Index
Ghost
Gallery
Bans
FAQ
Search or insert post number
Stats
pro/g/ramming general Anonymous Fri 14 Mar 2014 05:54:15 No.40801483
View
Reply
Original
Report
[326 / 26]
Quoted By: >>40801647 >>40801751 >>40801820 >>40802325 >>40804652 >>40804659 >>40805283 >>40807191 >>40807596 >>40807607 >>40810765 >>40810851 >>40812158 >>40812901 >>40812939 >>40813684 >>40816020 >>40818791 >>40821282 >>40822336 >>40823557 >>40823659 >>40824519 >>40829829 >>40833064 >>40833429 >>40833464 >>40835129 >>40835202 >>40835232 >>40835275 >>40835988 >>40836011 >>40836061 >>40836069 >>40836133 >>40836175 >>40836194
complete a project and learn to dream in code! Anonymous Fri 14 Mar 2014 05:55:14 No.40801499
269KiB, 1920x1080, programmingprojects1.png
View Same
Google
ImgOps
iqdb
Report
Quoted By: >>40801568
SauceNAO
Does anyone have a mirror of learn python the hard way? Ive only got a few more lessons to go and the site went down Anonymous Fri 14 Mar 2014 05:57:00 No.40801536
Report
Quoted By: >>40801568 >>40835079
We should get more pictures, with challenges sorted by difficulty level and subject (e.g. networking, OS, algorithms, 3D, etc.) and paste them to the wiki. Anonymous Fri 14 Mar 2014 05:59:15 No.40801568
Report
Quoted By: >>40801627
>>40801499 http://foss.rit.edu/files/LearnPythonTheHardWay.pdf >>40801536 do you want to write down the easy ones then? Anonymous Fri 14 Mar 2014 06:02:15 No.40801627
Report
Quoted By: >>40801702
>>40801568 I think it'd be better if we had a mechanism where people would vote on the difficulty, than for a few to decide how difficult the problem should be for others. But 4chan hasn't got a reputation for leaving internet voting mechanisms alone, so maybe it's not doable. Anonymous Fri 14 Mar 2014 06:03:31 No.40801647
Report
>>40801483 rolling wut weeaboo !D1JFJ6.g/. Fri 14 Mar 2014 06:04:15 No.40801663
Report
yeah this isnt going to happen but ill roll Anonymous Fri 14 Mar 2014 06:05:45 No.40801691
Report
Quoted By: >>40801756
yeah this isnt going to happen but ill roll anyway Anonymous Fri 14 Mar 2014 06:06:15 No.40801702
Report
Quoted By: >>40801744
>>40801627 that'd be better, but the threads not exactly popular enough right now. there's a handful which are objectively intro-tier projects, though. Anonymous Fri 14 Mar 2014 06:08:29 No.40801744
Report
Quoted By: >>40801825
>>40801702 I would say anything like Fizzbuzz, 100 factorial, reverse a string etc. is. But there is some stuff in there that I wouldn't know how to do, such as the telnet server or mandelbrot fractal. View Same
Google
ImgOps
iqdb
SauceNAO
spheres1.jpg, 564KiB, 1920x1080
Anonymous Fri 14 Mar 2014 06:09:59 No.40801751
Report
Quoted By: >>40801774 >>40801994
>>40801483 Should add real-time raymarcher in there somewhere. You can make something that looks nice in a short amount of time with little effort. There are even websites like glsl.heroku.com or www.shadertoy.com where you can start writing a ray-marched program in minutes. here are a couple of mine: https://www.shadertoy.com/view/MsB3Dc https://www.shadertoy.com/view/4sSGDc https://www.shadertoy.com/view/4djGWV Anonymous Fri 14 Mar 2014 06:09:15 No.40801756
Report
Quoted By: >>40801777
>>40801691 i dont even know what that is im rolling again View Same
Google
ImgOps
iqdb
SauceNAO
dispersion5.jpg, 245KiB, 1920x1080
Anonymous Fri 14 Mar 2014 06:10:59 No.40801774
Report
Quoted By: >>40801797
>>40801751 Anonymous Fri 14 Mar 2014 06:10:59 No.40801777
Report
>>40801756 ...one more time View Same
Google
ImgOps
iqdb
SauceNAO
raytrace.jpg, 494KiB, 1920x1080
Anonymous Fri 14 Mar 2014 06:11:59 No.40801797
Report
>>40801774
Anonymous Fri 14 Mar 2014 06:12:44 No.40801820
Report
>>40801483 roll Anonymous Fri 14 Mar 2014 06:13:59 No.40801825
Report
Quoted By: >>40814454
>>40801744 exactly, those are intermediate/advanced. easy are imo: 0,1,2,3,5,11,13,14,15,17,20,24,27,28,35,40,43,87,93. common sense, and first semester CS stuff Anonymous Fri 14 Mar 2014 06:16:29 No.40801880
Report
roll Anonymous Fri 14 Mar 2014 06:24:14 No.40801994
Report
Quoted By: >>40802116
>>40801751 Is raymarching where you project a ray out from every pixel? Anonymous Fri 14 Mar 2014 06:25:59 No.40802008
Report
Quoted By: >>40802057
rolling for a fun one Anonymous Fri 14 Mar 2014 06:28:44 No.40802057
Report
Quoted By: >>40802076 >>40802542 >>40802935
>>40802008 name1 = raw_input("Enter your name: ") name2 = raw_input("Enter your love's name: ") print "Calculating..." print "She doesn't love you."
Anonymous Fri 14 Mar 2014 06:29:44 No.40802076
Report
>>40802057 #rekt Anonymous Fri 14 Mar 2014 06:32:14 No.40802116
Report
>>40801994 yeah, its like ray-tracing but entirely done on the GPU with no CPU involvement. it's actually easier than it sounds on the GPU, the only trade off is that all objects have to mathematically described instead of by a 3d mesh made out of vertices. the benefits are perfectly smooth objects, easy lighting algorithms and the ability to render volumetric objects like smoke and clouds Anonymous Fri 14 Mar 2014 06:36:59 No.40802194
Report
Quoted By: >>40802255
roll Anonymous Fri 14 Mar 2014 06:38:14 No.40802240
Report
rolling. Anonymous Fri 14 Mar 2014 06:39:14 No.40802255
Report
>>40802194 shit project, get rid of it. Anonymous Fri 14 Mar 2014 06:42:30 No.40802325
Report
Quoted By: >>40802368
>>40801483 hope something not too hard Anonymous Fri 14 Mar 2014 06:44:44 No.40802368
Report
>>40802325 reroll Anonymous Fri 14 Mar 2014 06:47:59 No.40802406
Report
roll Anonymous Fri 14 Mar 2014 06:49:59 No.40802445
Report
rolll View Same
Google
ImgOps
iqdb
SauceNAO
1332650776875.jpg, 62KiB, 697x463
Anonymous Fri 14 Mar 2014 06:54:14 No.40802542
Report
>>40802057 Hah.
Anonymous Fri 14 Mar 2014 07:17:44 No.40802935
Report
Quoted By: >>40839922
>>40802057 As a fun way to give the calculation some time, implement a collatz conjecture using the lengths of the 2 names as a initial number. Anonymous Fri 14 Mar 2014 07:30:14 No.40803160
Report
Quoted By: >>40803342
r-roll Anonymous Fri 14 Mar 2014 07:34:29 No.40803230
Report
yolo Anonymous Fri 14 Mar 2014 07:41:00 No.40803342
Report
>>40803160
Anonymous Fri 14 Mar 2014 07:48:45 No.40803450
Report
Quoted By: >>40813340
any idea how we could implement a checklist system for everyone, given an ID, and some front end giving inputs and expecting a specific output, for some of these challenges? Anonymous Fri 14 Mar 2014 08:23:29 No.40803933
Report
rollon Anonymous Fri 14 Mar 2014 09:03:14 No.40804532
Report
Quoted By: >>40804583
rrolling Anonymous Fri 14 Mar 2014 09:04:45 No.40804553
Report
rrll Anonymous Fri 14 Mar 2014 09:06:14 No.40804582
Report
Quoted By: >>40804602
>programming 101 shit You want those to be challenging? Do them in brainfuck. Anonymous Fri 14 Mar 2014 09:06:30 No.40804583
Report
>>40804532 did this, reroll Anonymous Fri 14 Mar 2014 09:07:30 No.40804602
Report
>>40804582 Do your challenge in brainfuck faggot. Anonymous Fri 14 Mar 2014 09:09:30 No.40804620
Report
I know some C, C++, C# and Python, i want to complete those challenges in one, which one of those should I use, or should I use another one? Anonymous Fri 14 Mar 2014 09:11:30 No.40804642
Report
Just had my first Java class today, here we go. Anonymous Fri 14 Mar 2014 09:12:29 No.40804652
Report
>>40801483 ROLL Anonymous Fri 14 Mar 2014 09:13:15 No.40804659
Report
Quoted By: >>40804674
>>40801483 rolling Anonymous Fri 14 Mar 2014 09:14:45 No.40804672
Report
Rolling for Lua. Sick of Python. Scheme/Rust/C next, probably. Anonymous Fri 14 Mar 2014 09:14:45 No.40804674
Report
>>40804659 reroll View Same
Google
ImgOps
iqdb
SauceNAO
roll.png, 192KiB, 335x273
Anonymous Fri 14 Mar 2014 09:15:59 No.40804678
Anonymous Fri 14 Mar 2014 09:17:14 No.40804703
Report
Report
Quoted By: >>40804731 >>40804851
rolll Anonymous Fri 14 Mar 2014 09:18:45 No.40804725
Report
Rolling Anonymous Fri 14 Mar 2014 09:19:59 No.40804731
Report
>>40804703 reroll Anonymous Fri 14 Mar 2014 09:27:14 No.40804845
Report
Let's give it a go Anonymous Fri 14 Mar 2014 09:27:29 No.40804851
Report
>>40804703 test a = 0 testing b = 0 [code] or
test dddd = 0 test cccccc = 0
[/code] View Same
Google
ImgOps
iqdb
SauceNAO
1392350159950.jpg, 63KiB, 500x600
Anonymous Fri 14 Mar 2014 09:34:59 No.40804923
Report
Quoted By: >>40813370
>Rolled Dijkstra's Algo the other day >Learn about heaps and heapsort >Learn how to implement priority queue >Can't figure out how to get neighbor nodes from priority queue efficiently Gave up on the PQ, made it work anyway. http://pastebin.com/GqgWzv1j Anonymous Fri 14 Mar 2014 09:35:14 No.40804939
Report
rolling Anonymous Fri 14 Mar 2014 09:35:14 No.40804942
Report
rolling d100 Anonymous Fri 14 Mar 2014 09:37:29 No.40804969
Report
no whammy Anonymous Fri 14 Mar 2014 09:38:45 No.40804983
Report
roll View Same
Google
ImgOps
iqdb
SauceNAO
1385555010908.jpg, 33KiB, 314x314
/g/'s newest trip !ZvEa5050Y. Fri 14 Mar 2014 10:02:59 No.40805283
Report
>>40801483 rolling for dubs
Anonymous Fri 14 Mar 2014 10:05:14 No.40805328
Report
Quoted By: >>40805642 >>40806295
>any of that shit >large enough to be projects lol Anonymous Fri 14 Mar 2014 10:08:00 No.40805357
Report
rolling roeumbe they Anonymous Fri 14 Mar 2014 10:09:44 No.40805382
Report
rolls Anonymous Fri 14 Mar 2014 10:32:30 No.40805642
Report
>>40805328 Oh fuck off, you little cunt, it's just a word. Anonymous Fri 14 Mar 2014 10:40:14 No.40805728
Report
Quoted By: >>40806398
rell Anonymous Fri 14 Mar 2014 11:17:29 No.40806295
Report
>>40805328 So what's big enough? How many lines of code? Anonymous Fri 14 Mar 2014 11:26:29 No.40806398
Report
Quoted By: >>40806428
>>40805728 #!/usr/bin/python for i in range(2,101): val = 1 for i in range (1,i): val = val*i print val
Anonymous Fri 14 Mar 2014 11:26:29 No.40806401
Report
He guys, should I bother using the new cc65 and writing applications for C64 and NES, or should I try writing code for SNES instead? The thing is the NES has much simpler hardware by design (in Arch's definition of simple), followed by C64, both of which share the same CPU architecture, the 6502. Anonymous Fri 14 Mar 2014 11:28:53 No.40806428
Report
Quoted By: >>40806564
>>40806398 actually.. #!/usr/bin/python val = 1 for i in range(1,101): val = val*i print val
Anonymous Fri 14 Mar 2014 11:42:59 No.40806564
Report
Quoted By: >>40806606
>>40806428 > Not using this val = 1 for i in range(1,101): val *= i print val
Anonymous Fri 14 Mar 2014 11:45:59 No.40806596
Report
Rolling for some easy shit Anonymous Fri 14 Mar 2014 11:46:29 No.40806606
Report
Quoted By: >>40806652
>>40806564 >not using this from math import factorial for i in range(1,101): print factorial(i)
Anonymous Fri 14 Mar 2014 11:47:01 No.40806609
Report
Quoted By: >>40806882
dicking with open cv learning C //sudo gcc cam.c -o example `pkg-config --cflags --libs opencv` #include #include #include "cv.h" #include "ml.h" #include "cxcore.h" #include "highgui.h"
double (*down_sample(IplImage* pix_frame))[32][32]{
CvScalar sam; double (*ptr)[32][32]; ptr=malloc(3*32*32 *sizeof(double)); int x; int y; int x_i; int y_i; for (x = 0; x < 640; x=x+20){ for (y = 0; y >40806606 Why would you use an entire function to replace one arithmetic command? Python users sure are retarded. Anonymous Fri 14 Mar 2014 11:53:30 No.40806676
Report
Quoted By: >>40806821
>>40806652 Because it looks more readable, autist. Anonymous Fri 14 Mar 2014 12:06:14 No.40806821
Report
>>40806676 Not really, but if you insist. Who knows how factoral() is computed. Maybe I would will get NaN sooner from doing arithmetic than that, but it's still faster. Anonymous Fri 14 Mar 2014 12:12:14 No.40806882
Report
>>40806609 Are you a wizard? View Same
Google
ImgOps
iqdb
SauceNAO
1386393024431.jpg, 756KiB, 2272x1704
Anonymous Fri 14 Mar 2014 12:25:29 No.40807000
Report
Quoted By: >>40807518
Rolling
Sprylitol !!nwiJ16o+sFJ Fri 14 Mar 2014 12:36:14 No.40807094
Report
Quoted By: >>40807157
Need to work on java, rolling Sprylitol !!nwiJ16o+sFJ Fri 14 Mar 2014 12:48:14 No.40807157
Report
>>40807094 well fuck that, reroll Anonymous Fri 14 Mar 2014 12:51:14 No.40807175
Report
Quoted By: >>40807194
roll Anonymous Fri 14 Mar 2014 12:53:00 No.40807191
Report
Quoted By: >>40807205
>>40801483 i'll give it a shot Anonymous Fri 14 Mar 2014 12:53:00 No.40807194
Report
Quoted By: >>40807198 >>40807201
>>40807175 >>40807175 nope reroll Anonymous Fri 14 Mar 2014 12:54:59 No.40807198
Report
>>40807194 It's not difficult; you should give it a shot. Anonymous Fri 14 Mar 2014 12:54:59 No.40807201
Report
>>40807194 >writing an entire Nintento game no Anonymous Fri 14 Mar 2014 12:55:00 No.40807205
Report
>>40807191 welp, time to find out what a fourier transform is View Same
Google
ImgOps
iqdb
SauceNAO
namegenerator.png, 6KiB, 677x343
Anonymous Fri 14 Mar 2014 13:39:44 No.40807518
Report
Quoted By: >>40807634 >>40807641 >>40813198 >>40813487
>>40807000 I can't think of any good words for the list /* Name generator in "Name the noun verb" format */ #include #include #define size(A) sizeof((A))/sizeof((A[0])) char* x[] = { "Zappy-dan", "Sparky", "Faggot", "Obama", "Richard Stallman", "Talula Does The Hula From Hawaii", "Number 16 Bus Shelter", "moot" }; char* y[] = { "Magnet", "Waifu", "Bear", "Seal Cub", "Anal", "Cock", "Jew", "Faggot", "Loli", "Free Software", "Donkey" }; char* z[] = { "Man", "Rapist", "Enabler", "Sympathser", "Cluber", "Fetishist", "Slave", "Slayer", "Puncher" }; int main (int argc, char* argv[]) { srand(time(NULL)); printf("%s the %s %s\n", x[rand() % size(x)], y[rand() % size(y)], z[rand() % size(z)]); return 0; }
Anonymous Fri 14 Mar 2014 13:50:29 No.40807596
Report
>>40801483 isn't this why rosettacode exists? Anonymous Fri 14 Mar 2014 13:51:29 No.40807607
Report
Quoted By: >>40807683 >>40807690
>>40801483 How the fuck am I supposed to decrypt or encrypt something, shit Anonymous Fri 14 Mar 2014 13:53:45 No.40807634
Report
>>40807518 Added some words and got stuff like "Stalin the Piss Inhaler". Anonymous Fri 14 Mar 2014 13:54:45 No.40807638
Report
roll Anonymous Fri 14 Mar 2014 13:54:14 No.40807641
Report
Quoted By: >>40807675
>>40807518 ((A)) ??? > wut Anonymous Fri 14 Mar 2014 13:55:59 No.40807651
Report
reroll Anonymous Fri 14 Mar 2014 13:56:44 No.40807675
Report
>>40807641 That's how macros in C work. The 'variable' needs to have brackets around it, and there are also brackets for the sizeof function, making it ((A)) Anonymous Fri 14 Mar 2014 13:57:29 No.40807683
Report
>>40807607 rot13 niga pls Anonymous Fri 14 Mar 2014 13:58:15 No.40807690
Report
>>40807607 time to learn buddy Anonymous Fri 14 Mar 2014 14:01:29 No.40807716
Report
Quoted By: >>40807826
I'm rolling, I'm rolling, I'm rolling, I'm rolling, now I'm rolling, I'm rolling, I'm rolling, ... Anonymous Fri 14 Mar 2014 14:10:44 No.40807771
Report
Quoted By: >>40814330
>fast fourier transform this table is unbalanced as fuck I can't even comprehend Anonymous Fri 14 Mar 2014 14:11:44 No.40807785
Report
I should implement all of this shit in MS Batch Anonymous Fri 14 Mar 2014 14:18:29 No.40807826
Report
Quoted By: >>40808003
>>40807716 Oh wow, a simple file manager? I'll reroll... >~< Anonymous Fri 14 Mar 2014 14:44:59 No.40808003
Report
>>40807826 its not hard. do it CLI, with whatever language... even C would be easy Anonymous Fri 14 Mar 2014 14:46:59 No.40808017
Report
Rollin Anonymous Fri 14 Mar 2014 16:52:44 No.40808830
Report
Rolling. Anonymous Fri 14 Mar 2014 19:54:44 No.40810246
Report
friday roll View Same
Google
ImgOps
iqdb
SauceNAO
lain.gif, 500KiB, 500x333
Anonymous Fri 14 Mar 2014 20:12:14 No.40810400
Report
Quoted By: >>40810473
Rolling for lain.
Anonymous Fri 14 Mar 2014 20:20:44 No.40810473
Report
Quoted By: >>40810482
>>40810400 #include #include #include #include
int main(void) { struct timeval tv; const char *first[] = {"Lain", "Mika", "Miho"}; const char *last[]= {"Iwakura", "Shoko", "Mizuki"}; gettimeofday(&tv, (struct timezone *) NULL); srandom(tv.tv_usec); fprintf(stdout, "%s %s\n", first[random() & 2], last[random() % 2]); return 0; }
>3 or 4 minutes re-rolling Anonymous Fri 14 Mar 2014 20:21:44 No.40810482
Report
Quoted By: >>40811520
>>40810473 >first[random() & 2] >& oops Anonymous Fri 14 Mar 2014 20:24:00 No.40810508
Report
Quoted By: >>40810524
HAX MY ANUS Anonymous Fri 14 Mar 2014 20:25:59 No.40810524
Report
>>40810508 REROLLING FOR MUCH ANUS Anonymous Fri 14 Mar 2014 20:44:31 No.40810712
Report
>Babby tier 00 01 02 03 04 05 06 07 08 09 10 13 14 15 17 20 24 27 30 32 34 ? 35 36 40 41 43 44 45 52 57 61 62 63 54 65 66 70 71 73 76 77 86 93 >Advanced Tier Everything else. (may vary depending on the language) View Same
Google
ImgOps
iqdb
SauceNAO
url3.jpg, 2MiB, 1920x1080
Anonymous Fri 14 Mar 2014 20:47:14 No.40810742
Report
Rolling in the deep.
Anonymous Fri 14 Mar 2014 20:47:45 No.40810747
Report
rolling Anonymous Fri 14 Mar 2014 20:49:14 No.40810765
Report
Quoted By: >>40810855
>>40801483 When will I start dreaming in code? As soon as I finish? Anonymous Fri 14 Mar 2014 20:49:30 No.40810769
Report
rawlin Anonymous Fri 14 Mar 2014 20:56:44 No.40810851
Report
>>40801483 going for a roll Anonymous Fri 14 Mar 2014 20:57:15 No.40810855
Report
>>40810765 It's a gradual process to be honest. Tonight you'll notice the girl from school you used to dream about will now speak to you, through 16-bit packets, and will wink wistfully at you in what you now understand to be some form of TCP/IP. From there it only gets better... Anonymous Fri 14 Mar 2014 22:03:48 No.40811520
Report
>>40810482 >random() >srandom() Anonymous Fri 14 Mar 2014 22:54:29 No.40812158
Report
>>40801483 Rolling to see what I get Anonymous Fri 14 Mar 2014 22:58:59 No.40812196
Report
roll Anonymous Fri 14 Mar 2014 23:42:59 No.40812697
Report
rolling for code dreams Anonymous Sat 15 Mar 2014 00:14:15 No.40812901
Report
>>40801483 rolling to see my odds Anonymous Sat 15 Mar 2014 00:17:14 No.40812939
Report
>>40801483 rollan Anonymous Sat 15 Mar 2014 00:40:59 No.40813198
Report
>>40807518 col1 = [ 'Ruslan', 'Anton', 'Sergei', 'Kiril', 'Oleg', 'Nikolai', 'Vladislav', 'Andrei', 'Vasiliy', 'Yuri'] col2 = [ 'Smir', 'Laz', 'Zhura', 'Leped', 'Pop', 'Kisel', 'Kozlov', 'Panov', 'Gorbac', 'Vishn'] col3 = [ 'ev', 'vich', 'ov', 'in', 'jev', 'eev', 'ich', 'tov', 'ovich', 'evich']
col1 = [ 'E', 'God', 'Har', 'Ing', 'Ror', 'Sig', 'Thor', 'Grim', 'Bro', 'Fag'] col2 = [ 'rif', 'frid', 'rald', 'golf', 'nar', 'gurd', 'galf', 'mund', 'dir', 'helm'] col3 = [ 'Iron', 'Dragon', 'Sea', 'Hammer', 'Sword', 'Steel', 'Man', 'Virgin', 'Loli', 'Faggot'] col4 = [ 'monger', 'slayer', 'killer', 'smasher', 'master', 'beast', 'rider', 'hugger', 'raeper', 'sucker']
Anonymous Sat 15 Mar 2014 00:42:59 No.40813217
Report
they see me rollin View Same
Google
ImgOps
iqdb
SauceNAO
1353823118803.jpg, 48KiB, 417x546
Anonymous Sat 15 Mar 2014 00:42:15 No.40813218
Report
Quoted By: >>40813230
roll
Anonymous Sat 15 Mar 2014 00:43:59 No.40813230
Report
>>40813218 Already done. Reroll. Anonymous Sat 15 Mar 2014 00:53:29 No.40813340
Report
Quoted By: >>40813464
>>40803450 >download image >check/cross the ones you've done >????? >anonymous board Anonymous Sat 15 Mar 2014 00:53:29 No.40813342
Report
top roll Anonymous Sat 15 Mar 2014 00:56:00 No.40813370
Report
>>40804923 >dragon it's a kite, you slav cunt also, wait a few days, you'll do dijkstra in class Anonymous Sat 15 Mar 2014 01:03:45 No.40813464
Report
Quoted By: >>40813518
>>40813340 that's fair, but i was thinking of it as a personal thing, should we update and add projects. tbf you can just cross them off your own image.. meh. rolling View Same
Google
ImgOps
iqdb
SauceNAO
file.png, 5KiB, 642x117
Anonymous Sat 15 Mar 2014 01:05:15 No.40813487
Report
>>40807518 Anonymous Sat 15 Mar 2014 01:07:15 No.40813518
Report
Quoted By: >>40813544
>>40813464 your next challenge is Checklist system for these challenges. Anonymous Sat 15 Mar 2014 01:09:45 No.40813544
Report
>>40813518 first i'm gonna program an ulam spiral in ascii Anonymous Sat 15 Mar 2014 01:11:14 No.40813568
Report
Might as well give this a go. Anonymous Sat 15 Mar 2014 01:20:29 No.40813684
Report
Quoted By: >>40813720
>>40801483 rollan Anonymous Sat 15 Mar 2014 01:22:44 No.40813720
Report
Quoted By: >>40814048
>>40813684 fuck that i have no clue of tcp/ip View Same
Google
ImgOps
iqdb
SauceNAO
it just werks.png, 31KiB, 1027x251
Anonymous Sat 15 Mar 2014 01:44:45 No.40814048
Report
Quoted By: >>40814130 >>40814327
>>40813720 #include using namespace std; /* run this program using the console pauser or add your own getch, system("pause") or input loop */ int main(int argc, char** argv) { float mass, height, BMI; cout > mass; cout > height; //BMI = mass / height2 height *=height; BMI = (float) mass / height; //BMI < 18,5: underweight //18,5 < BMI < 25: normal weight //25,0 < BMI: overweight if (BMI > 25) cout >40814468
>>40814327 #include using namespace std; /* run this program using the console pauser or add your own getch, system("pause") or input loop */ int main(int argc, char** argv) { float mass, height, BMI; cout > mass; cout > height; //BMI = mass / height2 height *=height; BMI = (float) mass / height; //BMI < 18,5: underweight //18,5 < BMI < 25: normal weight //25,0 < BMI: overweight if (BMI > 25) cout 40801483 rollin Anonymous Sat 15 Mar 2014 03:48:29 No.40816122
Report
rolling Anonymous Sat 15 Mar 2014 03:56:15 No.40816261
Report
Roll for something quick. Anonymous Sat 15 Mar 2014 03:59:31 No.40816320
Report
rerolling Anonymous Sat 15 Mar 2014 05:39:44 No.40818004
Report
https://github.com/ProgrammingNoob/CppProgramms Still a work in progress but it's better than what it was last night. Anonymous Sat 15 Mar 2014 05:57:29 No.40818275
Report
Quoted By: >>40818294
rollin Anonymous Sat 15 Mar 2014 05:58:00 No.40818290
Report
roll Anonymous Sat 15 Mar 2014 05:58:29 No.40818294
Report
>>40818275 cant use IRC for shit, re-roll. View Same
Google
ImgOps
iqdb
SauceNAO
1389666903574.gif, 1MiB, 350x272
Anonymous Sat 15 Mar 2014 06:27:15 No.40818762
Report
Rolling
Anonymous Sat 15 Mar 2014 06:29:14 No.40818791
Report
>>40801483 roll because rust Anonymous Sat 15 Mar 2014 08:53:26 No.40821282
Report
>>40801483 rolling Anonymous Sat 15 Mar 2014 10:08:56 No.40822297
Report
rolling Anonymous Sat 15 Mar 2014 10:10:26 No.40822336
Report
>>40801483 rolling Rolling~ Yushu Sat 15 Mar 2014 10:16:26 No.40822424
Report
It's time to ro-ro-ro-ro-rororororolllllllllllllllllllll Anonymous Sat 15 Mar 2014 10:42:27 No.40822804
Report
How did I do with my Towers of Hanoi? Is it good? By the way this is C++. #include int end; void Hanoi(int dskToMv, int cLocation, int tmpLocation, int fLocation) { if( dskToMv != 0) { Hanoi( dskToMv-1, cLocation, fLocation, tmpLocation ); std::cout >40823562
>>40801483 RAWL Anonymous Sat 15 Mar 2014 11:46:10 No.40823562
Report
Quoted By: >>40823578
>>40823557 FUCK THAT! Reroll! Anonymous Sat 15 Mar 2014 11:47:41 No.40823578
Report
Quoted By: >>40823606
>>40823562 No idea what that is, rerolling for rerolling. Anonymous Sat 15 Mar 2014 11:48:55 No.40823581
Report
Quoted By: >>40823597 >>40823632
Roll Anonymous Sat 15 Mar 2014 11:49:11 No.40823597
Report
Quoted By: >>40823606
>>40823581 Reroll Anonymous Sat 15 Mar 2014 11:50:56 No.40823606
Report
Quoted By: >>40823662
>>40823578 Reroll because difficulty is hard. >>40823597 Nigger Anonymous Sat 15 Mar 2014 11:51:10 No.40823632
Report
>>40823581 ReReRoll Anonymous Sat 15 Mar 2014 11:51:41 No.40823638
Report
Made a 4chan image downloader in python. #just another 4chan img downloader import urllib import sys import re import os def getthread(): url = sys.argv[1] thread = urllib.urlopen(url).read() threadimgs = list(set(re.findall('i.4cdn.org/[a-z]*/src/[0-9]*\.(?:jpg|png|gif)',thread))) path = re.search('(?>40823694
>>40823662 Also, reroll Anonymous Sat 15 Mar 2014 11:56:55 No.40823694
Report
Quoted By: >>40823720
>>40823681 Reroll Anonymous Sat 15 Mar 2014 11:58:56 No.40823720
Report
>>40823694 Last reroll, better be easy or keep me up all night! Anonymous Sat 15 Mar 2014 11:58:41 No.40823728
Report
let's see what happens Anonymous Sat 15 Mar 2014 11:59:25 No.40823734
Report
henry rollins Anonymous Sat 15 Mar 2014 12:57:40 No.40824442
Report
Quoted By: >>40824457
rolling it faggot View Same
Google
ImgOps
iqdb
SauceNAO
url.png, 199KiB, 412x375
Anonymous Sat 15 Mar 2014 12:59:10 No.40824450
Report
Quoted By: >>40824527
rollin
Anonymous Sat 15 Mar 2014 13:00:55 No.40824457
Report
>>40824442 roll again Anonymous Sat 15 Mar 2014 13:05:10 No.40824519
Report
>>40801483 rawlin Anonymous Sat 15 Mar 2014 13:06:10 No.40824527
Report
Quoted By: >>40824543 >>40824556
>>40824450 reported enjoy your v& paedo scum Anonymous Sat 15 Mar 2014 13:07:55 No.40824535
Report
roll View Same
Google
ImgOps
iqdb
SauceNAO
1372121056911.jpg, 55KiB, 477x638
Anonymous Sat 15 Mar 2014 13:08:56 No.40824543
Report
>>40824527 >yfw see that it's a thumb
Anonymous Sat 15 Mar 2014 13:09:25 No.40824556
Report
Quoted By: >>40824690
>>40824527 >Announcing your reports is now a bannable offense. Probably won't help that you made a fraudulent report either. Anonymous Sat 15 Mar 2014 13:15:25 No.40824609
Report
rolling how come some of these are piss easy and other incredibly difficult Anonymous Sat 15 Mar 2014 13:25:55 No.40824690
Report
Quoted By: >>40824713
>>40824556 why'd you get me banned :( View Same
Google
ImgOps
iqdb
SauceNAO
vb_55_colonel_hunter_gathers.jpg, 338KiB, 1280x720
Anonymous Sat 15 Mar 2014 13:28:40 No.40824713
Report
>>40824690 Because you're a dick. Anonymous Sat 15 Mar 2014 13:30:40 No.40824733
Report
Quoted By: >>40824742
This is a pretty good idea, rolling Anonymous Sat 15 Mar 2014 13:32:56 No.40824742
Report
>>40824733 Fuck that, reroll Anonymous Sat 15 Mar 2014 13:35:11 No.40824769
Report
rolling Anonymous Sat 15 Mar 2014 13:36:55 No.40824778
Report
rolling Anonymous Sat 15 Mar 2014 13:38:55 No.40824797
Report
Quoted By: >>40824887
I am the rolling Anonymous Sat 15 Mar 2014 13:50:40 No.40824887
Report
>>40824797 doing #84 Anonymous Sat 15 Mar 2014 14:36:10 No.40825224
Report
Quoted By: >>40825283
Rolling for an afternoon project. Anonymous Sat 15 Mar 2014 14:44:27 No.40825283
Report
>>40825224 Well I did that yesterday. It works so hopefully it's good. # Simple python program to convert decimal numbers into binary print "Enter a decimal number" try: decimal = int(raw_input("> ")) decimalB = decimal binary = "" if decimal < 0: print "Cannot convert a negative number" elif decimal == 0: print "It's zero no matter what numeral system you use!" else: while decimal != 0: binary = binary + str(decimal % 2) decimal = decimal / 2 print "\nThe decimal %d has been converted to binary: %s" % (decimalB, binary[::-1]) except ValueError: print "You haven't entered an integer!"
Rerolling Anonymous Sat 15 Mar 2014 14:45:40 No.40825295
Report
Rawlean 4 Moar. Anonymous Sat 15 Mar 2014 18:20:40 No.40826758
Report
*D20* Aaaaand... Anonymous Sat 15 Mar 2014 18:24:40 No.40826798
Report
rolling Anonymous Sat 15 Mar 2014 19:14:10 No.40827208
Report
Quoted By: >>40827403
rolling Anonymous Sat 15 Mar 2014 19:16:10 No.40827218
Report
Rolling Anonymous Sat 15 Mar 2014 19:21:10 No.40827250
Report
rolling. Will code in brainfuck for pleasure Anonymous Sat 15 Mar 2014 19:28:40 No.40827296
Report
what's the best programming language to use in order to accomplish this? Anonymous Sat 15 Mar 2014 19:42:56 No.40827403
Report
Quoted By: >>40827546
>>40827208 var prompt = require('prompt'); prompt.start(); prompt.get(['name1', 'name2'], function (err, result) { if (err) { console.log(err); return 1; } calculateLove(result.name1, result.name2); }); calculateLove = function (name1, name2) { var str = name1 + name2; str = str.toUpperCase(); //Replace duplicate characters var str = str.replace(/[^\w\s]|(.)\1/gi, function (str, match) {return match[0]}); //Add ASCII values var res = 0; for (i=0;i < str.length; i++) { res += str.charCodeAt(i); } res = res % 101; console.log("Compatibility percentage :" + res); }
and rerolling Anonymous Sat 15 Mar 2014 19:56:57 No.40827546
Report
>>40827403 //Calculate age in seconds var prompt = require('prompt'); prompt.start(); prompt.get(['birth_year', 'birth_month', 'birth_day'], function (err, result) { if (err) { console.log(err); return 1; } ageInSeconds(result.birth_year, result.birth_month, result.birth_day); }); ageInSeconds = function (year, month, day) { var date = new Date(year, month - 1, day); //Months are counted from 0 var now = new Date(); var dif = now.getTime() - date.getTime(); var res = Math.round(dif / 1000); console.log("Age in seconds : " + res); }
Rerolling again Anonymous Sat 15 Mar 2014 19:57:40 No.40827556
Report
rolling Anonymous Sat 15 Mar 2014 19:59:56 No.40827563
Report
Quoted By: >>40828759
>that chair when there will never be a game engine with Scheme as it's scripting base. Anonymous Sat 15 Mar 2014 21:41:11 No.40828759
Report
>>40827563 What about Guile-2d? Anonymous Sat 15 Mar 2014 21:51:10 No.40828878
Report
roll Anonymous Sat 15 Mar 2014 23:18:10 No.40829829
Report
>>40801483 rollin Anonymous Sat 15 Mar 2014 23:20:10 No.40829854
Report
rell Anonymous Sat 15 Mar 2014 23:21:55 No.40829864
Report
roll Anonymous Sat 15 Mar 2014 23:22:25 No.40829886
Report
roll Anonymous Sat 15 Mar 2014 23:32:10 No.40829994
Report
I might as well do something to step up my Powershell game. Let's roll. Anonymous Sat 15 Mar 2014 23:35:40 No.40830036
Report
roland Anonymous Sat 15 Mar 2014 23:37:10 No.40830052
Report
trlling Anonymous Sun 16 Mar 2014 00:18:10 No.40830620
Report
Quoted By: >>40831034
Rolling for a new challenge. Anonymous Sun 16 Mar 2014 00:29:26 No.40830746
Report
roll Anonymous Sun 16 Mar 2014 00:54:57 No.40831034
Report
>>40830620 I'm done! :3 (This BMI is kg/m2 standard.) #include #include #include int main() { float bmi; float kilos; float meters; char ans; do { std::cout kilos; std::cout > meters; bmi = kilos / (meters * meters); std::cout >40834134 Benford's Law, I assume they meant that we just need to implement the formula? import math def benfordsLaw(n): return math.log(1.0 + 1.0/n,10) if 040833640 Now accepts input. #include #include #define MAX 1024 void cipher_txt(char *text, int key) { int i; for(i = 0; i < strlen(text); i++) { text[i] += key; } printf("Ciphered: %s\n", text); } void decipher_txt(char *text, int key) { int i; for(i = 0; i < strlen(text); i++) { text[i] -= key; } printf("Deciphered: %s\n", text); }
int main() { int option; char text_user[MAX]; int key_user; printf("1. Cipher text.\n"); printf("2. Decipher text\n\n"); scanf("%d", &option); switch(option) { case 1: printf("Enter text: "); scanf("%s", text_user); fflush(stdin); printf("Enter key(number): "); scanf("%i", &key_user); cipher_txt(text_user, key_user); break; case 2: printf("Enter text: "); scanf("%s", text_user); fflush(stdin); printf("Enter key(number): "); scanf("%i", &key_user); decipher_txt(text_user, key_user); break; } return 0; }
Anonymous Sun 16 Mar 2014 04:21:10 No.40834403
Report
Quoted By: >>40835462
rolling Anonymous Sun 16 Mar 2014 04:24:11 No.40834446
Report
For great justice Anonymous Sun 16 Mar 2014 04:33:26 No.40834611
Report
lets roll kellex Sun 16 Mar 2014 04:54:56 No.40835037
Report
rolling Anonymous Sun 16 Mar 2014 04:57:55 No.40835079
Report
>>40801536 >We should get more pictures, with challenges sorted by difficulty level and subject (e.g. networking, OS, algorithms, 3D, etc.) and paste them to the wiki. Super Beginner: Beginner Intermediate Hard Extreme European Extreme Hall of Fame Anonymous Sun 16 Mar 2014 05:00:11 No.40835129
Report
Quoted By: >>40835213
>>40801483 Rate my ncurses tree #include #include #include int main() { int ch; initscr(); raw(); keypad(stdscr, TRUE); char str[10]; getstr(str); ch = atoi(str); ch = ch * 2 - 1; int space = 0; for (int a = 0; a < ch; a += 2) { space = (ch - a) / 2; for (int b = 0; b >40835129 nice. my one: #print a xmas tree. # usage: ./tree.py a b c #input args: a = tree base width (odd number), b = tree leave character, c = tree base character import sys import random as r import os from termcolor import colored a = int(sys.argv[1]) b = sys.argv[2] c = sys.argv[3] def randleaf(): colors = ['red','white','yellow'] baubles = ['O','?','8'] n = r.randint(0,20) if n < 3: return colored(baubles[n],colors[n]) else: return colored(b,'green') tree = [] #while True: #a = r.randint(1,50)*2 + 1 #tree = [] for i in xrange(1,a+1,2): tree.append(" "*((a-i)/2) + b*i) os.system('cls') for i in tree: print "".join(randleaf() if i[j]==b else ' ' for j in range(len(i))) print " "*((a-3)/2) + c*3 for i in range(1,a/4): print " "*((a-3)/2) + c*3
Anonymous Sun 16 Mar 2014 05:08:56 No.40835232
Report
Quoted By: >>40835262 >>40835393
>>40801483 >28 - Calculate & Print 100 Factorial int factorial(int n) { if (n >40835288
>>40835213 That's python, right? I actually don't know any python. It looks fancy though, what does it do? Anonymous Sun 16 Mar 2014 05:09:40 No.40835254
Report
FUARRRRKKKK Anonymous Sun 16 Mar 2014 05:10:40 No.40835262
Report
Quoted By: >>40835334
>>40835232 >What is overflow Anonymous Sun 16 Mar 2014 05:11:57 No.40835275
Report
Quoted By: >>40835554 >>40835586
>>40801483 plz critique my base64 encoder (no decoder yet) import qualified =" chunk (a,b,c:_) = triplet64 (a,b,c)
I would make this code recursive instead of splitting up until separate chunks. That way you also guarantee "=" only shows up at the end, for greater static safety. Don't filter for chars below 256, that is just a broken API - instead pick a lossless encoding function. A few functions have named alternatives, eg. concatMap f = concat . map f; or replicate n = take n . repeat There might be a much more elegant way to do this but I haven't really looked into it. I'm not a huge fan of bit-mangling but that might be okay. Anonymous Sun 16 Mar 2014 05:29:26 No.40835586
Report
Quoted By: >>40835601 >>40835621
>>40835275 what language is this? Anonymous Sun 16 Mar 2014 05:30:25 No.40835601
Report
>>40835586 I think, Spanish maybe? Anonymous Sun 16 Mar 2014 05:31:11 No.40835621
Report
>>40835586 It looks like Haskell. Those Guards nail it. View Same
Google
ImgOps
iqdb
SauceNAO
1387760929936.jpg, 43KiB, 500x638
Anonymous Sun 16 Mar 2014 05:33:41 No.40835660
Report
roll
Anonymous Sun 16 Mar 2014 05:36:41 No.40835706
Report
Quoted By: >>40835926
>>40835554 Thanks for the comments >For the conversion I would not use a Map but use the help of trivial functions like ord/chr which convert according to the Unicode map. Base64 doesn't map very nicely to the ascii ordering, so such a function would be quite complex, and slower than a lookup table. Maybe it would make sense for the reverse lookup. >You have scoping issues, some of those things should be subdefinitions instead of top level definitions. >You could use use a “where” subdeclaration instead of “let .. in” for prettier/clearer code. Ok, I need to learn these things. >I would hard-code the logic in chunkToBase64 funny, the last thing I did was pull that logic out of chunkToBase64. >I would make this code recursive instead of splitting up until separate chunks. That way you also guarantee "=" only shows up at the end, for greater static safety. Good idea. >Don't filter for chars below 256, that is just a broken API - instead pick a lossless encoding function. This is the spec I'm following (base64 for MIME). See http://en.wikipedia.org/wiki/Base64 >A few functions have named alternatives, eg. concatMap f = concat . map f; or replicate n = take n . repeat Thanks >There might be a much more elegant way to do this but I haven't really looked into it. I'm not a huge fan of bit-mangling but that might be okay. Given that you *have* to do some bit-mangling, I think tripletToBase64 is both efficient and simple. Anonymous Sun 16 Mar 2014 05:41:40 No.40835793
Report
jesus wept, factorials get ridiculous. python supprting big numbers as standard is very cool. just printed 100,000! Anonymous Sun 16 Mar 2014 05:42:40 No.40835815
Report
Quoted By: >>40835852
roll Anonymous Sun 16 Mar 2014 05:44:26 No.40835852
Report
>>40835815 reroll, already know how to .retcarahc "edirrevo tfel ot thgir" htiw gnirts a esrever Anonymous Sun 16 Mar 2014 05:45:40 No.40835874
Report
Roll View Same
Google
ImgOps
iqdb
SauceNAO
da55e5_2368261.jpg, 914KiB, 3264x2448
Anonymous Sun 16 Mar 2014 05:46:25 No.40835882
Report
t'roll
Anonymous Sun 16 Mar 2014 05:47:56 No.40835893
Report
rollingg Anonymous Sun 16 Mar 2014 05:48:10 No.40835910
Report
Roll for a friend Anonymous Sun 16 Mar 2014 05:49:56 No.40835926
Report
Quoted By: >>40835957 >>40836145 >>40836196
>>40835706 >and slower than a lookup table Have you benchmarked it? I think for the reverse it would definitely seem faster - either way, I'd label it premature optimization unless you've benchmarked it. Oh, some food for thought; I just remembered my own base64 encoder (no decoder yet..) import Control.Lens import Control.Monad import Data.Bits.Lens (bits) import Data.ByteString (ByteString) import Data.ByteString.Lens (bytes) import Data.List.Split.Lens (chunking) import Data.Word (Word8) charset :: Int -> Char charset = (!!) $ ['A'..'Z'] ++ ['a'..'z'] ++ ['0'..'9'] ++ "+/" base64enc :: ByteString -> String base64enc = view $ chunking 6 (bytes.backwards bits).to enc where enc :: [Bool] -> String enc bs = charset (0 & partsOf (backwards $ taking 6 bits) .~ bs) : replicate (3 - length bs `div` 2) '='
‘charset’ could be optimized, perhaps using an Array like yours. (Or maybe using Text) It's probably not very fast, but I thought the logic was cute enough to be worth a glance. Anonymous Sun 16 Mar 2014 05:51:25 No.40835957
Report
>>40835926 Lenses are crazy powerful Anonymous Sun 16 Mar 2014 05:51:40 No.40835961
Report
Reroll for hardmode Anonymous Sun 16 Mar 2014 05:53:56 No.40835988
Report
>>40801483 rolling Anonymous Sun 16 Mar 2014 05:54:56 No.40836011
Report
>>40801483 roll Anonymous Sun 16 Mar 2014 05:57:55 No.40836061
Report
>>40801483 rollin' View Same
Google
ImgOps
iqdb
SauceNAO
54632.png, 1MiB, 712x960
Anonymous Sun 16 Mar 2014 05:57:55 No.40836063
Report
rolling
Anonymous Sun 16 Mar 2014 05:57:25 No.40836069
Report
Quoted By: >>40836092
>>40801483 Rawlin Anonymous Sun 16 Mar 2014 05:58:56 No.40836081
Report
rolled Anonymous Sun 16 Mar 2014 05:58:25 No.40836092
Report
Quoted By: >>40836135
>>40836069 Rerawl Anonymous Sun 16 Mar 2014 06:00:40 No.40836133
Report
>>40801483 rel Anonymous Sun 16 Mar 2014 06:01:56 No.40836135
Report
>>40836092 Ok, last time... hoping for something I can actually do Anonymous Sun 16 Mar 2014 06:01:10 No.40836145
Report
Quoted By: >>40836597
>>40835926 Using Map would be slow, but another lookup table (of size 256) for the decoder would also make sense. I don't think that would be premature optimization because I think that explicitly constructing both lookup tables is the simplest possible logic. But that is a matter of taste. If this was C, a lookup table would be faster than any other method of computing, this is safe to assume given x64 architecture. I don't know about Haskell, I assume the same holds. Anonymous Sun 16 Mar 2014 06:01:41 No.40836150
Report
Quoted By: >>40836172
Rolling for something I don't know how to do, because I don't know much programming. Anonymous Sun 16 Mar 2014 06:02:40 No.40836172
Report
>>40836150 Bullshit, reroll for something that won't take a month or piss me off. Anonymous Sun 16 Mar 2014 06:02:40 No.40836175
Report
>>40801483 re-rolling Anonymous Sun 16 Mar 2014 06:03:56 No.40836194
Report
>>40801483 rawl Anonymous Sun 16 Mar 2014 06:04:56 No.40836196
Report
>>40835926 and thanks for the code, I want to learn about these lens things Anonymous Sun 16 Mar 2014 06:07:26 No.40836269
Report
Quoted By: >>40836306
rolling on the hill of binary to find a good tree to sleep(); on! Anonymous Sun 16 Mar 2014 06:09:25 No.40836306
Report
>>40836269 reroll fuck. Anonymous Sun 16 Mar 2014 06:25:26 No.40836597
Report
Quoted By: >>40836845
>>40836145 >I don't know about Haskell, I assume the same holds. Let's find out! import Data.Char (ord, chr) import qualified Data.Array as A import qualified Data.Map.Strict as M import qualified Data.HashMap.Strict as H import qualified Data.Vector.Unboxed as V import Criterion.Main base64chars = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/" naive :: Int -> Char naive 62 = '+' naive 63 = '/' naive n = chr $ n + ord o where o | n < 26 = 'A' | n < 52 = 'a' | n < 62 = '0' list :: Int -> Char list i = base64chars !! i array :: Int -> Char array i = a A.! i where a = A.listArray (0,63) base64chars ordmap :: Int -> Char ordmap i = m M.! i where m = M.fromAscList $ zip [0..63] base64chars hashmap :: Int -> Char hashmap i = hm H.! i where hm = H.fromList $ zip [0..63] base64chars vector :: Int -> Char vector i = v V.! i where v = V.fromList base64chars main = defaultMain [ bench "naive" $ nf (map naive) str , bench "list" $ nf (map list) str , bench "array" $ nf (map array) str , bench "ordmap" $ nf (map ordmap) str , bench "hashmap" $ nf (map hashmap) str , bench "vector" $ nf (map vector) str ] where str = concat $ replicate 10000 [19,33,30,16,46,34,28,36,1,43,40,48,39 ,5,40,49,9,46,38,41,44,14,47,30,43,19 ,33,30,11,26,51,50,3,40,32]
Results at: http://lpaste.net/101255 Anonymous Sun 16 Mar 2014 06:37:42 No.40836845
Report
>>40836597 Here's the mean lookup time: main = defaultMain [ bench "naive" $ nf (map naive) [0..63] , bench "list" $ nf (map list) [0..63] , bench "array" $ nf (map array) [0..63] , bench "ordmap" $ nf (map ordmap) [0..63] , bench "hashmap" $ nf (map hashmap) [0..63] , bench "vector" $ nf (map vector) [0..63] ]
http://lpaste.net/101256 Seems to be fairly consistent. Anonymous Sun 16 Mar 2014 06:41:56 No.40836923
Report
aight Anonymous Sun 16 Mar 2014 07:17:25 No.40837573
Report
Quoted By: >>40837590
Rollan' while learnan' :^) Anonymous Sun 16 Mar 2014 07:18:40 No.40837590
Report
Quoted By: >>40837601 >>40837610
>>40837573 Already made that, re-rollan :^( Anonymous Sun 16 Mar 2014 07:19:11 No.40837601
Report
Quoted By: >>40837631
>>40837590 show Anonymous Sun 16 Mar 2014 07:19:40 No.40837610
Report
>>40837590 Reroll because hard for me... Anonymous Sun 16 Mar 2014 07:21:56 No.40837631
Report
>>40837601 Here it is: #include int end; void Hanoi(int dskToMv, int cLocation, int tmpLocation, int fLocation) { if( dskToMv != 0) { Hanoi( dskToMv-1, cLocation, fLocation, tmpLocation ); std::cout >40837682
rollin Anonymous Sun 16 Mar 2014 07:24:41 No.40837682
Report
Quoted By: >>40837722
>>40837650 I already did that one, rollin again. Anonymous Sun 16 Mar 2014 07:27:10 No.40837722
Report
Quoted By: >>40837888
>>40837682 Show~ Anonymous Sun 16 Mar 2014 07:29:11 No.40837748
Report
Quoted By: >>40837826
bored of old challenge, reroll. Anonymous Sun 16 Mar 2014 07:31:55 No.40837784
Report
Quoted By: >>40837807
Rollin a binary joint here. Anonymous Sun 16 Mar 2014 07:32:11 No.40837807
Report
Quoted By: >>40837829
>>40837784 2hard, reroll. Anonymous Sun 16 Mar 2014 07:32:40 No.40837820
Report
Quoted By: >>40837846
roll Anonymous Sun 16 Mar 2014 07:33:56 No.40837826
Report
Quoted By: >>40837847
>>40837748 >dull as fuck, consider removing it if anyone else agrees. reroll Anonymous Sun 16 Mar 2014 07:33:11 No.40837829
Report
Quoted By: >>40837859
>>40837807 >TCP chat with basic encryption >2hard what? That's like 10-20 lines of code.. Anonymous Sun 16 Mar 2014 07:33:12 No.40837834
Report
Quoted By: >>40837875 >>40837887
Is it a good practice to use curly braces in the case part of a switch-case statement? switch (type) { case 1: { //do something 1 //do something 2 //do something 3 //do something 4 //do something 5 break; } }
switch (type) { case 1: //do something 1 //do something 2 //do something 3 //do something 4 //do something 5 break; }
Anonymous Sun 16 Mar 2014 07:34:12 No.40837846
Report
>>40837820 How is that even a challenge? rerolling Anonymous Sun 16 Mar 2014 07:34:12 No.40837847
Report
>>40837826 Disagreed Anonymous Sun 16 Mar 2014 07:34:12 No.40837849
Report
I wrote a shitty program that finds all prime numbers bounded by the parameters of the variable length. Can I do anything with it ? Anonymous Sun 16 Mar 2014 07:35:10 No.40837859
Report
Quoted By: >>40837910
>>40837829 On the client, or the server, what about the logging, the channels, the users, the time? Anonymous Sun 16 Mar 2014 07:36:11 No.40837875
Report
>>40837834 it's not a bad practice, if it helps you, use it. Loves like !5DeRpYLOvE Sun 16 Mar 2014 07:37:11 No.40837887
Report
>>40837834 there are some situations that *require* you to, otherwise I personally consider it visual clutter and generally bad form. View Same
Google
ImgOps
iqdb
SauceNAO
gof.png, 11KiB, 720x1280
Anonymous Sun 16 Mar 2014 07:37:11 No.40837888
Report
>>40837722 I made it for android. Never released it though.
Anonymous Sun 16 Mar 2014 07:39:28 No.40837910
Report
Quoted By: >>40838073
>>40837859 Who said anything about this? Regardless, not many lines each. >logging one line >the channels 2-3 lines >users 2-3 lines >the time one line Anonymous Sun 16 Mar 2014 07:39:28 No.40837918
Report
Quoted By: >>40837971
>>40835202 #include #include #include void showhelp(); int main(int args, char *argv[]) { if(args>40838020
>>40835288 What library are you using to make this fake terminal. Anonymous Sun 16 Mar 2014 07:43:47 No.40837971
Report
>>40837918 reroll Anonymous Sun 16 Mar 2014 07:46:47 No.40838020
Report
Quoted By: >>40838041
>>40837962 what do you mean? the terminal is called ansicon, needed it so i can display unicode in windows. termcolor is the only external module. Anonymous Sun 16 Mar 2014 07:47:47 No.40838041
Report
>>40838020 Oh I thought you were emulating the look of an emulator with SDL or something like that. Anonymous Sun 16 Mar 2014 07:50:08 No.40838073
Report
Quoted By: >>40838079
>>40837910 one line? Yeah, one compressed JavaScript line you mean. Anonymous Sun 16 Mar 2014 07:50:08 No.40838079
Report
>>40838073 idiomatic Haskell I'm sorry your language is so verbose Anonymous Sun 16 Mar 2014 08:06:49 No.40838271
Report
Quoted By: >>40838330
i Anonymous Sun 16 Mar 2014 08:10:49 No.40838330
Report
>>40838271 r Anonymous Sun 16 Mar 2014 09:56:11 No.40839922
Report
>>40802935 That won't add any time at all, unless your implementation is garbage. View Same
Google
ImgOps
iqdb
SauceNAO
web crawler.png, 88KiB, 562x424
Anonymous Sun 16 Mar 2014 10:06:11 No.40840062
Report
Quoted By: >>40840078
Web crawler: Complete, pic related. I shortened the code a bit so only the functioning part is shown. try { foreach (HtmlElement htmlElement in wb.Document.Links) { string tabItem = htmlElement.InnerText; string linkItem = htmlElement.GetAttribute("HREF").ToStrin g(); linklist.Items.Add(linkItem); } linklist.SelectedIndex++; wb.Navigate(linklist.SelectedItem.ToString()); } catch { // In case the link was an image or not a website } linklist.SelectedIndex++; // move to next website for more indexing goodness
Anonymous Sun 16 Mar 2014 10:07:11 No.40840078
Report
>>40840062 edit: tabitem is never used, for getting where the href is.
Subject Name E-mail Password Submit
Reset
FoolFuuka Imageboard 2.2.0 - Asagi Fetcher A Bibliotheca Anonoma project.
Change Language
Change Theme