Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon.

Pages: 1-4041-8081-120121-

Homework

Name: 2009-08-18 10:35

Output a thousand Sussmen in an individualistic way.

Name: Anonymous 2009-08-18 10:45

javascript: document.write('a thousand Sussmen')

Name: Anonymous 2009-08-18 10:52

int i;
for(i = 0; i < 1000; ++i)
   printf("Sussman");
i'm an individual ^_^

Name: Anonymous 2009-08-18 10:56

>>3

optimize your variables you pig

Name: Anonymous 2009-08-18 11:13

print "Sussman\n" * 1000

Name: Anonymous 2009-08-18 11:16

>>4
wat?

Name: Anonymous 2009-08-18 11:17

sequence_ $ replicate 1000 $ putStrLn "Sussman"

Name: Anonymous 2009-08-18 11:48


<?php
  if("5cocks" == 5)
    echo("Suss\n");
?>

Name: Anonymous 2009-08-18 11:53

/* gcc sussman.c `allegro-config --libs` */

#include <stdio.h>
#include <allegro.h>

#define WIDTH 1280
#define HEIGHT 800

int main(int argc, char **argv)
{
    BITMAP *sussman;
    PALETTE pal;
    int i, j;

    if (argc < 2) {
        fprintf(stderr, "%s SUSSMAN.bmp\n", argv[0]);
        return 1;
    }

    allegro_init();
    install_keyboard();

    if (set_gfx_mode(GFX_AUTODETECT, WIDTH, HEIGHT, 0, 0) != 0)
        return 2;

    sussman = load_bitmap(argv[1], pal);
    set_palette(pal);

    for (i = 0; i < WIDTH / sussman->w; ++i)
        for (j = 0; j < HEIGHT / sussman->h; ++j)
            draw_sprite(screen, sussman, i * sussman->w, j * sussman->h);

    destroy_bitmap(sussman);
    while (!keypressed());

    return 0;
} END_OF_MAIN()

Just pass it a suitable small bitmap of the Sussman as a parameter. I suggest this one:
http://cairnarvon.rotahall.org/pics/sussman_tiny.bmp

(At that resolution, that will actually output 2560 Sussmen.)

Name: Anonymous 2009-08-18 12:11

; nasm linux x86
SECTION .data
SUSSMAN:
  db "sussman",10

SECTION .text
GLOBAL _start
_start:
  mov ecx, 1000
  sicp:
  push ecx
  mov eax, 4
  mov ebx, 1
  mov ecx, SUSSMAN
  mov edx, 9
  int 0x80
  pop ecx
  loop sicp
  mov eax, 1
  xor ebx, ebx
  int 0x80

Name: replicateM_ meme fan 2009-08-18 12:18

>>7
You do this just to anger me, don't you?

Name: Anonymous 2009-08-18 12:37

>>11
Not qyute.

Name: Anonymous 2009-08-18 13:04

>>11
I didn't know of that function, but I'd rather not use Control.Monad anyway for a silly example like this, because then I'd need more than one line.

Name: Anonymous 2009-08-18 13:34

1000SU~1.BAT:
ECHO OFF
100SUS~1.BAT
100SUS~1.BAT
100SUS~1.BAT
100SUS~1.BAT
100SUS~1.BAT
100SUS~1.BAT
100SUS~1.BAT
100SUS~1.BAT
100SUS~1.BAT
100SUS~1.BAT
ECHO ON

100SUS~1.BAT:
ECHO OFF
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO SUSSMAN
ECHO ON

Usage:
C:\>1000SU~1.BAT

Name: Anonymous 2009-08-18 13:41

perl -e 'while ($i < 1000) { ; print "sussman\n"; ++$i ; }'

Name: Anonymous 2009-08-18 13:45

>>15 deeeeeerp was in too much of a hurry
doitrite nao:

perl -e 'while ($i <= 10) { print "$i sussman\n"; ++$i ; }'

Name: Anonymous 2009-08-18 13:48

>>14
Back to FAT, please.

Name: Anonymous 2009-08-18 13:50

>>14 1000SU~1.BAT
Truly a remarkable sign of old-style, my friend.

Name: Anonymous 2009-08-18 13:54

>>17 urdoingitrong
should be FAT16

Name: Anonymous 2009-08-18 14:08

>>14
VALID DAFT PUNK LYRICS

Name: Anonymous 2009-08-18 15:15

>>9
Bonus points for individualism and Xarn.

Name: Anonymous 2009-08-18 15:16

>>18
How would ~1 have ended up in and old-style filename?

Name: Anonymous 2009-08-18 19:13

>>3
for(int i = 0; i < 1000; ++i)
{
    puts("Sussman");
}

Name: Garden of Mittens 2009-08-18 21:52

<?php

$message = str_repeat('Sussman', 1000);
define('GRID_W', 80);
define('GRID_H', 24);
define('BORDER', 4);
define('HUE_OFFSET', mt_rand(0, 1000) / 1000);
define('HUE_MUL', 10);
define('LIGHTNESS_POWER', 3);

