/g/ - Technology

>>3529

#include <iostream>

double calc_factorial(int n);

int main()
{
  int n;
  std::cout << "enter a number >= 0 to calculate factorial: \n";
  std::cin >> n;
  while(n < 0){
    std::cin.clear();
    std::cout << "enter a number >= 0 to calculate factorial: \n";
    std::cin >> n;
  }
  std::cout << calc_factorial(n) << std::endl;

  return 0;
}

double calc_factorial(int n)
{
  if(n == 0){
    return 1;
  }else{
    return n * calc_factorial(n - 1);
  }
}

roll

>>3531

>31

ah hell nah

On a sidenote, I hope someone gets 23. We need one for 8chan.

roll

>>3583

that one looks fun anon.

I need to write a list container today, but I will roll for a new exercise. Fully expect 84 on account of /g/ being slow.

Rolling

>>3595

Fuck you guys.

rollyn

Cool, I'll try.

>>3600

<button onclick="namesFunction()">click</button>

<p id="output"></p>

<script>

document.write("<style>b{color:green}</style>");

function namesFunction() {

var x = document.getElementById("output");

var y = [

"<b>Bob</b> \

<br>Specialty: master fapper \

<br>Education: high school dropout",

"<b>Jil</b> \

<br>Specialty: huge cunt \

<br>Education: college paper",

"<b>Jak</b> \

<br>Specialty: can put large dildos into his anus \

<br>Education: middle school",

"Rob text text text...",

"Tom text text text...",

"Bil text text text...",

"Kim text text text...",

"Joe text text text...",

"Mel text text text...",

"Meg text text text..."

];

x.innerHTML = y[Math.floor(Math.random() * 10)];

}

</script>

>>3601

Cool anon. I don't do web stuff but lately I've been picking up javascript for firefox extensions.

<button> is html tag and namesFunction() is the callback when clicked?

Here is my shitty paint program from >>3584

It's not yet fully implemented and has some errors (not a 1-to-1 correspondence between what is shown and what is saved, keeping track of all those points is slow eventually and isn't the best approach. Group paint isn't functional yet. Also, not the best OOP...)

http://pastebin.com/mcTWSZjZ

>>3623

Looking through it now, cool anon.

Also, I'm rollin' for a new exercise.

Lets see dis shiz

>>3628

>[object Object]

#include <stdio.h>
#include <stdlib.h>

int main(int argc, char **argv)
{
	long current = 0;
	long previous = 0;
	int numCases;

	printf("Enter number of test cases for the fibonacci sequence: ");
	scanf("%d", &numCases);

	long *numbers = (long*)malloc(sizeof(long)*numCases);

	int i;

	for(i = 0; i < numCases; i++){
		if(i == 0)
			numbers[i] = current;
		if(i == 1){
			numbers[i] = 1;
			current = 1;
		}
		else{
			numbers[i] = current + previous;
			previous = current;
			current = numbers[i];
		}
        printf("\n");
		printf("%d", numbers[i]);
	}

	free(numbers);
}

>>3629

>[object Object]

I just realized how much extraneous shit i put in there. Welp.

>>3629

Rolling for another project.

roll

Rolling.

Rawhide

Java rollin

Rollin'

Cobol

Roll

go up

rolling

rerolling since i don't understand what a name generator does

>>3529

rolling

>>3529

Fucking rollin

>>3529

nigger

they call me the sandman

roll

rollin

>>3861

gotta reroll, actually just did this earlier

>>3529

rollando

>>3529

>No re-rolls

yeah, fuck 70 for right now.

rh'llor

oh boy

>>3877

I don't know what this means

>>3529

fuck it let's go

>>3878

Brainfuck is an esoteric programming language.

An interpreter is a program which will take commands in a programming language and run them.

>>3890

used pastebin for syntax coloring, after mailing it to myself from another pc.

Kinda goofy.

I'm rollllling

>>3922

I pass. This list is shit.

cocks

>>3529

Rolling

>>3529

rolodobolo

Rollin

rolling

I know I didn't roll it, but I'm new to Java and this thread inspired me to write a program that counts the number of letters, words, and sentences in your input.

Tell me if I'm doing something dumb or unneeded in doing this

package countwordsinastring;

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        System.out.println("(Type 'EXIT' to exit)");
        System.out.println("Enter complete sentences:");
        boolean stillRunning = true;

        while(stillRunning){
        Scanner input = new Scanner(System.in);
        String userInput = input.nextLine();

        if(!userInput.equals("EXIT")){
        int sentences = 0 ;
        int words = 1 ;
        int letters = 0;

            System.out.println();

            int i = 0;
        char[] inputArr = new char[userInput.length() + 2];

        for (i = 0; i < userInput.length(); i++) {
            inputArr[i] = userInput.charAt(i);

            if(!Character.isLetter(inputArr[i])){
            switch (inputArr[i]) {
                case ' ':
                    words++;
                    break;
                case '.':
                    sentences++;
                    break;
                case '!':
                    sentences++;
                    break;
                default:
            }
            }else{
                letters++;
            }
        }



        if (sentences == 0) {
                sentences = 1;
            } else if(sentences > 0 && inputArr[userInput.length() - 1] != '.'
                      && inputArr[userInput.length() - 1] != '!') {
                sentences++;
            }

        System.out.println("Number of letters: " + letters);
        System.out.println("Number of words: " + words);
        System.out.println("Number of sentences: " + sentences);

            System.out.println();

        }else{
            stillRunning = false;
        }
        }
    }
}

>>3982

Focking shit

Ignore the fact that I initialize inputArr as having 2 more than userInput.length();

That was a mistake made in seeing if I could make it so that it doesn't add a sentence when it picks up on a "..." but that didn't work out so I removed it from the code

