# 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):
View gist:9b6705eecd1fcb20b97506a6ddb7bb6e
# Persist message in a queue
lpush channel1.queue message
# Publish message to any connected subscriber
publish channel1 message
# Subscribe to channel1
subscribe channel1
View gist:54becc25abe46ba98c4c7062e81e2845
package main
import (
func main() {
mapD := map[string]interface{}{"deploy_status": "public", "status": "live", "version": 2}
mapB, _ := json.Marshal(mapD)
View compress.go
import (
func zipit(source, target string) error {
zipfile, err := os.Create(target)
View round.go
package main
import (
func Round(val float64, roundOn float64, places int ) (newVal float64) {
var round float64
pow := math.Pow(10, float64(places))
View gist:b21c02139314cf773c8c3f2cbc3e6aab
class A
attr_accessor :a
def initialize
@a = 100
def aa
a = 1000
View gist:376c99858c0106b6ebc9dad06c9043a5
for(i=0; i<f.length; i++) {fs.renameSync(f[i], f[i].replace(/ |\'/g, "-"))}
View problem
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.
View problem
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:
Given a time, , find and print the value displayed by the counter at time .
Input Format
View problem
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