알고리즘 문제 풀기/HackerRank 썸네일형 리스트형 HackerRank - Mini-Max Sum https://www.hackerrank.com/challenges/mini-max-sum/problem HackerRank - Mini-Max Sum #!/bin/python3import mathimport osimport randomimport reimport sysdef 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/python3import mathimport osimport randomimport reimport sysdef 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) HackerRank - Plus Minus https://www.hackerrank.com/challenges/plus-minus/problem HackerRank - Plus Minus x#!/bin/python3import mathimport osimport randomimport reimport sysdef plusMinus(arr): numOfElement = len(arr) numOfPlus = 0 numOfMinus = 0 numOfZero = 0 for number in arr: if(number 0): numOfPlus += 1 else: numOfZero += 1 print(round(numOfPlus / numOfElement, 6)) print(round(numOfMinus / numOfElement, 6)) pri.. HackerRank - Diagonal Difference https://www.hackerrank.com/challenges/diagonal-difference/problem HackerRank - Diagonal Difference #!/bin/python3import mathimport osimport randomimport reimport sysdef diagonalDifference(arr): firstDiagonal = 0 secondDiagonal = 0 for i in range(0, len(arr)): firstDiagonal += arr[i][i] for i in range(0, len(arr)): secondDiagonal += arr[i][len(arr)-1-i] diagonalDifference = firstDiagonal - s.. HackerRank - A Very Big Sum https://www.hackerrank.com/challenges/a-very-big-sum/problem HackerRank - A Very Big Sum #!/bin/python3import mathimport osimport randomimport reimport sysdef aVeryBigSum(ar): sum = 0 for number in ar: sum += number return sumif __name__ == '__main__': fptr = open(os.environ['OUTPUT_PATH'], 'w') ar_count = int(input()) ar = list(map(int, input().rstrip().split())) result = aVeryBigSum(ar.. HackerRank - Compare the Triplets https://www.hackerrank.com/challenges/compare-the-triplets/problem HackerRank - Compare the Triplets #!/bin/python3import mathimport osimport randomimport reimport sysdef compareTriplets(a, b): alicePoint = 0 bobPoint = 0 for i in range(0, 3): if(a[i] > b[i]): alicePoint += 1 elif(a[i] Hackerrank - Simple Array Sum https://www.hackerrank.com/challenges/simple-array-sum/problem Hackerrank - Simple Array Sum #!/bin/python3import osimport sysdef simpleArraySum(ar): sum = 0 for number in ar: sum += number return sumif __name__ == '__main__': fptr = open(os.environ['OUTPUT_PATH'], 'w') ar_count = int(input()) ar = list(map(int, input().rstrip().split())) result = simpleArraySum(ar) fptr.write(str(resul.. HackerRank - Solve Me First https://www.hackerrank.com/challenges/solve-me-first/problem HackerRank - Solve Me First def solveMeFirst(a, b): return a + b num1 = int(input()) num2 = int(input()) res = solveMeFirst(num1, num2) print(res) 이전 1 2 3 다음