>>3982

Sorry to put so much on this thread but reading this after I posted it made me notice some formatting issues that were bugging me.

Made it more readable.

package countwordsinastring;

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        System.out.println("(Type 'EXIT' to exit)");
        System.out.println("Enter complete sentences:");
        boolean stillRunning = true;

        while (stillRunning) {
            Scanner input = new Scanner(System.in);
            String userInput = input.nextLine();

            if (!userInput.equals("EXIT")) {
                int sentences = 0;
                int words = 1;
                int letters = 0;
                int i = 0;

                System.out.println();

                char[] inputArr = new char[userInput.length()];

                for (i = 0; i < userInput.length(); i++) {
                    inputArr[i] = userInput.charAt(i);

                    if (!Character.isLetter(inputArr[i])) {
                        switch (inputArr[i]) {
                            case ' ':
                                words++;
                                break;
                            case '.':
                                sentences++;
                                break;
                            case '!':
                                sentences++;
                                break;
                            default:
                        }
                    } else {
                        letters++;
                    }
                }



                if (sentences == 0) {
                    sentences = 1;
                } else if (sentences > 0 && 
                    inputArr[userInput.length() - 1] != '.' && 
                    inputArr[userInput.length() - 1] != '!') {
                    sentences++;
                }

                System.out.println("Number of letters: " + letters);
                System.out.println("Number of words: " + words);
                System.out.println("Number of sentences: " + sentences);

                System.out.println();

            } else {
                stillRunning = false;
            }
        }
    }
}

I'm gonna print this image out and use it as a means of inspiration for projects in Java and C++, seeing as I'm simultaneously learning those languages. I'll take these on (not necessarily in order) and learn whatever I don't know that I need to in order to complete them in my free time when I'm not learning by other means.

Wish me luck fam

roll

>>3801

Generates names?

roll

Rolling bb

rolling

im gonna have to do this in swift fuck me

rollan

>>4047

Nobody wins in TTT.

LET'S DO IT

rolling

rolling

roll

rollan

>>3529

rollan

roll

rolling

>>3529

Rolling

roll.

>>4123

require 'json'
require 'open-uri'

if ARGV.length != 2
	puts "[-] Usage: 8chan-dl <board> <threadnum>"
end

board     = ARGV[0]
threadnum = ARGV[1].to_i

threadurl = "http://8ch.net/#{board}/res/#{threadnum}.json"

thread = JSON.parse(open(threadurl).read)

title = thread['posts'][0]['sub'].gsub /[ |\/]/, '_'
puts "[+] Thread title: #{title}"

dir = "./#{title}/".gsub ' ', '_'
Dir.mkdir dir if not Dir.exists? dir

for post in thread['posts'].select{|p| p.has_key? 'ext'}
	filename = "#{post['tim']}#{post['ext']}"
	img_url = "http://media.8ch.net/#{board}/src/#{filename}"
	puts "[+] Downloading #{img_url}"
	File.open("#{dir}#{filename}", 'wb') do |file|
		file.write(open(img_url).read)
	end
end

Not the best. Has no error handling and shit but it seems to work. Also wrote a 4chan one that is very similar if you guys want that.

Roooooooolll in the dungeon

rollan

>>3529

rol

roll

Rolling

>>4222

Rerolling for too easy

rawls

>>4224

SEPPUKU

http://7365676d656e746174696f6e206661756c74.blogspot.com/

>>3529

Rolling

i cant program but ill roll anyway

>tfw can't code for shit

>rolling anyway

Come on, FizzBuzz.

>>3529

rolling for easy task-

>>4260

what the hell is that ?

>>3529

balls

roll

le rolling

>>4261

https://www.youtube.com/watch?v=hmIrJCGPPG4

Rolling bb

>>3529

fucking roll

>>3529

roll

>>3529

roll

>>4416

public static String reverseString(String input)
{
	char[] chars = input.toCharArray();
	StringBuilder reversed = new StringBuilder();

	for(int i=input.length()-1;i>=0;i--)
		reversed.append(Character.toLowerCase(chars[i]));
	return reversed.toString();

}

they see me rollin', they codin'

Try me.

rollyo

rollan

>>4464

fuck your rules, rerollan

I terribly misunderstood the speed of this board...

I'll just look for something I know how to do...

>>3529

rolling will post later

>>3529

>>4471

#include <stdio.h>

unsigned triangularNumber(unsigned n);

const char *suffix[] = {" ","st","nd","rd"};

int main(int argc, char *argv[])

{

int n = 0,m;

unsigned t;

if ((argc < 2) ||

(sscanf(argv[1],"%d",&n) != 1) ||

(n <= 0))

{

printf("\nusage %s <n>\n",argv[0]);

printf(" where <n> is a positive integer\n");

return -1;

}

t = (int)(n * (((float)n + 1.0) / 2.0));

if (t == triangularNumber(n))

{

m = n % 10;

printf("\nThe %d%s triangular number is %d\n",

n,

((m > 0) && (m < 4)) ? suffix[m] : "th",

t);

}

else

{

printf("\nerror\n");

}

return 0;

}

unsigned triangularNumber(unsigned n)

{

if (n == 1) return 1;

return n + triangularNumber(n-1);

}

only works to around 65000 tho

roll

>>4479

>Chip-8 emulator

>have to emulate an instruction set I'm completely unfamiliar with

fug

roll

rolling bitcheS

>>4502

Welp that was easy. See you later bitcheS

> let celciusToFarenheit c = 32 + (c * 1.8)
> celciusToFarenheit 0
32.0
> celciusToFarenheit 100
212.0

Rolling

Rollin'

rawlin

>>4529

