본문 바로가기

HackerRank - Between Two Sets https://www.hackerrank.com/challenges/between-two-sets/problem HackerRank - Between Two Sets ​x#!/bin/python3​from fractions import gcdimport osimport sys​​def getTotalX(a, b): lcm_a = int(getLcmByArr(a)) gcd_b = int(getGcdByArr(b)) count = 0 for i in range(lcm_a, gcd_b+1, lcm_a): if(gcd_b % i == 0): count += 1 return count​​def lcm(a, b): return a * b / gcd(a, b)​​def getGcdByArr(arr): outputGc..
HackerRank - Kangaroo https://www.hackerrank.com/challenges/kangaroo/problem HackerRank - Kangaroo #!/bin/python3​import mathimport osimport randomimport reimport sys​​def kangaroo(x1, v1, x2, v2): output = 'NO'​ while((x1 >= x2 and v1
HackerRank - Apple and Orange https://www.hackerrank.com/challenges/apple-and-orange/problem HackerRank - Apple and Orange #!/bin/python3​import mathimport osimport randomimport reimport sys​​def countApplesAndOranges(s, t, a, b, apples, oranges): appleCount = 0 orangeCount = 0 fellPointApple = list(map(lambda apple: apple + a, apples)) fellPointOrange = list(map(lambda orange: orange + b, oranges))​ for point in fellPointAp..
HackerRank - Grading Students https://www.hackerrank.com/challenges/grading/problem HackerRank - Grading Students #!/bin/python3​import osimport sys​​def gradingStudents(grades): for i in range(0, len(grades)): c = grades[i] % 5 if(grades[i] > 37 and 5-c 100): grades[i] = 100​ return grades​​if __name__ == '__main__': f = open(os.environ['OUTPUT_PATH'], 'w')​ n = int(input())​ grades = []​ for _ in range(n): grades_item = in..
HackerRank - Time Conversion https://www.hackerrank.com/challenges/time-conversion/problem HackerRank - Time Conversion #!/bin/python3​import osimport sys​​def timeConversion(s): hh = s[0:2] period = s[-2:]​ if(period == 'AM'): if(hh == '12'): output = '00' + s[2:-2] else: output = s[0:-2] elif(period == 'PM'): if(hh == '12'): output = s[0:-2] else: output = str(int(hh) + 12) + s[2:-2]​ return output​​if __name__ == '__main..
HackerRank - Birthday Cake Candles https://www.hackerrank.com/challenges/birthday-cake-candles/problem HackerRank - Birthday Cake Candles #!/bin/python3​import mathimport osimport randomimport reimport sys​​def birthdayCakeCandles(ar): ar.sort(reverse=True) highestCandleLength = ar[0] numberCandlesCanBlow = ar.count(highestCandleLength) return numberCandlesCanBlow​​if __name__ == '__main__': fptr = open(os.environ['OUTPUT_PATH'],..
HackerRank - Mini-Max Sum https://www.hackerrank.com/challenges/mini-max-sum/problem HackerRank - Mini-Max Sum #!/bin/python3​import mathimport osimport randomimport reimport sys​​def miniMaxSum(arr): arr.sort() everySum = 0​ for number in arr: everySum += number​ miniSum = everySum - arr[4] maxSum = everySum - arr[0]​ print(miniSum, maxSum)​​if __name__ == '__main__': arr = list(map(int, input().rstrip().split()))​ mini..
HackerRank - Staircase https://www.hackerrank.com/challenges/staircase/problem HackerRank - Staircase #!/bin/python3​import mathimport osimport randomimport reimport sys​​def staircase(n): for i in range(0, n): for j in range(0, n-(i+1)): print(' ', end='') for j in range(0, i+1): print('#', end='') print()​​if __name__ == '__main__': n = int(input())​ staircase(n)​