1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
|
#!/bin/python3
import math
import os
import random
import re
import sys
#
# Complete the 'minimumNumber' function below.
#
# The function is expected to return an INTEGER.
# The function accepts following parameters:
# 1. INTEGER n
# 2. STRING password
#
def minimumNumber(n, password):
# Return the minimum number of characters to make the password strong
numbers = "0123456789"
lower_case = "abcdefghijklmnopqrstuvwxyz"
upper_case = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
special_characters = "!@#$%^&*()-+"
isnum,islower,isupper,isspecial=0,0,0,0
for i in password:
if i in numbers: isnum=1
if i in lower_case: islower=1
if i in upper_case: isupper=1
if i in special_characters: isspecial=1
cnt=len(password)
isSum=4-(isnum+islower+isupper+isspecial)
if isSum+cnt<6: return 6-(isSum+cnt)+isSum
else :return isSum
if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')
n = int(input().strip())
password = input()
answer = minimumNumber(n, password)
fptr.write(str(answer) + '\n')
fptr.close()
|
cs |
반응형
'python-algorithm' 카테고리의 다른 글
백준 20540 연길이의 이상형 (0) | 2021.11.02 |
---|---|
Hacker rank Find the Median (0) | 2021.10.28 |
Hacker rank CamelCase (0) | 2021.10.28 |
Hacker rank Sparse Arrays (0) | 2021.10.28 |
Hacker rank Left Rotation (0) | 2021.10.28 |
댓글