pstachula-dev

#include <iostream>
#include <time.h>
// Lista cykliczna

using namespace std;

struct list_el
{
    int key;
    list_el *next;

pstachula-dev

#include <iostream>
#include <time.h>

using namespace std;

struct list_el
{
    int key;
    list_el *next;
    list_el *prev;

pstachula-dev

#include <iostream>
#include <time.h>
using namespace std;

struct list_el
{
    int key;
    list_el *next;
};

pstachula-dev

#include<iostream>
#include <time.h>
using namespace std;
struct tree{
    int key;
    tree *left, *right;
};
tree *root;
 
class Binary_tree{

pstachula-dev

#include<iostream>
#include<time.h>
#include<math.h>
using namespace std;
struct tree{
    int key;
    int vist_c;
    tree *left, *right;
};
tree *root;

pstachula-dev

#include<iostream>
#include<time.h>
#include<math.h>
using namespace std;
struct tree{
    int key;
    tree *left, *right;
};
tree *root;
 

pstachula-dev

#include<iostream>
#include<time.h>
#include<vector>

using namespace std;

int n;

struct drzewo{
	int key,balance;

pstachula-dev

#include<iostream>
#include<time.h>
using namespace std;
struct avl_node
{
    avl_node *left, *right, *p;
    int key, bf;
};
 
class AVL

pstachula-dev

#!/usr/bin/ruby
require 'timeout'

class Sandbox
  def initialize(tar, time)
    @tar = tar
    @time = time
    @path = get_main_folder_name

    @app_map = {

pstachula-dev

require 'Benchmark'

class Sudoku
  attr_accessor :puzzle

  def initialize  
    @puzzle = ''
    @game = Array.new(9)
    @game.map! { Array.new(9) }
    9.times do |i|