vireshas

# coding=UTF-8
from __future__ import division
import re

# This is a naive text summarization algorithm
# Created by Shlomi Babluki
# April, 2013


class SummaryTool(object):

vireshas

Publisher:

# Persist message in a queue
lpush channel1.queue message
# Publish message to any connected subscriber
publish channel1 message
Subscriber:

# Subscribe to channel1
subscribe channel1

vireshas

package main

import (
	"encoding/json"
	"fmt"
)

func main() {
	mapD := map[string]interface{}{"deploy_status": "public", "status": "live", "version": 2}
	mapB, _ := json.Marshal(mapD)

vireshas

import (
	"archive/zip"
	"io"
	"os"
	"path/filepath"
	"strings"
)

func zipit(source, target string) error {
	zipfile, err := os.Create(target)

vireshas

package main

import (
	"log"
	"math"
)

func Round(val float64, roundOn float64, places int ) (newVal float64) {
	var round float64
	pow := math.Pow(10, float64(places))

vireshas

class A

  attr_accessor :a

  def initialize
    @a = 100
  end

  def aa
    a = 1000

vireshas

f=fs.readdirSync(".")
for(i=0; i<f.length; i++) {fs.renameSync(f[i], f[i].replace(/ |\'/g, "-"))}

vireshas

We define  to be a permutation of the first  natural numbers in the range . Let  denote the position of  in permutation  (please use -based indexing).

 is considered to be an absolute permutation if  holds true for every .

Given  and , print the lexicographically smallest absolute permutation, ; if no absolute permutation exists, print -1.

Input Format

The first line of input contains a single integer, , denoting the number of test cases. 
Each of the  subsequent lines contains  space-separated integers describing the respective  and  values for a test case.

vireshas

Bob has a strange counter. At the first second, , it displays the number . At each subsequent second, the number displayed by the counter decrements by .

The counter counts down in cycles. In the second after the counter counts down to , the number becomes  the initial number for that countdown cycle and then continues counting down from the new initial number in a new cycle. The diagram below shows the counter values for each time  in the first three cycles:

https://s3.amazonaws.com/hr-challenge-images/22185/1469447349-bae87a5071-strange1.png

Given a time, , find and print the value displayed by the counter at time .

Input Format

vireshas

You are the benevolent ruler of Rankhacker Castle, and today you're distributing bread to a straight line of subjects. Each  subject (where ) already has  loaves of bread.

Times are hard and your castle's food stocks are dwindling, so you must distribute as few loaves as possible according to the following rules:

Every time you give a loaf of bread to some person , you must also give a loaf of bread to the person immediately in front of or behind them in the line (i.e., persons  or ).
After all the bread is distributed, each person must have an even number of loaves.
Given the number of loaves already held by each citizen, find and print the minimum number of loaves you must distribute to satisfy the two rules above. If this is not possible, print NO.

Input Format