Commit 18fb9e1

authored

Merge pull request #21 from Nickruti/master

Added two new solved problems on Hackerrank

2 parents 8013708 + f76c882 commit 18fb9e1Copy full SHA for 18fb9e1

File tree

+61

-0

lines changed

+61

-0

lines changed

Lines changed: 38 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,38 @@`
	`1`	`+#!/bin/python3`
	`2`	`+`
	`3`	`+import math`
	`4`	`+import os`
	`5`	`+import random`
	`6`	`+import re`
	`7`	`+import sys`
	`8`	`+from itertools import combinations_with_replacement`
	`9`	`+`
	`10`	`+# Complete the stones function below.`
	`11`	`+def stones(n, a, b):`
	`12`	`+ arr = []`
	`13`	`+ perm = list(combinations_with_replacement([a, b], n-1))`
	`14`	`+ for i in perm:`
	`15`	`+ arr.append(sum(i))`
	`16`	`+ arr = list(set(arr))`
	`17`	`+ arr.sort()`
	`18`	`+ return arr`
	`19`	`+`
	`20`	`+`
	`21`	`+if __name__ == '__main__':`
	`22`	`+ fptr = open(os.environ['OUTPUT_PATH'], 'w')`
	`23`	`+`
	`24`	`+ T = int(input())`
	`25`	`+`
	`26`	`+ for T_itr in range(T):`
	`27`	`+ n = int(input())`
	`28`	`+`
	`29`	`+ a = int(input())`
	`30`	`+`
	`31`	`+ b = int(input())`
	`32`	`+`
	`33`	`+ result = stones(n, a, b)`
	`34`	`+`
	`35`	`+ fptr.write(' '.join(map(str, result)))`
	`36`	`+ fptr.write('\n')`
	`37`	`+`
	`38`	`+ fptr.close()`

Lines changed: 23 additions & 0 deletions

Comments

(0)