atiurrs
BAN USERimport random
input = random.sample(range(30), 20)
print input
input.sort()
output = [input[0]]
for i in range(1, len(input)):
if i % 2 == 1 and i + 1 < len(input):
output.extend([input[i+1], input[i]])
if len(input) % 2 == 1:
output.append(input[-1])
print output
input = [7, 6, 5, 4, 3, 2, 1, 0]
print input
sorted_output = sorted(input)
sorted_output.reverse()
output = [sorted_output[0]]
for i in range(1, len(input)):
if i % 2 == 1 and len(input) > i + 1:
output.extend([sorted_output[i+1],sorted_output[i]])
if len(input) % 2 == 0:
output.append(sorted_output[-1])
print output
import sys
min_x = min_y = sys.maxint
max_x = max_y = -1
cur_y = -1
for line in sys.stdin:
cur_y = cur_y + 1
nodes = [int(token) for token in line.strip().split()]
if 1 in nodes:
max_y = cur_y
if min_y == sys.maxint:
min_y = cur_y
if nodes.index(1) < min_x:
min_x = nodes.index(1)
nodes.reverse()
i = len(nodes) - 1 - nodes.index(1)
if i > max_x:
max_x = i
print min_x, min_y, max_x, max_y
def sub_string(string_a, string_b):
chars = sorted(string_a)
for start in range(len(string_b)-len(chars)):
if chars == sorted(string_b[start:start+len(chars)]):
return True
return False
print sub_string("xyz", "afdgzyxksldfm")
print sub_string("xyz", "afdgzyaxksldfm")
import sys
from itertools import combinations
nodes = dict()
edges = dict()
for line in sys.stdin:
pair = [int(node) for node in line.strip().split()]
nodes[pair[0]] = True
nodes[pair[1]] = True
edges[(pair[0],pair[1])] = True
edges[(pair[1],pair[0])] = True
num_triangles = 0
for combination in combinations(nodes, 3):
a, b, c, = tuple(combination)
if edges.has_key((a, b)) and edges.has_key((b, c)) and edges.has_key((c, a)):
num_triangles = num_triangles + 1
print num_triangles
def next_higher(a):
a = [int(i) for i in str(a)]
length = len(a)
index = -1
for i in range(length-1, -1, -1):
if a[i] < a[length-1]:
index = i
break
b = a[0:index]
b.append(a[length-1])
c=a[index:length-1]
c.sort()
b.extend(c)
return reduce(lambda a, b: a*10+b, b)
print next_higher(25468), next_higher(21765), next_higher(54321)
Output:
Complexity O(N), Space: O(1)
- atiurrs April 23, 2014