function hsl_to_rgb($h, $s, $l) {
    if($s == 0) {
        $color = array('r' => $l, 'g' => $l, 'b' => $l);
    } else {
        $t2 = ($l < 0.5 ? $l * (1 + $s) : $l + $s - $l * $s);
        $t1 = 2 * $l - $t2;
        $color = array('r' => $h + 1/3, 'g' => $h, 'b' => $h - 1/3);
        foreach($color as $k => $t3) {
            if($t3 < 0) $t3 += 1;
            if($t3 > 1) $t3 -= 1;
            if(6 * $t3 < 1)
                $color[$k] = $t1 + ($t2 - $t1) * 6 * $t3;
            elseif(2 * $t3 < 1)
                $color[$k] = $t2;
            elseif(3 * $t3 < 2)
                $color[$k] = $t1 + ($t2 - $t1) * (2/3 - $t3) * 6;
            else
                $color[$k] = $t1;
        }
    }
    return $color;
}

define('NORTH', 1);
define('EAST', 2);
define('SOUTH', 3);
define('WEST', 4);
define('FONT', 2);
define('FONT_W', 6);
define('FONT_H', 11);
define('X0', 0);
define('Y0', -3);
define('LEN', strlen($message));
$opposites = array(NORTH => SOUTH, SOUTH => NORTH, EAST => WEST, WEST => EAST);
$movements_x = array(NORTH => 0, EAST => 1, SOUTH => 0, WEST => -1);
$movements_y = array(NORTH => -1, EAST => 0, SOUTH => 1, WEST => 0);
$img = imagecreatetruecolor(2 * BORDER + GRID_W * FONT_W, 2 * BORDER + GRID_H * FONT_H);
$x = mt_rand(0, GRID_W - 1);
$y = mt_rand(0, GRID_H - 1);
$from = 0;

for($i = 0; $i < LEN; $i++) {
    $pos = $i / LEN;
    $rgb = hsl_to_rgb(fmod((HUE_OFFSET + $pos) * HUE_MUL, 1), 1, pow($pos, LIGHTNESS_POWER));
    $color = imagecolorallocate($img, round($rgb['r'] * 255), round($rgb['g'] * 255), round($rgb['b'] * 255));
    imagestring($img, FONT, BORDER + X0 + $x * FONT_W, BORDER + Y0 + $y * FONT_H, $message[$i], $color);
    imagecolordeallocate($img, $color);
   
    $valid_directions = array(NORTH, EAST, SOUTH, WEST);
    $invalid_directions = array($from);
    if($x == 0)                 $invalid_directions[] = WEST;
    elseif($x == GRID_W - 1)    $invalid_directions[] = EAST;
    if($y == 0)                 $invalid_directions[] = NORTH;
    elseif($y == GRID_H - 1)    $invalid_directions[] = SOUTH;
    $valid_directions = array_diff($valid_directions, $invalid_directions);
    $direction = $valid_directions[array_rand($valid_directions)];
    $x += $movements_x[$direction];
    $y += $movements_y[$direction];
    $from = $opposites[$direction];
}

header('Content-type: image/png');
imagepng($img);

?>

Name: Anonymous 2009-08-18 22:26

OMG OPTIMIZED

[code]
for(int i = 0; i < 1000; ++i)
    puts("Sussman");
[code]

Name: Anonymous 2009-08-18 23:22

>>25
Invalid ANSI C.

Name: Anonymous 2009-08-18 23:29

>>24
Christ, I hate your code. Good work.

Name: Anonymous 2009-08-18 23:29

>>25
Invalid BBCode.

Name: Anonymous 2009-08-19 0:26


;;;; Output a thousand Sussmans, various versions from simplest to most insane.

;;; Simple iterative version
(dotimes (i 1000)
  (format t "Sussman~%"))

;;; Tail-recursive version, gets optimized to a loop when compiled
(defun print-sussmans (n)
  (unless (zerop n)
      (format t "Sussman~%")
      (print-sussmans (1- n))))

(print-sussmans 1000)

;;; Extended LOOP version
(loop for i from 1 to 1000
     do (format t "Sussman~%"))

;;; Simple LOOP version
(let ((i 0))
  (loop       
     (when (= i 1000) (return))
     (format t "Sussman~%")
     (incf i)))

;;; TAGBODY/GO version

(let ((i 0))
  (tagbody
   LOOPSTART
     (incf i)
     (princ "Sussman")
     (terpri)    
     (if (= i 1000)
     (go END) ; or use a return
     (go LOOPSTART))         
   END))

;;; BLOCK/TAGBODY/GO version
(block sussman-printer-loop
  (let ((i 0))
    (tagbody
     LOOPSTART
       (incf i)
       (princ "Sussman")
       (terpri)    
       (if (= i 1000)
       (return-from sussman-printer-loop nil)       
       (go LOOPSTART)))))


;;; Turned that LET into a LAMBDA
((lambda (i)
    (block sussman-printer-loop
      (tagbody
       LOOPSTART
     (incf i)
     (princ "Sussman")
     (terpri)    
     (if (= i 1000)
         (return-from sussman-printer-loop nil)       
         (go LOOPSTART))))) 0)