(defun fact (n)
  (if (= n 0)
    1
    (* n (fact (- n 1)))))

Rolled 61 (1d100)

rollin

they see me rollin'

rolling

>>3529

Fuck my shit up, OP.

roll

idk how to dice so my last post numbers are my roll

how does one do code tags?

>>3529

r0lll

>>3529

dubs.get()

>>4588

#include <stdio.h>
static const int ROWS = 67; //biggest that works
long double factorial(int argument){
        if(argument>=0){
                long double result=1;
                for(;argument>1;argument--)
                        result = result*argument;
                return result;
        }else{
                return -1; //out of range
        }
}
long double choose(int n, int k){
        return factorial(n) / ( factorial(k)*factorial(n-k) );
}
void pascal(unsigned long ptriangle[], int max_iter, int current_row){
        if(current_row>=max_iter||current_row<0){ //done or out of range
                return;
        }else{
                int i;
                for(i=0;i<=current_row;i++) //compute row
                        ptriangle[(current_row*(current_row+1)/2)+i] = choose(current_row,i);
                current_row++;
                pascal(ptriangle,max_iter,current_row); //next row
        }
}
void main(){
        int iter = ROWS+1;
        unsigned long triangle[(ROWS+1)*(ROWS+2)/2]; //n(n+1)/2
        pascal(triangle, iter, 0); //do important thing
        int i;
        for(i=0;i<(iter*(iter+1)/2);i++){ //print triangle
                if((triangle[i]==1)&&(triangle[i-1]==1)&&(i!=2)) //line breaks
                        printf("\n\n");
                printf("%lu ",triangle[i]);
        } return;
}

>>4586

Like this:

[code]code here

Rolled 46 (1d100)

roll

Rollan

Rolled 2 (1d100)

>>4599

le slightly obfuscated code. Tried to stay under 100 lines. Compile with

gcc -l allegro main.c

#include <allegro5/allegro.h>

float FPS = 5;
short t[300];
short gt[300] = { 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,1,1,2,2,1,2,2,
  1,2,1,2,1,1,1,2,2,2,2,2,1,2,2,2,1,2,1,2,1,1,1,2,1,2,2,2,2,2,2,2,1,2,1,2,1,2,
  1,2,1,2,1,2,1,1,2,2,2,2,2,2,1,2,1,2,1,1,1,2,1,2,1,2,1,2,2,2,2,2,2,2,1,1,1,2,
  1,2,1,2,1,2,1,2,1,1,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,1,2,
  1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
  2,2,2,1,2,1,2,1,2,2,2,1,2,2,2,1,1,1,1,1,2,1,2,1,2,1,2,1,2,1,1,1,2,1,2,1,1,1,
  1,1,2,1,2,1,2,1,2,1,2,2,1,1,2,2,1,1,1,1,1,1,2,1,2,1,2,1,2,1,2,1,1,1,2,1,2,1,
  1,1,1,1,2,2,2,1,1,2,1,1,2,2,2,1,2,1,2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
  1,1,1,1};

int main(int argc, char **argv){
  ALLEGRO_DISPLAY *display = NULL;
  ALLEGRO_EVENT_QUEUE *event_queue = NULL;
  ALLEGRO_TIMER *timer = NULL;
  ALLEGRO_BITMAP *b[3];
  t[rand()%300] = 2;
  int redraw = true, dir = 2 | (1 << 3), del = 3, draw = 0;
  al_init();
  al_install_keyboard();
  timer = al_create_timer(1.0 / FPS);
  display = al_create_display(640, 480);
  t[130] = 1, t[131] = 4, t[132] = 7;
  for(int i = 0; i < 3; ++i){
    b[i] = al_create_bitmap(32, 32);
    al_set_target_bitmap(b[i]);
    al_clear_to_color(al_map_rgb(255*(i>0), 255*(i%3 == 2), 255*(i%3 == 1)));
  }
  al_set_target_bitmap(al_get_backbuffer(display));
  event_queue = al_create_event_queue();
  al_register_event_source(event_queue, al_get_display_event_source(display));
  al_register_event_source(event_queue, al_get_keyboard_event_source());
  al_register_event_source(event_queue, al_get_timer_event_source(timer));
  al_clear_to_color(al_map_rgb(0,0,0));
  al_flip_display();
  al_start_timer(timer);
  while(draw != 300) {
    ALLEGRO_EVENT ev;
    al_wait_for_event(event_queue, &ev);
    if(ev.type == ALLEGRO_EVENT_TIMER) {
      if(dir != 9) {
        int pos,npos, max = -32768;
        for(int i = 0; i < 300;++i) {
          if(t[i] % 3 == 1) {
            t[i] -= del;
            if(t[i] > max) {
              max = t[i];
              pos = i;
            }
          }
          t[i] = t[i] < 0 ? 0 : t[i];
        }
        npos = (pos/20+((dir>>3)+14))%15 * 20 + (pos%20+(dir&0x7)+19)%20;
        if(t[npos] % 3 == 1) {
          dir = 1 | (1 << 3);
          al_set_timer_speed(timer, 1.0/50.0);
        } else if(t[npos] % 3 == 2) {
          do pos = rand()%300;
          while(t[pos] % 3 != 0);
          del = (t[pos] = 2) - 2;
          al_set_timer_speed(timer, 1/(FPS += 0.3));
        } else 
          del = 3;
        t[npos] = max + 3;
      } else {
        t[draw] = gt[draw];
        ++draw;
      }
      redraw = true;
    } else if(ev.type == ALLEGRO_EVENT_DISPLAY_CLOSE) {
      break;
    } else if (ev.type == ALLEGRO_EVENT_KEY_DOWN) {
      if (ev.keyboard.keycode == ALLEGRO_KEY_ESCAPE) {
        break;
      } else if(ev.keyboard.keycode == ALLEGRO_KEY_UP && dir != 17 && dir != 9) {
        dir = 1 | (0 << 3);
      } else if(ev.keyboard.keycode == ALLEGRO_KEY_DOWN && dir != 1 && dir != 9) {
        dir = 1 | (2 << 3);
      } else if(ev.keyboard.keycode == ALLEGRO_KEY_LEFT && dir != 10 && dir != 9) {
        dir = 0 | (1 << 3);
      } else if(ev.keyboard.keycode == ALLEGRO_KEY_RIGHT && dir != 8 && dir != 9) {
        dir = 2 | (1 << 3);
      }
    }
    if(redraw && al_is_event_queue_empty(event_queue)) {
      redraw = false;
      al_clear_to_color(al_map_rgb(0,0,0));
      for(int i = 0; i < 300; ++i)
        al_draw_bitmap(b[t[i]%3], (i%20) * 32, (i/20) * 32, 0);
      al_flip_display();
    }
  }
  return 0;
}

