antsmartian antsmartian

## #King_Of_Kings.groovy
//map for managing the conversion from roman to no's
def map =[I:1,II:2,III:3,IV:4,V:5,VI:6,VII:7,VIII:8,IX:9,X:10,XI:11]
//map for managing the conversion from no to romans
def map1 = ['1':"I",'2':"II",'3':"III",'4':"IV",'5':"V",'6':"VI",'7':"VII",'8':"VIII",'9':"IX",'10':"X",'11':"XI"]
//temp variables
ans = []
res = []
//final result
res1 = []
//for managing the flow of algorithm

## #bubbleSort.groovy
//change this array and play with Bubble Sort!
a = [1,43,5,67,8,912,3,465,89,89,82,34]
println a.size()
for(out in (a.size()-2)..2)
{
        0.upto(out) { index ->
                if(a[index] > a[index+1])
                        swap(index,index+1)
        }
}

## #selectionSort.groovy
//change this array and play with selection sort :)
a = [2,34,4,123,45,56,3,56,67,87,21,45,56,67,22,4234,4234,2342,1,34,546,67,677,343,4,41,32,456,1341,13,454,234,453,565,5,524,234,234,5456,567,673,245,567,78,78,324,56576,782,435,676,873,2,345,6767,7,3463,3,6767673,34534,2,345,656,3,5652,1,34345,3453545,35345356,66,7883345,676787,8988]
b = a
long startTime = System.currentTimeMillis();
(0..(a.size()-2)).each {
		 minimumValue = it
		(it+1).upto(a.size()-1){ insideElement ->
			if(a[insideElement] < a[minimumValue])
				minimumValue = insideElement
		}

## #insertionSort.groovy
a = [2,34,4,123,45,56,3,56,67,87,21,45,56,67,22,4234,4234,2342,1,34,546,67,677,343,4,41,32,456,1341,13,454,234,453,565,5,524,234,234,5456,567,673,245,567,78,78,324,56576,782,435,676,873,2,345,6767,7,3463,3,6767673,34534,2,345,656,3,5652,1,34345,3453545,35345356,66,7883345,676787,8988]
b = a
long startTime = System.currentTimeMillis();
(1..(a.size()-2)).each { out ->
			def temp = a.getAt(out)
			def index = out
			while(index>0 && a.getAt(index-1) >= temp)
			{
				value = a.getAt(index-1)
				a.putAt(index,value)

## gist:1743346
input = args[0] as Integer
top = -1
stack = new long[input]
def push(long j)
{
		stack.putAt(++top,j)
}
def pop()
{
	stack.getAt(top--)

## #reverse.groovy
/*
	These two inputs input and input2 are passed via command line
*/
//input as a String for reversal!
input2 = args[1]
//input for the size of Stack!
input = args[0] as Integer
top = -1
stack = new String[input]
boolean full = false

## #delimter.groovy
/*
	These two inputs input and input2 are passed via command line
*/
input2 = args[0]
//input for the size of Stack!
input = input2.size()
top = -1
stack = new String[input]
boolean full = false
def push(String j)

## #xray.html
<html>
<head>
	<title>Play With Pixel</title>
	<style>
	canvas { margin: 0px auto 0; display: block; }
</style>
</head>
<body>
<canvas id="canvas" height="900" width="800"></canvas>
<script>

## #spell.groovy
//a book keep!
def a = ["grails","griffon","gradle","groovy"]
//user sentence
def sentence = "gralis grfifon grovoy gralde"
def split = sentence.split(' ')
def bool = false
split.each {
		i = 0
		def temp = []
		temp << it.split{it=""}

## #chain.groovy
//http://cse0812.blogspot.in/2012/02/problem-from-top-coder.html
def a = [".15", "7..", "402", "..3"]
c = a.permutations() as List
ans = []
c.each {
     ans << it.join().tokenize('.')*.toList().collect{ it*.toInteger().sum() }
}
println ans.flatten().max()
	//map for managing the conversion from roman to no's
	def map =[I:1,II:2,III:3,IV:4,V:5,VI:6,VII:7,VIII:8,IX:9,X:10,XI:11]
	//map for managing the conversion from no to romans
	def map1 = ['1':"I",'2':"II",'3':"III",'4':"IV",'5':"V",'6':"VI",'7':"VII",'8':"VIII",'9':"IX",'10':"X",'11':"XI"]
	//temp variables
	ans = []
	res = []
	//final result
	res1 = []
	//for managing the flow of algorithm
	//change this array and play with Bubble Sort!
	a = [1,43,5,67,8,912,3,465,89,89,82,34]
	println a.size()
	for(out in (a.size()-2)..2)
	{
	0.upto(out) { index ->
	if(a[index] > a[index+1])
	swap(index,index+1)
	}
	}
	//change this array and play with selection sort :)
	a = [2,34,4,123,45,56,3,56,67,87,21,45,56,67,22,4234,4234,2342,1,34,546,67,677,343,4,41,32,456,1341,13,454,234,453,565,5,524,234,234,5456,567,673,245,567,78,78,324,56576,782,435,676,873,2,345,6767,7,3463,3,6767673,34534,2,345,656,3,5652,1,34345,3453545,35345356,66,7883345,676787,8988]
	b = a
	long startTime = System.currentTimeMillis();
	(0..(a.size()-2)).each {
	minimumValue = it
	(it+1).upto(a.size()-1){ insideElement ->
	if(a[insideElement] < a[minimumValue])
	minimumValue = insideElement
	}
	input = args[0] as Integer
	top = -1
	stack = new long[input]
	def push(long j)
	{
	stack.putAt(++top,j)
	}
	def pop()
	{
	stack.getAt(top--)
	/*
	These two inputs input and input2 are passed via command line
	*/
	//input as a String for reversal!
	input2 = args[1]
	//input for the size of Stack!
	input = args[0] as Integer
	top = -1
	stack = new String[input]
	boolean full = false
	/*
	These two inputs input and input2 are passed via command line
	*/
	input2 = args[0]
	//input for the size of Stack!
	input = input2.size()
	top = -1
	stack = new String[input]
	boolean full = false
	def push(String j)
	<html>
	<head>
	<title>Play With Pixel</title>
	<style>
	canvas { margin: 0px auto 0; display: block; }
	</style>
	</head>
	<body>
	<canvas id="canvas" height="900" width="800"></canvas>
	<script>
	//a book keep!
	def a = ["grails","griffon","gradle","groovy"]
	//user sentence
	def sentence = "gralis grfifon grovoy gralde"
	def split = sentence.split(' ')
	def bool = false
	split.each {
	i = 0
	def temp = []
	temp << it.split{it=""}
	//http://cse0812.blogspot.in/2012/02/problem-from-top-coder.html
	def a = [".15", "7..", "402", "..3"]
	c = a.permutations() as List
	ans = []
	c.each {
	ans << it.join().tokenize('.').toList().collect{ it.toInteger().sum() }
	}
	println ans.flatten().max()