Tyom ArtyomLazyan

## multithread.cpp
QList<QVector<int> > resultContainter;

QVector<int> Calculate(int begin, int end)
{
	QVector<int> localResult(30);
	for (int i = begin; i < end; ++i)
	{
		localResult[aData[i]]++;
	}
	return localResult;

## spiralPrint.cpp
#include <iostream>
const int N = 5;

int count = 1;

void spiralPrint(int end_row, int end_col, int arr[N][N])
{
    int start_row = 0, start_col = 0;

    while (start_row < end_row && start_col < end_col)

## POLYmorphysm.cpp
/* STATIC POLYmorphysm */
#include <iostream>

template<typename T>
class Base
{
public:
    void printName()
    {
        static_cast<T*>(this)->printName();

## binarTree.cpp
#include <iostream>
#include <vector>

class BinaryList
{
    struct tree_node
    {
        int value;
        tree_node *left;
        tree_node *right;

## fib&fact.cpp
#include <iostream>

/* Factorial template implementation */
template <size_t N> struct fact;

template <> struct fact<0>
{
    const static size_t value = 1;
};

## stack.cpp
#include <iostream>
#include <exception>

template <typename T>
class Stack
{
public:

    Stack() : m_top(NULL), m_size(0) {}

## Calculator.cpp
#include <iostream>

void checkWrongExpression()
{
        char ch = std::cin.get();

        if (ch == '\n')
        {
            std::cin.putback(ch);
            return;

## index.html
<!DOCTYPE html>
<html>
  <head>
    <meta charset="utf-8">
    <title>FaceBook LogIn</title>
    <link rel="stylesheet" href="https://bootswatch.com/flatly/bootstrap.min.css">
    <style media="screen">
      #fb-btn {
        margin-top: 20px;
      }

## MatricFactory.cpp
#include <iostream>
#include <cstring>

class MatricFactory
{
public:
    int** createArray(int row, int col, int initial = 0)
    {
        int **arr = new int* [row];
        for (int i = 0; i < row; i++)

## cookie.php
<?php

class CookieManager {

    public function __construct() {
        //empty one
    }

    static public function store($key, $value, $expire = false, $path = '/', $domain = 'current', $secure = 0) {
        if ($domain == 'current') {
	QList<QVector<int> > resultContainter;

	QVector<int> Calculate(int begin, int end)
	{
	QVector<int> localResult(30);
	for (int i = begin; i < end; ++i)
	{
	localResult[aData[i]]++;
	}
	return localResult;
	#include <iostream>
	const int N = 5;

	int count = 1;

	void spiralPrint(int end_row, int end_col, int arr[N][N])
	{
	int start_row = 0, start_col = 0;

	while (start_row < end_row && start_col < end_col)
	/* STATIC POLYmorphysm */
	#include <iostream>

	template<typename T>
	class Base
	{
	public:
	void printName()
	{
	static_cast<T*>(this)->printName();
	#include <iostream>
	#include <vector>

	class BinaryList
	{
	struct tree_node
	{
	int value;
	tree_node *left;
	tree_node *right;
	#include <iostream>

	/* Factorial template implementation */
	template <size_t N> struct fact;

	template <> struct fact<0>
	{
	const static size_t value = 1;
	};
	#include <iostream>
	#include <exception>

	template <typename T>
	class Stack
	{
	public:

	Stack() : m_top(NULL), m_size(0) {}
	#include <iostream>

	void checkWrongExpression()
	{
	char ch = std::cin.get();

	if (ch == '\n')
	{
	std::cin.putback(ch);
	return;
	<!DOCTYPE html>
	<html>
	<head>
	<meta charset="utf-8">
	<title>FaceBook LogIn</title>
	<link rel="stylesheet" href="https://bootswatch.com/flatly/bootstrap.min.css">
	<style media="screen">
	#fb-btn {
	margin-top: 20px;
	}
	#include <iostream>
	#include <cstring>

	class MatricFactory
	{
	public:
	int** createArray(int row, int col, int initial = 0)
	{
	int *arr = new int [row];
	for (int i = 0; i < row; i++)