Name: 2009-08-18 10:35
Output a thousand Sussmen in an individualistic way.
(take 1000 (repeatedly #(println "The Sussman")))
(loop repeat 1000 do (format t "Sussman~&"))
#include <stdio.h>
//sup /prog/
void main(int argc, char *argv[]) {
int i = 1000; //individualistic way or whatever
while(i) {
puts("Sussman");
i--;
}
}/*
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);
}
}
#!/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 %]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;
}
}
}
}
}
}
}
}
<!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>
#!/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)
/* 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();
}
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"Excuse me sir, can you please sit on my computer output a thousand Sussmen in an individualistic way for me?"
#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
}
#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
}gcc -Wall -Wextra -ansi -std=c89 -pedantic test.ctest.c:8: warning: return type defaults to 'int'test.c: Int function 'main':test.c:13: warning: implicit declaration of function 'puts'