basp1

// https://contest.yandex.ru/hiring/contest/5048/problems/D/

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace yandex.blitz
{

basp1

// https://contest.yandex.ru/hiring/contest/5048/problems/C/

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace yandex.blitz
{

basp1

// https://contest.yandex.ru/hiring/contest/5048/problems/A/

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace yandex.blitz
{

basp1

using System;
using System.Collections.Generic;
using System.Diagnostics;

namespace Matlib
{
    public class Intlist
    {
        readonly static int NIL = -1;
        readonly static int EMPTY = -2;

basp1

using System;
using System.Collections.Generic;
using System.Linq;
using System.Diagnostics;

namespace Matlib
{
    public class SparseMatrix<T>
    {
        public enum SparseMatrixType

basp1

#pragma once

#include <exception>

#define DEBUG_STRINGIFY(x) #x
#define DEBUG_TO_STRING(x) DEBUG_STRINGIFY(x)
#define DEBUG_LOCATION "file: " __FILE__ ". line: " DEBUG_TO_STRING(__LINE__)

#define THROW_EXCEPTION(MESSAGE) throw std::exception(MESSAGE)

basp1

using System;
using System.Collections.Generic;

namespace CircuitSelector
{
    public static class Graph
    {
       // use LinkedHashSet from http://stackoverflow.com/a/31419199/1312837 with some additions
       public static List<List<int>> FindAllPaths(AdjacentMatrix adj, int begin, int end)
        {

basp1

import java.nio.ByteBuffer

object LEB128 {
  def write(buffer: ByteBuffer, offset: Int, longValue: Long): Int = {
    var writtenBytes: Int = 0
    var value = longValue

    if (value.abs <= 63) {
      if (value < 0) {
        value = value.abs

basp1

(defun last-set-bit (value)
  (if (zerop value)
      -1
      (let ((shifted-value (ash value -32)))
	(if (not (zerop shifted-value))
	    (+ 32 (last-set-bit shifted-value))
	    (flet ((stepf (x b)
		     (if (>= value (ash 1 x))
			 (progn
			   (setf value (ash value (- x)))

basp1

(defpackage :cas-stack
  (:use :common-lisp)
  (:export
   :make-stack
   :stack-push
   :stack-pop))

(in-package :cas-stack)

;; https://github.com/zerth/cl-cas-queue/blob/master/cas-queue.lisp