kodyzrodlowe

import java.util.Random;
import java.util.Scanner;


//klasa przechowująca i sortująca wydzielone potablice pięcio-elementowe
class Sort_Median {

    public int[] array;                         //tablica elementów
    private int nElems;
    private int size;                           //liczba elementów tablicy

kodyzrodlowe

import java.util.*;
import java.util.Scanner;
import java.io.*;

class PakowaniePlecaka {
    public int[] tab;
    public int dlugosc;
    public int poj;
    
    public PakowaniePlecaka(int ilosc,int pojemnosc) {

kodyzrodlowe

#include <iostream>
#include <fstream>
#include <sys/resource.h>
#include <cstring>
#include <gsl/gsl_linalg.h>
#include <gsl/gsl_blas.h>
#include <cmath>

using namespace std;

kodyzrodlowe

(function () {
  'use strict';

  angular.module('app.services')
    .provider('Ping', Ping);

  /**
   * Ping indicated endpoint on specified time interval
   * @constructor
   */

kodyzrodlowe

(function () {
  'use strict';

  angular.module('app.frontend.directives')
    .directive('simplePagination', SimplePagination);

  SimplePagination.$inject = ['$location'];
  /**
   * Directive renders pagination
   * @require https://github.com/a8m/angular-filter

kodyzrodlowe

(function () {
  'use strict';

  angular.module('app.common.services')
    .factory('EventDispatcher', EventDispatcherFactory);

  EventDispatcherFactory.$inject = [];

  /**
   *

kodyzrodlowe

from pyevolve import G1DList, GSimpleGA
from pyevolve import Initializators, Mutators, Consts
from pyevolve import DBAdapters
import math

# Implementacja funkcji Rastrigina
def rastrigin(xlist):
   n = len(xlist)
   total = 0
   for i in range(n):

kodyzrodlowe

#python3
import fileinput
import sys
import urllib.request
import re
import os

class Dict:
    ##
    # Konstruktor

kodyzrodlowe

#python3
import fileinput
import sys
import urllib.request
import re
from xml.dom.minidom import parse, parseString
from urllib.parse import unquote
from urllib.parse import urlencode

class WikiBot:

kodyzrodlowe

package binsearchtree;

import java.util.Scanner;

class Node {
    public int info;
    public Node left;
    public Node right;

    public Node() {