Vardan VardanGrigoryan

## Median problem
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <algorithm>

int get_median(int* a, int s)
{
	if(s % 2 == 0)
	{
		return (a[s/2] + a[s/2 - 1]) / 2;

## gist:7958104

#include <iostream>
#include <queue>
#include <stdlib.h>

struct node
{
	struct node* left;
	struct node* rigth;
	int data;

## Is path exist
#include <iostream>
#include <queue>
#include <stdlib.h>

struct node
{
	struct node* left;
	struct node* rigth;
	int data;
};

## lca

#include <iostream>
#include <queue>
#include <stdlib.h>

struct node
{
	struct node* left;
	struct node* rigth;
	struct node* parent;

## bst average
#include <iostream>
#include <stdlib.h>

struct node
{
	struct node* left;
	struct node* right;
	int data;
};

## ascii_to_bin
#include <iostream>

int main()
{
    int a[8];
    const char c = 'a';

    for(unsigned int i = 0; i < sizeof(char)*8; ++i)
    {
        if(c & (1 << i))

## heap
#include <iostream>

class heap
{
	private:
		int size;

	private:
		int get_left(int i);
		int get_rigth(int i);

## main.cpp

#include <iostream>
#include <limits.h>
#include <stdlib.h>
#include <queue>

struct node
{
	int d;
	int w;

## gist:8899883

#include <vector>

double vagner_fisher_sed_algo(const std::string& s,
		const std::string& d)
{
	std::vector<std::vector<double> > t(s.length() + 1,
			std::vector<double>(d.length() + 1));
	t[0][0] = 0;
	double o;

## gist:9450697
void backtrack(int* a, int k, int n)
{
	if (k == n)
	{
		for(int i = 1; i <=k; ++i)
		{
			if (a[i] == true)
			{
				std::cout << i << " ";
			}
	#include <stdio.h>
	#include <stdlib.h>
	#include <iostream>
	#include <algorithm>

	int get_median(int* a, int s)
	{
	if(s % 2 == 0)
	{
	return (a[s/2] + a[s/2 - 1]) / 2;

	#include <iostream>
	#include <queue>
	#include <stdlib.h>

	struct node
	{
	struct node* left;
	struct node* rigth;
	int data;
	#include <iostream>

	int main()
	{
	int a[8];
	const char c = 'a';

	for(unsigned int i = 0; i < sizeof(char)*8; ++i)
	{
	if(c & (1 << i))
	#include <iostream>

	class heap
	{
	private:
	int size;

	private:
	int get_left(int i);
	int get_rigth(int i);

	#include <iostream>
	#include <limits.h>
	#include <stdlib.h>
	#include <queue>

	struct node
	{
	int d;
	int w;

	#include <vector>

	double vagner_fisher_sed_algo(const std::string& s,
	const std::string& d)
	{
	std::vector<std::vector<double> > t(s.length() + 1,
	std::vector<double>(d.length() + 1));
	t[0][0] = 0;
	double o;
	void backtrack(int* a, int k, int n)
	{
	if (k == n)
	{
	for(int i = 1; i <=k; ++i)
	{
	if (a[i] == true)
	{
	std::cout << i << " ";
	}