roll nigger

>>3529

Rolling

>>3529

roll

>>4646

WELL SHIT

>>4647

>>4646

Is it hard or have you already done it before?

>>3529

faas

Rolling because why not.

Roll.

Here we go

>>3529

roll

rolling

roll

>>3529

roll

roll

>>4124

Let's see the 4chan one

rolie polie olie

gimme a good un

Rolled 53 (1d99)

roll

>>3623

Yeah, that looks pretty damn great. Gonna roll something up for myself too

>>4802

Whew, writing in C gave me a real workout. Hope I can use C++ whatever I do later,

#include <stdio.h>

const float CONV_CONST = 5.0/9.0f;

int main()
{
  float t;
  char input;
  float result;
  
  printf("Celcius or Fahrenheit (c/f)?: ");
  scanf("%c", &input);
  printf("\nType in your temperature: ");
	scanf("%f",&t);
  
  if(tolower(input)=='c') {
    result = t/CONV_CONST + 32.0;
  } else {
    result = (t - 32.0)*CONV_CONST;
  }
  
  printf("\nConverted temperature:  %.2f", result);
	return 0;
}

roll

rollin along

>>4823

already exists

[code]

import sys

import os

import json

import requests

import shutil

import argparse

from blessings import Terminal

from multiprocessing import Value

from multiprocessing.pool import Pool

VERSION = "0.1"

NAME = "Infinity Grabber"

class Infinity:

Main class, does everything

def init(self):

parser = argparse.ArgumentParser()

parser.add_argument("thread", help="URL of thread to scrape")

parser.add_argument("--directory", "-d", help="Specify dir to save to (Default: ~/8chan)")

parser.add_argument("--name", "-n", help="Specify name of dir to download to (Default: Topic/OP Post number)")

parser.add_argument("--workers", type=int, help="Number of threads to run (Default: 10)")

parser.add_argument("--version", "-v", action="version", version=VERSION)

self.args = parser.parse_args()

save_path = self.args.directory or os.path.join(

os.path.expanduser('~'), "8chan")