;;; Used CATCH and THROW
(catch 'complete
  ((lambda (i)
     (block sussman-printer-loop
       (tagbody
    LOOPSTART
      (setf  i (+ i 1))
      (princ "Sussman")
      (terpri)    
      (if (= i 1000)
          (throw 'complete nil)
          (go LOOPSTART))))) 0))


;;; It's starting to get a boring so, this is it for now. A Scheme version using continuations might be interesting too.

Name: Anonymous 2009-08-19 0:28


;;; Forgot another possiblity, DO
(do ((i 1))
    ((= i 1000))
  (princ "Sussman")
  (terpri))

Name: Anonymous 2009-08-19 0:30

[code]
;;; Oops, forgot incrementing i
(do ((i 1) (1+ i))
    ((= i 1000))
  (princ "Sussman")
  (terpri))
[/code

Name: Anonymous 2009-08-19 0:34

for /l %c in (1,1,1000) do echo Sussman%v

There you go.. All unique.

Name: Anonymous 2009-08-19 0:41

>>26
Looks valid to me.

Name: Anonymous 2009-08-19 0:44

>> 30-31

;;; finally fixed
(do ((i 1 (1+ i)))
    ((= i 1000))
  (princ "Sussman")
  (terpri))

Name: Anonymous 2009-08-19 0:47

individualistic way { Output(1000 Sussmen) } "GRUNNER"

Name: Anonymous 2009-08-19 0:56


;;;; It seems I'm still bored, have some other versions

;;; Print a string and a newline
(defun pnew (x)
  (format t "~A~%" x))

;;; MAP version
(let ((sussman-array (make-array 1000 :initial-element "Sussman")))
  (map nil #'pnew sussman-array))

;;; Define a circular (infinite on naive inspection) list of "Sussman"'s and map over a subsequence of it
(let ((forever-sussmans (cons "Sussman" nil)))
  (setf (cdr forever-sussmans) forever-sussmans)
  (mapc #'pnew (subseq forever-sussmans 1 1000)))

Name: UMH memesmith !gNlkr4vCuc 2009-08-19 22:22


       IDENTIFICATION DIVISION.
       PROGRAM-ID. Prog-Can-Go-To-Hell.
       AUTHOR. UMH memesmith.
       DATE-WRITTEN. AUG 2009.
      * COMMENTS.
      *****************************************************
      * You're a bunch of assholes, you know that?  You all
      * deserve what's coming to you.  I tried to be nice
      * and give you a chance, but you had to keep using
      * that fucking stupid meme.  I won't have it.  Enjoy
      * your meta-sage, motherfuckers.
      *****************************************************
       DATA DIVISION.
       WORKING-STORAGE SECTION.
       01 WORK-AREAS.
           05 SUSSMANS-WRITTEN          PIC 9999.
       01 SUSSQUOTE.
           05 SQ-KICKI                  PIC X(2).
           05 FILLER                    PIC X(6).
           05 SQ-IMMIG                  PIC X.
           05 FILLER                    PIC X(7).
           05 SQ-OFFIC                  PIC X.
           05 FILLER                    PIC X(13).
       01 SUSSQUOTE-B.
           05 FILLER                    PIC X(3).
           05 SQ-INTHE                  PIC X.
           05 FILLER                    PIC X(21).
       PROCEDURE DIVISION.
       PROGRAM-BEGIN.
           PERFORM 100-INITIALIZE.
           PERFORM 200-RUNSUSSMAN.
           STOP RUN.

       100-INITIALIZE.
           MOVE ZEROES TO SUSSMANS-WRITTEN
           MOVE "AND CONJURE THE SPIRITS OF THE" TO SUSSQUOTE
           MOVE " COMPUTER WITH OUR SPELLS" TO SUSSQUOTE-B.

       200-RUNSUSSMAN.
           PERFORM VARYING SUSSMANS-WRITTEN FROM 0 BY +1
               UNTIL SUSSMANS-WRITTEN = 1000
             DISPLAY SQ-OFFIC SQ-IMMIG SQ-OFFIC SQ-OFFIC
               SQ-INTHE SQ-KICKI
           END-PERFORM.

Name: Anonymous 2009-08-19 22:57

>>37
Excuse me?

Please explain what is going on here so that I might translate it to a saner language like APL or Fortran.

Name: Anonymous 2009-08-19 23:53

for (int64_t i = 0; i < 1; i++) {
    for (int64_t j = 0; j < 10; j++) {
        for (int64_t k = 0; k < 10; k++) {
            for (int64_t l = 0; l < 10; l++) {
                std::cout << "SUSSMAN";
            }
            std::cout << std::endl;
        }
    }
}

Name: Anonymous 2009-08-20 0:00

for (int64_t i = 0; i < 1; i++)

（　´_＞｀）

Name: Anonymous 2009-08-20 0:17

; i++)

（　´_＞｀）

Name: Anonymous 2009-08-20 0:46

>>40-41
（　´_ゝ`）

Name: Anonymous 2009-08-20 1:33

>>40-42
I can't read your moonspeak boxes.

Name: Anonymous 2009-08-20 1:39

>>43
I can't read your moonspeak COBOL, UMH memechan-smith.

Name: Anonymous 2009-08-20 1:55

>>44
This might surprise you, but I am not the UMH memechan-smith.

Name: Anonymous 2009-08-20 1:58

>>45
You're lying.

Name: Anonymous 2009-08-20 2:53

>>46
UMH memechan-smith seems to be quite proud of what he has done.
I wouldn't be. No, I'm not lying.

Name: Anonymous 2009-08-20 11:13

>>47
>I wouldn't be.

for indeed it defeats to whole purpose of magnanimity to claim ownership of something

furthermore you cant own a meme for once its been set free upon the hive mind it belongs to the communal (un)consciousness

Name: Anonymous 2009-08-20 11:15

>>48 s/magnanimity/anoniminity

damn spell checker

Name: Anonymous 2009-08-20 11:15

progfind.sh:
#!/bin/sh
if [ -z $1 ]; then
 echo "USAGE: progfind [regex]" 1>&2
else
 wget -qO- http://dis.4chan.org/prog/subject.txt \
 | sed '/'"$*"'/I!d;s/^\(.*\)<>.*<>.*<>\(.*\)<>.*<>.*<>\(.*\)$/\
Title: \1\
URL: http:\/\/dis.4chan.org\/read\/prog\/\2\
Posted: \2\
Last Post: \3/'\
 | perl -MPOSIX -ple\
   's/^([a-z ]*Post[a-z]*: )(\d+)$/$1.strftime"%c",localtime$2/gei,chomp'
fi

and then:
./progfind.sh sussman

Name: Anonymous 2009-08-20 11:24

>>50
That's not even one hundred Sussmen.

Name: Anonymous 2009-08-20 11:38

>>51
how many are in each of those threads?

Name: Anonymous 2009-08-20 12:43

>>52
According to this script (which probably contains severe bugs but more or less agrees with the previous version of my hack) there are about 500.
#!/usr/bin/perl
use strict;
use warnings;

die 'USAGE: progfind.pl [regex]' if scalar(@ARGV) < 1;
my $regex = join ' ', @ARGV;
`curl -sO http://dis.4chan.org/prog/subject.txt`;

open my $subj, 'subject.txt';
my $i = 0;
while (<$subj>) {
  my ($ti,$au,$wut,$id,$le,$lp,$li) = split '<>';
  next unless $ti =~ /$regex/i;
  `curl -so temp.html http://dis.4chan.org/read/prog/$id`;
  open my $fh, 'temp.html';
  while (<$fh>) {
    while (/$regex/ig) { $i++; }
  }
  close $fh;
}
close $subj;
print $i;

Name: Anonymous 2009-08-20 12:53

>>53
I can tell you're not >>50-chan, because >>50-chan uses wget and you use curl. No pretending, please.

Name: Anonymous 2009-08-20 14:55

>>16
i hate your kind.

perl -le 'print "Sussaman" for 1..100'

Name: Anonymous 2009-08-20 15:06

>>55
is this french ?
i never knew that perl and french have so much in common , it all makes sense now .

Name: Anonymous 2009-08-20 16:08

>>55 Oh yeah? Well FUCK your theory.

You mean people that try and make Perl others can read it (or I can read it a year from now). I see, you really are quite that impressed with your own cleverness type of faggot aren't you?

Is that you FV posting as Anon?

Name: Anonymous 2009-08-20 16:15

-- Sussmen.scpt copyright © 2009 dArksTeveJ darkstevej@mac.com
-- If u use this applescript for your own script then u must credit me
-- Thx 2 420dude for the loop script & MIKE3000 for debug/testing

set the Sussman to "Sussman " as string
set the Sussmen to "" as string
set the NumberOfSussmenToOuptut to 1000

repeat with TheTemporaryIndexOfTheLoop from 0 to the NumberOfSussmenToOuptut
    set the Sussmen to the Sussmen & the Sussman
end repeat

display dialog Sussmen

_________
Sent from my Macbook Pro

Name: Anonymous 2009-08-20 16:18

>>58 MUST CREDIT YOU??

I don't think so Tim.

Name: Anonymous 2009-08-20 16:40

>>57
Are you high?  He did it in a clean, obvious, standard way.  It's the idiots who never bother learning the language beyond C with Sigils who need to stop coding forever.
And on that note, perl -e'print"Sussman\n"x1000'

Name: Anonymous 2009-08-20 16:41

>>58
I just looked up applescript and I have learned that it is the real syntax. Holy shit, INSTANT.EXE quality.

Name: =+=*=F=R=O=Z=E=N==V=O=I=D=*=+= !fRoZeNHN4I 2009-08-20 16:57

[code]/* Sussmen.c
 *
 * Copyright (C) 2009 Frozen-Void frozenvoid@gmail.com
 *
 * If you use this C prog. for your own use then you must credit me.
 *
 */

#include "void.h" /* handles all the common functions,#defines,#ifdefs and #includes */

vd main() {FILE *fp;char *sussman="Sussman";int i;
for(i=0;i<1000;i++){printf("%s\n",sussman);}return 0;}

_________________________________________________
http://xs135.xs.to/xs135/09042/av922.jpg
Velox Et Astrum gamedev forum: http://etastrum.phpbb3now.com
orbis terrarum delenda est

Name: =+=*=F=R=O=Z=E=N==V=O=I=D=*=+= !fRoZeNHN4I 2009-08-20 16:58

oops my bad

/* Sussmen.c
 *
 * Copyright (C) 2009 Frozen-Void frozenvoid@gmail.com
 *
 * If you use this C prog. for your own use then you must credit me.
 *
 */

#include "void.h" /* handles all the common functions,#defines,#ifdefs and #includes */

vd main() {FILE *fp;char *sussman="Sussman";int i;
for(i=0;i<1000;i++){printf("%s\n",sussman);}return 0;}

_________________________________________________
http://xs135.xs.to/xs135/09042/av922.jpg
Velox Et Astrum gamedev forum: http://etastrum.phpbb3now.com
orbis terrarum delenda est

Name: Anonymous 2009-08-20 16:58

>>63
Copyright doesn't work like that, dumb ass.

Name: Anonymous 2009-08-20 17:00

>>58
#include <iostream>
#define the

int the main()
{
    std::string the Sussman = std::string("Sussman ");
    std::string the Sussmen = std::string("");
    int the NumberOfSussmenToOuptut = 1000;

    for (int TheTemporaryIndexOfTheLoop = 0; TheTemporaryIndexOfTheLoop < the NumberOfSussmenToOuptut; TheTemporaryIndexOfTheLoop++)
        the Sussmen = the Sussmen + the Sussman;
    std::cout << Sussmen << std::endl;
}
// dick

Name: Anonymous 2009-08-20 17:03

>>62,63
The real  would never use code tags.

Name: Anonymous 2009-08-20 17:08

>>59
ihbmt

Name: Anonymous 2009-08-20 17:31

>>60
yes Sussman|head -n1000
there are some jobs where perl isn't the right tool. this is one of them.

Name: Anonymous 2009-08-20 17:39

perl isn't the right tool
IHBT

Name: Anonymous 2009-08-20 17:42

>>68
it's funny, people used to use shell scripts when they should use perl. now they seem to have the opposite problem.

Name: Anonymous 2009-08-20 17:47

1000 Sussmen, in english.


Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman

Name: Anonymous 2009-08-20 18:24

>>71
This won't compile for me.

Name: Anonymous 2009-08-20 18:32

>>71
That's not English. That's buffalo.

Name: Anonymous 2009-08-20 18:33

>>72
It's already compiled.

Name: Anonymous 2009-08-20 18:37

>>74
Then it won't execute.

Name: Anonymous 2009-08-20 18:38

>>75
It's already executing.

Name: Anonymous 2009-08-20 18:42

>>76
It's executing me.

It's killing me!

Name: Anonymous 2009-08-20 18:49

>>77
Your not funny.

Name: Anonymous 2009-08-20 18:57

>>55
i hate your kind.

perl -E'say"Sussman"x1000'

Name: Anonymous 2009-08-20 19:10

>>79
see >>68.

Name: Anonymous 2009-08-20 19:25

>>80
eval pack'h*','072796e647229402861647560297f657e202a382a022778696c6560213'

Name: Anonymous 2009-08-20 19:40

>>79
Not spacing your Sussmen is bad form.

Name: Anonymous 2009-08-20 20:10

>>82
Conformist

Name: Anonymous 2009-08-20 21:54

(let-syntax ((individual (syntax-rules ()
                           ((_ a b) (let L ((n a)) (if (= n 1) b (begin (display b) (newline) (L (- n 1)))))))))
  (individual 10 (individual 10 (individual 10 'sussman))))

Name: Anonymous 2009-08-21 2:22

(take 1000 (repeatedly #(println "The Sussman")))

Name: Anonymous 2009-08-21 2:48

(loop repeat 1000 do (format t "Sussman~&"))

Name: Anonymous 2009-08-21 4:15


#include <stdio.h>

//sup /prog/

void main(int argc, char *argv[]) {
 int i = 1000; //individualistic way or whatever
 while(i) {
   puts("Sussman");
   i--;
 }
}

Name: Anonymous 2009-08-21 4:16

>>87
You suck at C.

Name: Anonymous 2009-08-21 4:28

>>88
i know , suck on purpose .

Name: Anonymous 2009-08-21 4:30

>>89
No, you suck beyond how you think you suck. Please read K&R.

Name: Anonymous 2009-08-21 4:58

/*
    This program is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program.  If not, see <http://www.gnu.org/licenses/>;.
*/
#include<stdlib.h>
#include<stdio.h>
main()
{
   int x;
   for(x = 0; x < 1000; ++x){
      void *tmp_ptr = NULL;
      malloc(sizeof "sussman");
      typedef char * String;
      String real_ptr = NULL;
      real_ptr = strcpy(tmp_ptr, "sussman");
      int i;
      for(i = 0; i < sizeof "sussman"; ++i)
         putchar(real_ptr + i);
      }
      free(tmp_ptr);
   }
}

Name: Anonymous 2009-08-21 5:02

>>90
I've read your post three times now, and it still doesn't say ``SICP''. I don't understand what is happening to me. :(

Name: Anonymous 2009-08-21 5:17

>> 91
     void *tmp_ptr = NULL;
     malloc(sizeof "sussman");
You're throwing that allocated memory away, and then attempting to strcpy to a NULL pointer.

Name: Anonymous 2009-08-21 5:41

>>93
Amongst other things, but frankly, what irked me the most was the complete disregard for the GNU coding standards.

Name: Anonymous 2009-08-21 6:36

>>93,94
YHBT

Name: Anonymous 2009-08-21 7:11

>>79

#!/usr/bin/perl

use strict;
use warnings;

use Template;

my $tt = Template->new();
my $vars = {
        sussmen => sub { return "sussman " x1000; }
};
$tt->process(\*DATA, $vars);

__DATA__
[% FOREACH sussman IN sussmen %]
<prog>
        [% sussman %]
</prog>
[% END %]

Name: Anonymous 2009-08-21 11:28

>>96
valid /dev/random

Name: Anonymous 2009-08-21 16:35

>>96
[% FOREACH sussman IN sussmen %]
IHBT

Name: Anonymous 2009-08-21 21:57

>>98
It means that there is a Sussman sleeping in every Sussman. Don't worry if you don't get it, that's some pretty deep stuff.

Name: Anonymous 2009-08-21 22:33

>>39
I'm going to be an individual and output 1024 Sussmen.
for (int64_t i = 0; i < 1; i++) {
    for (int64_t j = 0; j < 2; j++) {
        for (int64_t k = 0; k < 2; k++) {
            for (int64_t l = 0; l < 2; l++) {
                for (int64_t m = 0; m < 2; m++) {
                    for (int64_t n = 0; n < 2; n++) {
                        for (int64_t o = 0; o < 2; o++) {
                            for (int64_t p = 0; p < 2; p++) {
                                for (int64_t q = 0; q < 2; q++) {
                                    for (int64_t r = 0; r < 2; r++) {
                                        for (int64_t s = 0; s < 2; s++) {
                                            std::cout << "SUSSMAN";
                                        }
                                    }
                                }
                                std::cout << std::endl;
                            }
                        }
                    }
                }
            }
        }
    }
}

Name: Anonymous 2009-08-21 23:25

1024 Sussmen
You'll shoot your eye out, kid.

Name: Anonymous 2009-08-22 4:56

>>101
What?

Name: clever guy 2009-08-22 5:02

function thousand_sussmans(arr)
 local arr_index = 0
 local arr_iter = function ()
  arr_index = arr_index + 1
  if(arr_index <= #arr) then return arr_index end
 end
 return function ()
  arr[1] = arr[1] + 1
  arr_index = 0
  while(arr_iter()) do
   if(arr[arr_index + 1]) then
    arr[arr_index + 1] = arr[arr_index + 1] + math.floor(arr[arr_index] / 10)
   end
   arr[arr_index] = arr[arr_index] % 10
  end
  local sum = 0
  for i, v in ipairs(arr) do sum = sum + v end
  print "Sussman"
  return not (sum == 0)
 end
end

inventive_fashion = thousand_sussmans({0, 0, 0})
while(inventive_fashion()) do end

Name: Anonymous 2009-08-22 6:46

>>103
Lua <3

Though please optimize your code by the use of [code][/code] tags.

Name: Anonymous 2009-08-22 6:52

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
<head>
    <meta http-equiv="Content-Type" content="text/html; charset=utf-8"/>
    <title>1000 Sussmen in the HTML programming language</title>
</head>

<body>
<div id="container">
    <div id="main">
        <p>Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman Sussman </p>
    </div>
</div>

</body>
</html>

Name: Anonymous 2009-08-22 7:29

+++++[->++++++<]>-
[->+++>++++>++++>++++>+++>++++<<<<<<]
>---->+>->------->++++++++++>------>++++++++++
>>>>+++++[-<
    +++++[-<
        +++++[-<
            ++++++++[-<
                <<<<<<.>.>..>.>.>.>.
            >]
        >]
    >]
>]

Name: Anonymous 2009-08-22 7:35

>>106
This calls for my optimizing Brainfuck compiler!

#!/usr/bin/python

CC = "gcc"
tokens = "><+-[].,#"

import sys, os

if sys.stdin.isatty():
    sys.stderr.write("Usage: %s < file.bf\n" % sys.argv[0])
    sys.exit(1)

t = filter(lambda a: a in tokens, "".join(sys.stdin.readlines()))
c, p, n = ['int main() {', 'unsigned char mem[9999], *p = mem;'], 0, False

while p < len(t):
    add = 0
    while t[p] == '+' or t[p] == '-':
        add += 1 if t[p] == '+' else -1
        p += 1
    if add == 1:
        c.append('++*p;')
    elif add == -1:
        c.append('--*p;')
    elif add < 0:
        c.append('*p -= %d;' % (add * -1))
    elif add > 0:
        c.append('*p += %d;' % add)

    add = 0
    while t[p] == '>' or t[p] == '<':
        add += 1 if t[p] == '>' else -1
        p += 1
    if add == 1:
        c.append('++p;')
    elif add == -1:
        c.append('--p;')
    elif add < 0:
        c.append('p -= %d;' % (add * -1))
    elif add > 0:
        c.append('p += %d;' % add)

    if t[p] == '[':
        c.append('while (*p) {')
        p += 1
    elif t[p] == ']':
        c.append('}')
        p += 1
    elif t[p] == '.':
        if n:
            c.append('printf("%d ", *p);')
        else:
            c.append('putchar(*p);')
        p += 1
    elif t[p] == ',':
        c.append('*p = getchar();')
        p += 1
    elif t[p] == '#':
        c[0] = "#include <stdio.h>\nint main() {";
        n = not n
        p =+ 1

c.append('return 0;')
c.append('}')

cfile = os.tempnam() + ".c"
csrc = open(cfile, 'w')
csrc.write("\n".join(c) + "\n")
csrc.close()

args =[CC]
if len(sys.argv) > 1:
    args.extend(sys.argv[1:])
args.append(cfile)
os.spawnvpe(os.P_WAIT, CC, args, os.environ)

os.remove(cfile)

Name: Anonymous 2009-08-22 10:16


import Data.IORef
foreach = flip mapM_
while test action = do
  val <- test
  if val then do {action;while test action}
         else return ()
incr ref = modifyIORef ref (+1)
test ref f = do { val <- readIORef ref; return (f val) }
main = do
  foreach [1..0] print
  ref <- newIORef 0
  while (test ref (< 1000))
        (do
      print "Sussman"
          incr ref)

Name: Anonymous 2009-08-22 11:29

>>108
I cried.

Name: Anonymous 2009-08-22 13:07

This is my Sussman program.

/* spam.c - Spam a thread on the BBS boards.
 *
 * USAGE: spam <times> <wait> <folder>
 *
 *
 * <wait> is the period in milliseconds between posts.
 *
 * In order to spam a thread, you need a folder containing
 * a HEADER.TXT and a MSG.TXT.
 *
 * The HEADER.TXT contains all HTTP info to be sent to the server.
 * The MSG.TXT contains the content string -- ie. your name, email, and your
 * post.  It also contains the ID of the thread you wish to spam, and which
 * board it can be found in.
 *
 * * EXAMPLE *
 *
 * > spam 50 6000 progsage
 *
 * If you have the files progsage\header.txt and progsage\msg.txt, the program
 * will spam a thread (specified in MSG.TXT) with 50 posts, waiting 6 seconds
 * (6000 milliseconds) between each post.
 *
 */

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <windows.h>
#include <winsock.h>

const int port = 80;

unsigned long int times, count=0, rest=0;

char threadid[11];

FILE* fp;
FILE* fpmsg;
FILE* logfp;

SOCKET sock;
SOCKADDR_IN addr;
struct hostent* host;

char http_clength[64];

char content[8192];

char buffer[1024];
char rbuffer[2048];

char folder[256];
char f_header[256];
char f_msg[256];



int main(int argc, char* argv[])
{
     /*** Winsock startup variable */
     WSADATA wsaData;
     int loop, i;


     if (argc != 4)
     {
          printf("usage: spam <times> <interval> <folder>\n");
          printf("       folder must contain a header.txt and a msg.txt\n");
          return 0;
     }

     /* <times> to spam the thread */
     times = atoi(argv[1]);

     /* <interval> in milliseconds between posts */
     rest = atoi(argv[2]);

     /* folder to find header.txt and msg.txt inside */
     if (strlen(argv[3]) <= 244)
          strcpy(folder, argv[3]);
     else {
          printf("folder too long.\n");
          return 0;
     }


     if (WSAStartup(MAKEWORD(2,0), &wsaData))
     {
          printf("Failed to start WinSock.\n");
          return 0;
     }


     strcat(f_header, folder);
     strcat(f_header, "\\header.txt");
     printf("HEADER: %s\n", f_header);

     strcat(f_msg, folder);
     strcat(f_msg, "\\msg.txt");
     printf("MSG: %s\n", f_msg);

     while (count++ < times)
     {
          /* Create our socket */
          sock = socket(AF_INET, SOCK_STREAM, 0);

          host = gethostbyname("dis.4chan.org");

          memset(&addr, 0, sizeof(addr));
          addr.sin_family = AF_INET;
          addr.sin_addr.s_addr = ((struct in_addr*)(host->h_addr))->s_addr;
          addr.sin_port = htons(port);

          if (connect(sock, (SOCKADDR*) &addr, sizeof(addr)))
          {
               printf("Unable to connect to host. %u\n", WSAGetLastError());
               return 0;
          }

          printf("Connected successfully.\n");

          printf("Sending header.\n");

          fp = fopen(f_header, "r");

          loop = 0;
          while (!feof(fp))
          {
               ++loop;
               fgets(buffer, 1024, fp);
               i = strlen(buffer);
               buffer[i-1] = 0x0D;
               buffer[i] = 0x0A;
               buffer[i+1] = 0;
               printf("%s", buffer);
               send(sock, buffer, strlen(buffer), 0);
          }


          /* GetContent(); */
          fpmsg = fopen(f_msg, "r");
          fgets(content, 8191, fpmsg);
          fclose(fpmsg);

          /*** Create content-length ***/
          sprintf(http_clength, "Content-Length: %u", strlen(content));
          printf("%s\n", http_clength);
          send(sock, http_clength, strlen(http_clength), 0);

          sprintf(buffer, "\x0D\x0A\x0D\x0A");
          send(sock, buffer, 4, 0);


          printf("%s\n", content);
          send(sock, content, strlen(content), 0);

          sprintf(buffer, "\x0D\x0A");
          send(sock, buffer, 2, 0);

          recv(sock, rbuffer, 2048, 0);
          printf("\n%s\n", rbuffer);

          closesocket(sock);
          fclose(fp);

          printf("\nFinished! %d/%d\n", count, times);

          if (count < times) 
               Sleep(rest);

     }


     printf("*** COMPLETE ***\n\n");

     WSACleanup();
}

-
Here is the HEADER.TXT

POST /post HTTP/1.1
Host: dis.4chan.org
User-Agent: Mozilla/5.0 (Windows; U; Windows NT 5.1; en-US; rv:1.8.1.20) Gecko/20081217 Firefox/2.0.0.20 (.NET CLR 3.5.30729)
Accept: text/xml,application/xml,application/xhtml+xml,text/html;q=0.9,text/plain;q=0.8,image/png,*/*;q=0.5
Accept-Language: en-us,en;q=0.5
Accept-Encoding: gzip,deflate
Accept-Charset: utf-8;q=0.7,*;q=0.7
Keep-Alive: 300
Referer: http://dis.4chan.org/prog/
Cookie: nws_style=Yotsuba; __utma=228619097.3169207663460969500.1242172576.1249734563.1249740607.280; ws_style=Yotsuba B; 4chan_pass=bZitTCnk; __utmz=228619097.1249693429.274.7.utmcsr=google|utmccn=(organic)|utmcmd=organic|utmctr=%22A%20fatal%20error%20occured%21%22%20%22Please%20don%27t%20click%20on%20that%20link%20again%21%22; __qca=1242172584-47686337-4694767; 4chan_email=noko; __qcb=557482846; __utmb=228619097.219.10.1249740607; __utmc=22861909
Content-Type: application/x-www-form-urlencoded


It may be good to have a new line at the end of the file there, I'm not sure if it's needed though.

Here is the MSG.TXT:

bbs=prog&id=1250606147& lol what 2&kotehan=&meiru=&com=Sussman&email=

And I run it with spam 1000 6000 sussmen.

The Sussmen folder contains my header.txt and msg.txt

I think I win.

Name: Anonymous 2009-08-22 13:14

>>110
Won't actually print a thousand Sussmen, because Shiitchan will threadstop it first

Name: Anonymous 2009-08-22 13:34

>>107
You should compile to LLVM and let it do the optimising for you.

Name: clever guy 2009-08-22 15:00

>>104
U MENA LIEK THIS?

function coprime(n)
 local index = 0
 local test = function (m)
  local current = n
  repeat
   current = current % m
   if(current == 0) then return (m == 1) end
   m = m % current
  until(m == 0)
  return (current == 1)
 end
 return function ()
  repeat index = index + 1 until(test(index))
  if(index <= n) then return index end
 end
end
for i = 1, 57 do for j in coprime(i) do print "Sussman" end end

Name: sander 2009-08-22 19:26

WAT

WAT

OKAAAAY

Name: Anonymous 2009-08-23 3:40

>>112
shit, that might actually perform decently

Name: Anonymous 2009-08-23 4:30

"Excuse me sir, can you please sit on my computer output a thousand Sussmen in an individualistic way for me?"

Name: Anonymous 2009-08-23 5:01


#define please int i;
#define print for(i = 0;
#define one i < 1000;
#define thousand i++)
#define sussmen puts("Sussman");
main()
{
   /*
   *   i am always polite to my computer.
   *   you should be too
   */
   please print one thousand sussmen
}

Name: Anonymous 2009-08-23 8:22


#define please int i;
#define print for(i = 0;
#define one i < 1000;
#define thousand i++)
#define sussmen puts("Sussman");
#define thanks return 0;
main()
{
   /*
   *   i am always polite to my computer.
   *   you should be too
   */
   please print one thousand sussmen
   thanks
}

Remember your please and thank yous >>117

Name: Anonymous 2009-08-23 9:15

>>118
gcc -Wall -Wextra -ansi -std=c89 -pedantic test.c
test.c:8: warning: return type defaults to 'int'
test.c: Int function 'main':
test.c:13: warning: implicit declaration of function 'puts'

Name: Anonymous 2009-08-23 10:42

>>119
it made me laugh that gcc has a "pedantic" mode

Name: Anonymous 2009-08-23 10:46

>>119
-ansi -std=c89
W-(

Name: Anonymous 2010-11-15 23:24

Name: Anonymous 2010-12-06 10:00

Back to /b/, ``GNAA Faggot''
Don't change these.
Name: Email:
Entire Thread Thread List
All trademarks and copyrights on this site are owned by their respective parties. All comments and posts are the responsibility of their own posters.
- Tinychan + 2ch Mode -