self.header = {

'User-Agent': 'Mozilla/5.0 (X11; Linux x86_64) AppleWebKit/537.11\

(KHTML, like Gecko) Chrome/23.0.1271.64 Safari/537.11',

'Accept': 'text/html,application/xhtml+xml,\

application/xml;q=0.9,*/*;q=0.8'}

self.thread_url = self.args.thread

self.board = self.thread_url.split('/')[3]

self.thread_name = ""

self.downloads = []

self.save_path = save_path

self.counter = Value('i', 0)

self.total_count = Value('i', 0)

self.workers = self.args.workers

self.down_dir = ""

def url_open(self):

""" Returns raw data from thread """

url = "{0}.json".format(os.path.splitext(self.thread_url)[0])

return requests.get(url, headers=self.header)

def jsonify(self):

""" Converts raw data to text to json object """

jsonable = self.url_open().text

return json.loads(jsonable)

def download_image(self, url, filename):

""" Creates new dir if doesn't exist, downloads image """

down_dir = os.path.join(self.save_path, self.thread_name)

img_dir = os.path.join(down_dir, filename)

if not os.path.exists(down_dir):

os.makedirs(down_dir)

image = requests.get(url, headers=self.header, stream=True)

with open(img_dir, 'wb') as location:

image.raw.decode_content = True

shutil.copyfileobj(image.raw, location)

self.down_dir = down_dir

def image_urls(self):

""" Iterates over json obj, gets image links

Creates pool of workers, creates new workers """

json_obj = self.jsonify()

for post in json_obj['posts']:

if 'ext' in post:

self.total_count.value += 1

try:

self.thread_name = self.args.name

except (KeyError, NameError):

self.thread_name = json_obj['posts'][0]['sub'].replace(' ', "_")

else:

self.thread_name = str(json_obj['posts'][0]['no'])

for post in json_obj['posts']:

if 'ext' in post:

filename = post['tim'] + post['ext']

image_url = 'https://8ch.net/{board}/src/{file}'.format(

board=self.board, file=filename)

self.downloads.append((image_url, filename))

self.download_image(image_url, filename)

with self.counter.get_lock():

self.counter.value += 1

update_progress(self.counter.value, self.total_count.value)

pool = Pool(self.workers)

pool_map = pool.map_async(self.download_image, self.downloads)

try:

pool_map.get(0xFFFF)

except KeyboardInterrupt:

print("Aborting")

pool.terminate()

pool.join()

else:

pool.close()

pool.join()

def main():

""" Creates instance of Infinity """

grabber = Infinity()

args = grabber.args

if len(args.thread) < 1:

sys.exit(1)

grabber = Infinity()

grabber.image_urls()

def update_progress(current, total):

""" Draws bar and updates it """

bar_length = 40

percent_finished = current/float(total)

percent = int(current/total*100)

fillers = int(percent_finished * bar_length)

empty_fillers = bar_length - fillers

progress_bar = "["

progress_bar += fillers * "="

progress_bar += ">"

progress_bar += empty_fillers * " "

progress_bar += "]"

term = Terminal()

with term.location(x=0):

sys.stdout.write("{} {}/{} [{}%]".format(progress_bar, current, total, percent))

sys.stdout.flush()

if name == "main":

main()

[/Code]

>>3529

Let's do this.

>>4827

What the hell is a picross? Not a native speaker, so... Well, gonna post it when I solve it.

Rollopo

k

>>4844

def alp(char):

alphabet={'a':'. -',

'b':'- . . .',

'c':'- . - .',

'd':'- . .',

'e':'.',

'f':'. . - .',

'g':'- - .',

'h':'. . . .',

'i':'. .',

'j':'. - - -',

'k':'- . -',

'l':'. - . .',

'm':'- -',

'n':'- .',

'o':'- - -',

'p':'. - - .',

'r':'. - .',

'q':'- - . -',

's':'. . .',

't':'-',

'u':'. . -',

'v':'. . . -',

'w':'. - -',

'x':'- . . -',

'y':'- . - -',

'z':'- - . .',

' ':' ',

'0':'- - - - -',

'1':'. - - - -',

'2':'. . - - -',

'3':'. . . - -',

'4':'. . . . -',

'5':'. . . . .',

'6':'- . . . .',

'7':'- - . . .',

'8':'- - - . .',

'9':'- - - - .',}

return str(alphabet[char])+" "

def translate(string):

original=string

original_lower = string.lower()

morse=""

for letter in original_lower:

try:

morse+=alp(letter)

except:

morse+=""

return morse+"\n"+original

print(translate("gas the kikes"))

redo

>>3529

boop

>>3530

>You can run function x inside function x

Speaking as a guy who's just started programming, I didn't think that you could do that. Thanks.

>>3529

reply

>>3529

Rolling

>>3529

The majority of those is wayy too much work for me to take seriously

>>3529

git is jewish mindtrick bullshit. version control is for faggots and niggers

>>3529

>>3529

probably something boring

roll'n

roll

Let's see how much I can do with Python without classes.

>>5039

commands.py

def plus(arg1, arg2):

return arg1 + arg2

def minus(arg1, arg2):

return arg1 - arg2

def times(arg1, arg2):

return arg1 * arg2

def div(arg1, arg2):

return arg1 / arg2

def exponential(base, power):

return base ** power

def pi():

return 3.141592654

def euler():

return 2.718281828

def scientific_notation(number): # sig_figs is significant figures

# I just don't wanna write that shit down every single time, okay?

power = 0

if (abs(number) > 10):

while number > 10:

number /= 10

power += 1

elif (abs(number) < 1):

while number < 1:

number *= 10

power -= 1

# s.f. in scientific notation typically includes the base number

# i don't know how you learned it, but I learned it this way. Sorry.

print "%0.6fe%d" % (number, power)

main.py

http://pastebin.com/NBXkp0n6

>>5040

This is buggy as shit, never fucking mind ;-;

>>3529

I roll it.

public class Benis
{

  public static String reverse( String s)
  {
    String ret="";
    for(int i = s.length(); i>0;i--)
    {
      ret += s.charAt(i-1);
    }
    return ret;
  }

  public static void main(String [] args)
  {
    String s = "bujur";
    System.out.println(reverse(s));
  }
}

ROLL

>>4824

Your python code is surprisingly go-like in some ways, you use go anon?

Daily reminder to sage when you roll.

>>3529

Rollin

>>5096

#include <iostream>

using namespace std;

struct vect{
    int x;
    int y;
    int z;
};

int dotProduct(vect a, vect b){
    return a.x*b.x + a.y*b.y + a.z*b.z;
}

vect crossProduct(vect a, vect b){
    vect c;
    c.z = a.x*b.y;
    c.y = a.z*b.x;
    c.x = a.y*b.z;
    return c;
}

vect accept(){

    int a,b,c;
    cin>>a;
    cin.get();//to ignore i+
    cin.get();
    cin>>b;
    cin.get();//to ignore j+
    cin.get();
    cin>>c;
    cin.get();//to ignore k

    vect ans;
    ans.x=a;
    ans.y=b;
    ans.z=c;

    return ans;
}

void displayVect(vect a){
    cout<<a.x<<"i+"<<a.y<<"j+"<<a.z<<"k"<<endl;
}

int main()
{
    vect first,second;
    cout<<"Insert vector in ai+bj+ck format"<<endl;

    cout<<"First Vector :";
    first=accept();

    cout<<"Second Vector :";
    second=accept();

    cout<<"Dot Product : ";
    cout<<dotProduct(first,second);

    cout<<"Cross Product : ";
    vect cross=crossProduct(first,second);
    displayVect(cross);
    return 0;
}

Done.

Only works for positive values though.

Will improve.

>>5097

easy fix, just remove the extra cin.get() from the accept() function besides the //to ignore i+ comments

apologies for samefagging

The algo can be expounded to multi dimensions but I only used three.

Also rerolling

>>3529

090017090C0C00011414050D1014001408091300090E000300100C151300100C1513

roll

Rollerino

>>3529

Rollcage.

>>3529

roll

rolling

roll

rolleroni

>>5190

http://pastebin.com/XQphteT6

>>5192

Hi, I'm a bit new here so bear witrh me.

Does anyone know of a PGP solution that DOESN'T leave the unencrypted file? It's a pain. I can obviously erase the files but knowing they're u.nreadable if recovered would be peace of mind for me.

The way I see it my options are:

Encrypt the original file with truecrypt and then erase.

Or run everything in an encrypted volum on a VM - but are there any with a PGP standard? Most are things like trucrypt and I hear that has flaws.

What build would you suggest? What specific software? The goal is to leave no trace of the unencrypted file.

rollin

roll

>>5203

rerolling again

>>5204

using Vigenère cipher

letter = 'abcdefghijklmnopqrstuvwxyz '
def encrypt(key,string):
    encrypt_string = []
    string = string.lower()
    key = key.lower()
    for n in range(0,len(string)):
        ind =(letter.index(key[n]) + letter.index(string[n]))%26
        print ind
        encrypt_string.append(letter[ind])

    print encrypt_string

def decrypt(key,string):
    decrypt_string = []
    string = string.lower()
    key = key.lower()
    for n in range(0,len(string)):
        ind =(letter.index(string[n]) - letter.index(key[n]))%26
        decrypt_string.append(letter[ind])
    print decrypt_string

rohl

>>3529

rawl

Guess I'll give it a roll. Trying to learn D cause I'm a dumb hipster yuppie.

fred durst

>>3529

>difficulty ranges from easy as fuck to /just/ fuck my shit up

Maybe it would make sense to make perhaps 3 different images, for beginners, intermediate, and pros.

Benford's law (aka boring gay shit)

#! python3

numberfilepath = "numbers.txt"
numberfile = open(numberfilepath, "r")
numberfiletext = str(numberfile.read()).split()
numberfile.close()

numbercount = {}

for x in range(1,10):
	numbercount.update({x:0})

for x in range(0, len(numberfiletext)):
	firstdigit = int(str(numberfiletext[x])[0])
	numbercount[firstdigit] += 1

finallist = sorted(numbercount, key=lambda x: numbercount[x], reverse=True)

print("Descending list")
for x in finallist:
	numberofhits = numbercount[x]
	averagenumber = numbercount[x]/len(numberfiletext)
	print("%s: count=%s, average=%s" % (x, numberofhits, averagenumber))

rollin'

rolling #gay

import unittest
from dijkstras import Graph

class Graph_Test(unittest.TestCase):
    
    #Runs before each test
    def setUp(self):
        self.graph = Graph()
    
    def test_add_vertex(self):
        self.graph.add_vertex('A', {'B': 7, 'C': 8})
        self.assertEqual(self.graph.vertices, {'A': {'C': 8, 'B': 7}})
        
    def test_shortest_path(self, ):
        self.graph.add_vertex('A', {'B': 7, 'C': 8})
        self.graph.add_vertex('B', {'A': 7, 'F': 2})
        self.graph.add_vertex('C', {'A': 8, 'F': 6, 'G': 4})
        self.graph.add_vertex('D', {'F': 8})
        self.graph.add_vertex('E', {'H': 1})
        self.graph.add_vertex('F', {'B': 2, 'C': 6, 'D': 8, 'G': 9, 'H': 3})
        self.graph.add_vertex('G', {'C': 4, 'F': 9})
        self.graph.add_vertex('H', {'E': 1, 'F': 3})
        
        self.assertEqual(self.graph.shortest_path('A', 'H'), ['H', 'F', 'B'])
        self.assertEqual(self.graph.shortest_path('H', 'I'), {'A': 12, 'B': 5, 'C': 9, 'D': 11, 'E': 1, 'F': 3, 'G': 12, 'H': 0})

unittest.main()

>>3529

rooasdf

reply

>>5365

reroll the ulam spiral is gay

Roll.

rollarino

Rolling. Currently 4chan, 8ch and gelbooru downloaders

https://github.com/wewman

>>5404

I really didn't want to do encryption since that looks so boring, so I did fizzbuzz instead.

/* Fizz Buzz program
    The terminal will print seven numbers at a time every time the user presses a key.
    Any number divisible by 3 will be replaced with the string "Fizz", and any number
    divisible by 5 will be replaced with the string "Buzz".
    The user can terminate the program by typing 'x'.

    Demonstrates basic bitch programming capacity.
    Developed by anon, 11 7 2017.
*/

#include <iostream>

int main()
{
    int n {0}; // This is the number the program will increment for printing.

    std::cout << "FizzBuzz program.\n\n";
    std::cout << "The integers will be printed until the user submits 'x'.\n";
    std::cout << "Every number divisible by 3 will print \"Fizz\" instead.\n";
    std::cout << "Every number divisible by 5 will print \"Buzz\" instead.\n\n";
    std::cout << "Every number divisible by both 3 and 5 will print \"FizzBuzz\".\n\n";
    std::cout << "Press any key to begin. Except x, which terminates the program.\n";
    
    for(char c; std::cin>>c; ) //while the user gives input
    {
        if(c =='x') break; //excape on x
        
        for(int i=0; i!=10; ++i)
        {
            ++n;
            bool fb {false}; //fizzbuzz detector
            
            if(n%3 == 0) {
				std::cout << "Fizz";
                fb = true;
            }
            if(n%5 == 0) {
				std::cout << "Buzz";
                fb = true;
            }
			if (!fb) std::cout << n;
			std::cout << ", ";
        }
        
        std::cout << std::endl;
    }
    
    std::cout << "bye nigga\n";
    return 0;
}

>>3529

roll

>>5416

fuck it, to tired, doing this tomorrow

ok

rawlz. will be back in couple hours most likely

>>5429

holy shizz ive had enough alcohol to choke a mouse

(define factorial
  (lambda(n)
    (if (= n 0)
      1
      (* n (factorial (- n 1))))))

>>5407

i doz it four youz with ez encypztions

def CaesarCypher(message,key,mode):
        if (gcd(key,26)!=1):
                print()
                return
        message=message.upper()
        alphabet = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
        translated=''
        for each in message:
                if each in alphabet:
                        out = alphabet.find(each)
                        if mode == 'encrypt':
                                out = (out+key)%26
                        elif mode == 'decrypt':
                                out = (out-key)%26
                        else:
                                print("invalid mode. exiting.")
                                return
                        translated+=alphabet[out]       
                else:
                        translated+=each
        print(translated)

an nowz i stepz it up jusz a lil bit (iz crypto cuz toullz you what isz english

def isEnglish(message, wordPercentage=20, letterPercentage=85):
	#these next two functions are only needed for isEnglish, so I encapsulated them within their parent function to limit their scope
	def parseEnglish(message):
		alphabet = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
		lettersOnly = []
		for each in message:
			if each in (alphabet + alphabet.lower() + ' \t\n'):
				lettersOnly.append(each)
		return ''.join(lettersOnly)
	def countEnglish(message):
		#loads the dictionary file
		def loadDict():
			File = open('/usr/share/dict/linux.words')
			words = {}
			for each in File.read().split('\n'):
				words[each] = None
			File.close()
			return words
		message = parseEnglish(message)
		possibleEnglish = message.split()
		if possibleEnglish == []:
			return 0.0 
		matches = 0
		for word in possibleEnglish:
			if word in loadDict():
				matches += 1
		return float(matches) / len(possibleEnglish)
	#below is body of parent isEnglish() function...
	matched = countEnglish(message) * 100 >= wordPercentage
	numLetters = len(parseEnglish(message))
	percentage = float(numLetters) / len(message) * 100
	letters = percentage >= letterPercentage
	return matched and letters

now iz do what isz ez in python

def generateRSAKey(keySize):
	print("generating two Mersenne primes...")
	p1 = generateMersennePrime(keySize)
	p2 = generateMersennePrime(keySize)
	print("generating n=prime1*prime2")
	n = p1 * p2
	print("determining a number coprime to n..")
	e = randrange(2 ** (keySize - 1), 2 ** (keySize))
	while gcd(e, (p1 - 1) * (p2 - 1)) != 1:
		e = randrange(2 ** (keySize - 1), 2 ** (keySize))
	print("generating modular inverse of number coprime to n...")
	d = ModInverse(e, (p1 - 1) * (p2 - 1))

	publicKey = (n, e)
	privateKey = (n, d)

	print('Public key:', publicKey)
	print('Private key:', privateKey)
	return (publicKey, privateKey)
def generateMersennePrime(keysize=1024):
    # Return a random prime number of keysize bits in size.
    while True:
        num = randrange(2**(keysize-1), 2**(keysize))
        if isPrime(num):
            return num
def isPrime(num):
    def rabinMillerPrimalityTest(num):
        s = num - 1
        t = 0
        while s % 2 == 0:
            s = s // 2
            t += 1
        for trials in range(5):
            a = randrange(2, num - 1)
            v = pow(a, s, num)
            if v != 1:
                i = 0
                while v != (num - 1):
                    if i == t - 1:
                        return False
                    else:
                        i = i + 1
                        v = (v ** 2) % num
        return True
    if (num < 2):
        return False
    lowPrimes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997]
    if num in lowPrimes:
        return True
    for prime in lowPrimes:
        if (num % prime == 0):
            return False
    return rabinMillerPrimalityTest(num)

>>5431

isz forgotz gcd funztions withch is curzial to crypti mats

def gcd(a, b):
	while a != 0:
		a, b = b % a, a
	return b

ifz anyonez has cruptocuurenzies for beerz i m aczepting paiments naow

>>5407

isz weakz and feabilminded only stronk can incript cripto

>>5407

>>5407

Litaraeeze ginerick fiszbusz

>>3529

rolling

>>5664

Well that's boring, rolling again.

Roll

>>5686

What is an incremental economy. Do I spawn the factors of production and let the system simulate a market.

>>3529

>tfw I'm too inexperienced and helpless to be able to do any of these things

FML I need to get better.

r

>>3529

Roll

rowling

roll

>>3529

roll

Rolling...

>>3529

fuckin roll

>>3529

Roll

>>3530

how do you get the box?

#include <iostream>

using namespace std

int main()

{

cout << "test" << endl;

return 0;

}

rolling boys

Rolled 13 (1d100)

Rollan

>>3529

I'm not at this level. Is there a beginners version?

roll

rolling

>>5975

w='w=%r;print w%%w';print w%w

Rollerino

roll

>>3529

r0ll

roll it up

roll

Rolling

Rolled 466, 302, 118, 471, 477, 312, 893, 384, 654, 603, 432, 10, 297, 120, 72, 926, 37, 322, 313, 493, 133, 263, 333, 839, 296, 65, 179, 393, 142, 1020, 151, 607, 298, 269, 54, 774, 580, 947, 133, 209, 525, 565, 219, 821, 684, 290, 723, 721, 611, 11, 189, 744, 274, 522, 559, 569, 587, 737, 962, 729, 732, 88, 312, 5, 356, 365, 778, 935, 288, 911, 120, 812, 452, 338, 609, 111, 627, 307, 832, 214, 318, 1021, 957, 591, 518, 491, 136, 80, 204, 73, 809, 935, 161, 96, 939, 517, 461, 693, 428, 748, 580, 547, 535, 7, 884, 120, 117, 487, 427, 949, 700, 744, 945, 633, 311, 438, 99, 447, 518, 302, 519, 302, 213, 679, 398, 127, 171, 858, 820, 598, 581, 375, 121, 92, 381, 1004, 211, 498, 467, 638, 422, 142, 357, 342, 775, 668, 780, 873, 90, 273, 151, 609, 575, 363, 264, 972, 490, 434, 805, 286, 8, 362, 660, 128, 453, 17, 108, 664, 514, 574, 278, 936, 716, 635, 253, 467, 278, 8, 316, 368, 281, 466, 976, 856, 829, 215, 803, 295, 649, 584, 581, 657, 946, 216, 785, 375, 233, 892, 15, 746 = 93454 (200d1024)

ok

rollll

rollerino

rolling

rolling

Roll.

roll

Rolling

roll

>>3529

Roll

GOGO LETS CODE

>>3529

rollo

Rolling

Rolling

ROLLING

rol

rolololol

rolling

>>3529

Oh boy here we go.

roll

>>3529

Reverse a string pls

>>3529

Somebody write a program which randomly generates a possible title for a porn video.

roll

rolling

>>7228

I'm a fucking genius.

import sys

def fib(n):
    if n == 1:
        return 1
    if n == 2:
        return 2
    return fib(n - 1) + fib(n - 2)

print(fib(int(sys.argv[1])))

Rolling

>>3529

r-roll

>>7229

This is a joke, right?

roll

>>3529

woot woot

>>3529

Post the newest version nigger. Also rolling for easy shit.

uuagh roll

>>7270

oh shit, it's cellino and barnes, representing buffalo new york for the last 79 years

>>3529

roll

>>7489

fuck

roll

>>7491

fuck that

re-roll

>>3529

roll

roll

>>3529

rolling

>>3529

I love you OP

I don't do line numbers because who cares

'HighLow

[start]
i = INT(21*RND(1))
guess = i
cls

[input]
input "Enter your guess from 1 to 20. Type 0 to display the answer: ";answer

if answer = 0 then [print] else [first]

[first]
if answer = guess then [correct] else [check]

[check]
if answer > guess then
    Print "Too high, try again: "
        goto [input]
end if

if answer < guess then
    Print "Too low, try again: "
        goto [input]
end if

[correct]
Print "Nice job!"
goto [prompt]

[prompt]
input "Play again? [y/n] ";playagain$
if playagain$ = "y" then [start] else [exit]


[print]
print i
goto [prompt]

[exit]
print "Goodbye"

roll

I'm functionally retarded and struggling to pull together a functioning excel-based ledger system using VBA

lets try this

roll

roll

>>3529

Roll roll roll roll

roll

Rolled 19 (1d100)

Rollin'

roll

>>3529

Let this be a good roll, I haven't programmed anything in a month and a half, I have no inspiration or motivation whatsoever...

>>8072

Uh huh, that's kind of easy, but to make it little more challaging, I'll reinvent the wheel...

roll

>>3529

without deadline i'm not going to make it anyway

>>3529

I might regret this, but rolling.

>>8135

[code]

#include <iostream>

#include <cmath>

using namespace std;

//Benfords Law

int main()

{

int digit;

double answer;

cin >> digit;

if (digit < 10 && digit > 0)

{

answer = log10(digit + 1) - log10(digit);

answer = answer * 100;

cout << answer;

}

else cout << "fuk off ya cheeky cunt";

}

[code/]

Rollypolly

>>3529

roll

roll

Rolled 85 - 1 (1d100)

aaa

>>8266

>fucking klingon translator

i was thinking about just sending input off to google translate and spitting out its output, but then i saw no "klingon" option anymore ;_;

i'm not about to spend time compiling a klingon dictionary just to create a map function. reroll

roll

Rolled 15 (1d99)

>>8283

Alright time to do some fuckin battleships in SFML. Rolling for next project as well.

Rolling

>>3529

rolling rolling rolling. Lets go c++

>>8298

this is what i got

#include <iostream>
#include <string>

int factorial(unsigned long number){ //yay recursion

    if(!number)
        return 1;
    else
        return number * factorial(number-1);
}

int main(int argc, char* argv[])
{
    unsigned long factor;

    std::cin >> factor;

    if(factor < 0){
        std::cout << "factor was smaller than 0 s" << factor << std::endl;
        exit(2);
    }

    if(factor > 4294967294){
        std::cout << "input over flow " << factor << std::endl;
        exit(3);
    }

    std::cout << factorial(factor) << std::endl;

    return 0;
}#include <iostream>
#include <string>

int factorial(unsigned long number){ //yay recursion

    if(!number)
        return 1;
    else
        return number * factorial(number-1);
}

int main(int argc, char* argv[])
{
    unsigned long factor;

    std::cin >> factor;

    if(factor < 0){
        std::cout << "factor was smaller than 0 s" << factor << std::endl;
        exit(2);
    }

    if(factor > 4294967294){
        std::cout << "input over flow " << factor << std::endl;
        exit(3);
    }

    std::cout << factorial(factor) << std::endl;

    return 0;
} //this took longer than needed to make cause i facking wanted command line input but i dropped it in the end

>>8299

fuck i double copied this shit. well ROLLL

>>3529

ROLL

ROLL

rolllllll

rollin

Python is so useful

[

import random

subjects = {1:"Cats", 2:"Niggers", 3:"Chinks", 4:"Crackers", 5:"I"}

verbs = {1:" eat", 2:" hit", 3:" shot", 4:" raped", 5:" stabbed"}

second_noun = {1:" bongs.", 2:" pipes.", 3:" pussy.", 4:" that vidya."}

print(subjects[random.choice(list(subjects.keys()))] + verbs[random.choice(list(verbs.keys()))] + second_noun[random.choice(list(second_noun.keys()))])

]

roll forrest roll

rollin

>>3529

Rollin

Show me what you got

roll

Roll.

rollannn

>>8422

boring.

rolling again.